{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002683429,0.0007564757,0.001285477,0.001617429,0.001785721,0.005046956,0.002317142,0.001585491,0.008481081],"category_scores_gemma":[0.01450593,0.0006354583,0.001321328,0.002263016,0.005795494,0.01443288,0.005238116,0.003101013,0.001805999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002446137,"about_ca_system_score_gemma":0.002469858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001415467,"about_ca_topic_score_gemma":0.001517117,"domain_scores_codex":[0.9956926,0.001216454,0.0003216063,0.0009852985,0.001214506,0.0005695486],"domain_scores_gemma":[0.9920086,0.003523725,0.0005069373,0.003089776,0.0006036247,0.0002673859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007186912,0.00004972383,0.0002354631,0.00005935055,0.00001170466,0.00002529488,0.0001393136,0.005067448,0.001019066,0.9528926,0.001418708,0.03900942],"study_design_scores_gemma":[0.00002977693,0.00003528044,0.00008416895,0.00001720147,0.0000131815,0.00004782261,0.00006644858,0.03121556,0.004027127,0.9582697,0.006176659,0.00001687695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04633313,0.0002491183,0.9294928,0.001056367,0.0001176421,0.000178665,0.0002355067,0.001259901,0.02107681],"genre_scores_gemma":[0.563876,0.0004612258,0.4175492,0.0007626567,0.0001929288,0.0004894086,0.0006265478,0.0006100357,0.01543211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008481081,"threshold_uncertainty_score":0.02837205,"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."}}