{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OZRE32VLC5JPYNARV2NGRONOKQ","short_pith_number":"pith:OZRE32VL","schema_version":"1.0","canonical_sha256":"76624deaab1752fc3411ae9a68b9ae541e8bdcfd1fc58c2435e28c67f8ac58db","source":{"kind":"arxiv","id":"2210.06201","version":2},"attestation_state":"computed","paper":{"title":"Diffusion Models for Causal Discovery via Topological Ordering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alison Q O'Neil, Pedro Sanchez, Sotirios A. Tsaftaris, Xiao Liu","submitted_at":"2022-10-12T13:36:29Z","abstract_excerpt":"Discovering causal relations from observational data becomes possible with additional assumptions such as considering the functional relations to be constrained as nonlinear with additive noise (ANM). Even with strong assumptions, causal discovery involves an expensive search problem over the space of directed acyclic graphs (DAGs). \\emph{Topological ordering} approaches reduce the optimisation space of causal discovery by searching over a permutation rather than graph space. For ANMs, the \\emph{Hessian} of the data log-likelihood can be used for finding leaf nodes in a causal graph, allowing "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2210.06201","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-12T13:36:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"157fa65988d793402235ec84fb141b6d39d13602bb9845ef9f2a718259304a51","abstract_canon_sha256":"5cea5c0f2adbae0a79fa2ea932d8d3e0d9aef1675bcfea6fc01862705ff057eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:25.790902Z","signature_b64":"cqs2zxVI+uJCtDuhoHE1YojxlGCmakCVpb/d5Gw2TdHUhRoNxfL3C/HySv+pgXpv0PsA+Q31GQWROL3sdYYeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76624deaab1752fc3411ae9a68b9ae541e8bdcfd1fc58c2435e28c67f8ac58db","last_reissued_at":"2026-07-05T06:24:25.790398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:25.790398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion Models for Causal Discovery via Topological Ordering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alison Q O'Neil, Pedro Sanchez, Sotirios A. Tsaftaris, Xiao Liu","submitted_at":"2022-10-12T13:36:29Z","abstract_excerpt":"Discovering causal relations from observational data becomes possible with additional assumptions such as considering the functional relations to be constrained as nonlinear with additive noise (ANM). Even with strong assumptions, causal discovery involves an expensive search problem over the space of directed acyclic graphs (DAGs). \\emph{Topological ordering} approaches reduce the optimisation space of causal discovery by searching over a permutation rather than graph space. For ANMs, the \\emph{Hessian} of the data log-likelihood can be used for finding leaf nodes in a causal graph, allowing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06201","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.06201/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.06201","created_at":"2026-07-05T06:24:25.790453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06201v2","created_at":"2026-07-05T06:24:25.790453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06201","created_at":"2026-07-05T06:24:25.790453+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZRE32VLC5JP","created_at":"2026-07-05T06:24:25.790453+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZRE32VLC5JPYNAR","created_at":"2026-07-05T06:24:25.790453+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZRE32VL","created_at":"2026-07-05T06:24:25.790453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.03669","citing_title":"Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18878","citing_title":"Prognostic Value of Lung Ultrasound Biomarkers for Readmission Risk in Congestive Heart Failure: A Pilot Data-Driven Analysis","ref_index":296,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ","json":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ.json","graph_json":"https://pith.science/api/pith-number/OZRE32VLC5JPYNARV2NGRONOKQ/graph.json","events_json":"https://pith.science/api/pith-number/OZRE32VLC5JPYNARV2NGRONOKQ/events.json","paper":"https://pith.science/paper/OZRE32VL"},"agent_actions":{"view_html":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ","download_json":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ.json","view_paper":"https://pith.science/paper/OZRE32VL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06201&json=true","fetch_graph":"https://pith.science/api/pith-number/OZRE32VLC5JPYNARV2NGRONOKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OZRE32VLC5JPYNARV2NGRONOKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ/action/storage_attestation","attest_author":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ/action/author_attestation","sign_citation":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ/action/citation_signature","submit_replication":"https://pith.science/pith/OZRE32VLC5JPYNARV2NGRONOKQ/action/replication_record"}},"created_at":"2026-07-05T06:24:25.790453+00:00","updated_at":"2026-07-05T06:24:25.790453+00:00"}