{"id":"W1800611079","doi":"10.48550/arxiv.0904.0471","title":"Holographic algorithms without matchgates","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Algorithm; Time complexity; Counting problem; Pfaffian; Computer science; Context (archaeology); Mathematics; Algebraic number; Theoretical computer science; Graph; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007433045,0.0006193748,0.0006502661,0.0004265383,0.0002540842,0.0003012625,0.003244648,0.0005090026,0.0000278589],"category_scores_gemma":[0.00004090361,0.0005686177,0.0004399032,0.0006725491,0.0002240713,0.0003644617,0.001662133,0.001263677,0.0003537171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003173962,"about_ca_system_score_gemma":0.0001033037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003936337,"about_ca_topic_score_gemma":0.00000334063,"domain_scores_codex":[0.9966472,0.0002666361,0.0005207147,0.001414491,0.0004133605,0.0007375628],"domain_scores_gemma":[0.9970074,0.00008799027,0.0003394044,0.002162698,0.0001519011,0.0002505492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005911536,0.00152349,0.6756895,0.0004607767,0.0009642626,0.00130513,0.004217668,0.00240334,0.001646363,0.1147679,0.003628318,0.1933341],"study_design_scores_gemma":[0.0008076748,0.0002997027,0.2862937,0.0004296323,0.0001006217,0.0001272047,0.00005459829,0.01660459,0.003683609,0.6868911,0.002668668,0.002038797],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7000681,0.001383893,0.2891484,0.001653696,0.003137205,0.0005385875,0.00001838395,0.001297807,0.00275398],"genre_scores_gemma":[0.9484675,0.0002916129,0.04891229,0.001194242,0.0004824499,0.00006781571,0.00003212971,0.00004216577,0.0005097966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5721232,"threshold_uncertainty_score":0.9996765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03414086393585864,"score_gpt":0.2697213165234733,"score_spread":0.2355804525876147,"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."}}