{"id":"W4385849427","doi":"10.4230/lipics.itcs.2023.73","title":"Recovery from Non-Decomposable Distance Oracles","year":2023,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming distance; Sequence (biology); Combinatorics; Edit distance; Function (biology); Mathematics; Earth mover's distance; Dynamic time warping; Set (abstract data type); Alphabet; Estimator; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006975082,0.0009099892,0.001102499,0.0003844422,0.0005352033,0.002098543,0.004935266,0.0007310193,0.00003958114],"category_scores_gemma":[0.0001130458,0.0008350075,0.0005731451,0.0003951422,0.0001211717,0.002824924,0.007696982,0.001344188,0.0008881002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002790506,"about_ca_system_score_gemma":0.0003016147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003503057,"about_ca_topic_score_gemma":0.00009135161,"domain_scores_codex":[0.9949471,0.00005895833,0.001877137,0.001016084,0.0009685143,0.001132147],"domain_scores_gemma":[0.9942597,0.0004202415,0.001229387,0.003347999,0.0003760811,0.0003666579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008438802,0.002356693,0.008052834,0.007740676,0.002938733,0.0002353169,0.02537774,0.02620607,0.0002149633,0.02006758,0.675168,0.2307975],"study_design_scores_gemma":[0.001978352,0.0001736961,0.001384109,0.001713609,0.00007116664,0.00001295158,0.0003397621,0.7915834,0.0005143656,0.03443583,0.1661358,0.001656997],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01209858,0.0001652762,0.9661186,0.0004597662,0.007824482,0.00152844,0.009267345,0.0008747011,0.001662823],"genre_scores_gemma":[0.05582297,0.00133616,0.9090617,0.002114317,0.001954788,0.001076798,0.02505116,0.0003733624,0.003208785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7653773,"threshold_uncertainty_score":0.9998899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02600066608497223,"score_gpt":0.2719781890860969,"score_spread":0.2459775230011247,"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."}}