{"paper":{"title":"GraphInfer: Statistical Inference for Decomposable Graphical Models in R","arxiv_id":"2611.17074","primary_cat":"stat.ME","submitted_at":"2026-11-12T16:46:17+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"Decomposable graphical models combine closed-form maximum likelihood estimation with local model comparison, which makes structure inference practical with many variables.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.07,"main_claim_p":0.18,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.95,"id":"s1","own":true,"role":"contribution","text":"The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.71,"main_claim_p":0.12,"quantitative":false,"quantitative_p":0.15,"role_probabilities":{"gap":0.0,"method":0.05,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.95,"interpretation":0.0}},{"i":2,"p":0.87,"id":"s2","own":false,"role":"method","text":"Structure inference ranges from exact minimum forests and stepwise search to stochastic global search.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.47,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.87,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.13,"interpretation":0.0}},{"i":3,"p":0.99,"id":"s3","own":true,"role":"method","text":"Nested models are compared by likelihood-ratio tests whose null distributions are exact in finite samples: conditionally on the discrete data for edges with a continuous endpoint, and conditionally on the discrete margins of the smaller model for edges between discrete variables.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.73,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.99,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":4,"p":0.98,"id":"s4","own":true,"role":"method","text":"Missing values are handled by EM, by structural EM, which reuses complete-data searches through a weighted pseudo-sample of expected sufficient statistics, and by multiple imputation; selected models are fit to the observed-data likelihood.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.75,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.98,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":5,"p":0.85,"id":"s5","own":true,"role":"contribution","text":"The package also treats the graphical models induced by irreversible event accumulation on trees: a search over the compatible graphs whose tree moves overcome an obstruction to single-edge moves, fitting of the full accumulation model with measurement noise and bootstrap tests of the accumulation hypothesis.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.81,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.14,"role_probabilities":{"gap":0.0,"method":0.15,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.85,"interpretation":0.0}},{"i":6,"p":0.6,"id":"s6","own":true,"role":"contribution","text":"GraphInfer is an independent, pure R successor to the archived package gRapHD.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.54,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.34,"role_probabilities":{"gap":0.01,"method":0.0,"result":0.0,"background":0.39,"limitation":0.0,"future_work":0.0,"contribution":0.6,"interpretation":0.0}},{"i":7,"p":0.52,"id":"s7","own":true,"role":"method","text":"The implementation is validated against independent references, and simulation studies inform its defaults.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.52,"result":0.14,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.33,"interpretation":0.01}}]},"compiled":{"main_claim":{"p":0.37,"text":"The implementation is validated against independent references, and simulation studies inform its defaults.","location":"abstract s7","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":6291,"cost_usd_reported":0.0},"compiled_at":"2026-11-14","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.06,"states_limitation":0.12,"human_participants":0.04,"controlled_comparison":0.05,"randomized_assignment":0.01,"states_quantitative_result":0.05,"compares_with_prior_results":0.38,"mentions_code_or_data_availability":0.59},"evidential_basis":{"p":0.93,"value":"simulation or computation","probabilities":{"argument":0.05,"literature":0.01,"proof_or_derivation":0.01,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.93}},"contribution_type":{"p":1.0,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":1.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.59,"text":"The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models.","location":"abstract s1"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":8,"sentences_in_abstract":8},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}