{"id":"W2159711763","doi":"10.1109/aps.2010.5561664","title":"An efficient algorithm for solving inverse source problems using time domain TLM","year":2010,"lang":"en","type":"article","venue":"","topic":"Geophysical Methods and Applications","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Regularization (linguistics); Inverse problem; Algorithm; Inverse; Computer science; Time domain; Domain (mathematical analysis); Boundary (topology); Multi-source; Source model; Field (mathematics); Mathematics; Theoretical computer science; Artificial intelligence; Mathematical analysis; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615245,0.00009398416,0.00009828446,0.0000285503,0.00009720469,0.00003791573,0.0001009454,0.00005341197,0.00005857438],"category_scores_gemma":[0.000007137882,0.00008575998,0.00004557187,0.0001012947,0.00002301925,0.0000429319,0.0000154114,0.000111627,0.0000467039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001202238,"about_ca_system_score_gemma":0.000006449257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002131912,"about_ca_topic_score_gemma":0.000004874398,"domain_scores_codex":[0.9994717,0.000006251002,0.0001124769,0.0001422823,0.00006140368,0.0002058357],"domain_scores_gemma":[0.9996036,0.00005383702,0.00001490707,0.0002054161,0.00002713009,0.00009509821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.685509e-7,0.00004287219,0.000002359618,0.00001323591,0.000006566218,7.8649e-8,0.0001201477,0.06959052,0.8768359,0.0009781285,0.00006962251,0.05234027],"study_design_scores_gemma":[0.0001266873,0.00001304951,0.00003279289,0.00000426763,0.000007865019,0.00000132813,0.00003030951,0.9864424,0.007874225,0.001972002,0.003367213,0.0001278431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3225838,0.000001705443,0.6763706,0.00001455911,0.00006543122,0.0002202363,0.000005036366,0.0001969525,0.0005417233],"genre_scores_gemma":[0.08562791,1.743501e-7,0.9139415,0.0000248995,0.0001775914,0.00005191941,0.000005501105,0.00003082507,0.0001397086],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9168519,"threshold_uncertainty_score":0.349719,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01179299694672271,"score_gpt":0.2530862085952877,"score_spread":0.241293211648565,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}