{"paper":{"title":"Causal Heteroscedastic Structure Learning From Incomplete Temporal data","arxiv_id":"2611.10668","primary_cat":"cs.LG","submitted_at":"2026-11-07T11:34:40+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":"Discovering causal structures in multivariate time series (MTS) is critical in domains such as finance and neuroscience, yet remains challenging in practice due to three distinct obstacles.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.06,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.46,"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.88,"id":"s1","own":false,"role":"background","text":"First, MTS are routinely corrupted by missing values, where naive impute-then-discover pipelines distort the underlying data distribution and yield spurious causal graphs.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.1,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.12,"method":0.0,"result":0.0,"background":0.88,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.77,"id":"s2","own":false,"role":"background","text":"Second, identifying instantaneous effects is difficult even on complete data, and missingness further entangles imputation with graph recovery.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.1,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.11,"role_probabilities":{"gap":0.23,"method":0.0,"result":0.0,"background":0.77,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.89,"id":"s3","own":false,"role":"background","text":"Third, real-world data frequently exhibits heteroscedastic noise with variance driven by both instantaneous and lagged causes, violating the core assumptions of standard discovery methods.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.11,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.11,"method":0.0,"result":0.0,"background":0.89,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":4,"p":0.93,"id":"s4","own":false,"role":"gap","text":"Existing approaches fail to address these challenges concurrently, typically presuming complete data, homoscedastic noise, or strictly time-lagged relationships.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.93,"method":0.0,"result":0.0,"background":0.07,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.79,"id":"s5","own":true,"role":"result","text":"Crucially, we show through ablation studies that resolving these issues sequentially, rather than jointly, leads to a substantial degradation in performance.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.24,"quantitative":true,"quantitative_p":0.5,"role_probabilities":{"gap":0.06,"method":0.0,"result":0.79,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.1,"interpretation":0.05}},{"i":6,"p":0.92,"id":"s6","own":true,"role":"contribution","text":"To overcome this, we introduce Cheesefill, an optimal transport framework for causal structure learning under missingness and heteroscedastic noise.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.84,"main_claim_p":0.21,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.08,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.92,"interpretation":0.0}},{"i":7,"p":0.98,"id":"s7","own":true,"role":"method","text":"Cheesefill parameterizes causal mechanisms using conditional normalizing flows and jointly learns a stochastic correction map that refines naive imputations into trajectories consistent with the inferred causal mechanisms.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.92,"main_claim_p":0.11,"quantitative":false,"quantitative_p":0.03,"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":8,"p":0.61,"id":"s8","own":true,"role":"method","text":"Theoretically, we prove that optimizing over stochastic correction maps is equivalent to a conditional kernel reformulation of the Kantorovich problem, from which our neural parameterization yields a tractable objective.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.61,"result":0.01,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.38,"interpretation":0.0}},{"i":9,"p":1.0,"id":"s9","own":true,"role":"result","text":"Extensive experiments on synthetic and real-world benchmarks demonstrate that Cheesefill consistently outperforms existing baselines across diverse missingness regimes.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.54,"quantitative":true,"quantitative_p":0.68,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.97,"text":"Extensive experiments on synthetic and real-world benchmarks demonstrate that Cheesefill consistently outperforms existing baselines across diverse missingness regimes.","location":"abstract s9","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":7673,"cost_usd_reported":0.0},"compiled_at":"2026-11-10","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.12,"states_limitation":0.09,"human_participants":0.07,"controlled_comparison":0.81,"randomized_assignment":0.02,"states_quantitative_result":0.06,"compares_with_prior_results":0.96,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.68,"value":"observation or experiment","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.01,"analysis_of_existing_data":0.0,"observation_or_experiment":0.68,"simulation_or_computation":0.31}},"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.95,"text":"To overcome this, we introduce Cheesefill, an optimal transport framework for causal structure learning under missingness and heteroscedastic noise.","location":"abstract s6"}},"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":10,"sentences_in_abstract":10},"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"}}}