{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T3C3JXLTVRCQ77M6LHXTAV54MU","short_pith_number":"pith:T3C3JXLT","schema_version":"1.0","canonical_sha256":"9ec5b4dd73ac450ffd9e59ef3057bc6515b41e1af0126233b1d483d30d0778bd","source":{"kind":"arxiv","id":"2103.03771","version":2},"attestation_state":"computed","paper":{"title":"Greedy Causal Discovery is Geometric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Liam Solus, Petter Restadh, Svante Linusson","submitted_at":"2021-03-05T16:00:51Z","abstract_excerpt":"Finding a directed acyclic graph (DAG) that best encodes the conditional independence statements observable from data is a central question within causality. Algorithms that greedily transform one candidate DAG into another given a fixed set of moves have been particularly successful, for example the GES, GIES, and MMHC algorithms. In 2010, Studen\\'y, Hemmecke and Lindner introduced the characteristic imset polytope, $\\operatorname{CIM}_p$, whose vertices correspond to Markov equivalence classes, as a way of transforming causal discovery into a linear optimization problem. We show that the mov"},"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":"2103.03771","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-03-05T16:00:51Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"43309926c12ec3cd037c99b6364b41538af0a0dd00b11fd6e007756bb5194049","abstract_canon_sha256":"9429cb011cab6f01b9af413b9cf0f160ee69ceaa7c1446aec39a069690c26781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:53:38.845801Z","signature_b64":"MGJcFgsEBwvPVQY46+fTDmicXkdiq5us142gHDutmYaa23iDHykKYbCu9LWnywaTt7psE2ZMvbCm+DhlJ5b/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ec5b4dd73ac450ffd9e59ef3057bc6515b41e1af0126233b1d483d30d0778bd","last_reissued_at":"2026-07-05T04:53:38.845362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:53:38.845362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Causal Discovery is Geometric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Liam Solus, Petter Restadh, Svante Linusson","submitted_at":"2021-03-05T16:00:51Z","abstract_excerpt":"Finding a directed acyclic graph (DAG) that best encodes the conditional independence statements observable from data is a central question within causality. Algorithms that greedily transform one candidate DAG into another given a fixed set of moves have been particularly successful, for example the GES, GIES, and MMHC algorithms. In 2010, Studen\\'y, Hemmecke and Lindner introduced the characteristic imset polytope, $\\operatorname{CIM}_p$, whose vertices correspond to Markov equivalence classes, as a way of transforming causal discovery into a linear optimization problem. We show that the mov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03771","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/2103.03771/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":"2103.03771","created_at":"2026-07-05T04:53:38.845418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03771v2","created_at":"2026-07-05T04:53:38.845418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03771","created_at":"2026-07-05T04:53:38.845418+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3C3JXLTVRCQ","created_at":"2026-07-05T04:53:38.845418+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3C3JXLTVRCQ77M6","created_at":"2026-07-05T04:53:38.845418+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3C3JXLT","created_at":"2026-07-05T04:53:38.845418+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU","json":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU.json","graph_json":"https://pith.science/api/pith-number/T3C3JXLTVRCQ77M6LHXTAV54MU/graph.json","events_json":"https://pith.science/api/pith-number/T3C3JXLTVRCQ77M6LHXTAV54MU/events.json","paper":"https://pith.science/paper/T3C3JXLT"},"agent_actions":{"view_html":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU","download_json":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU.json","view_paper":"https://pith.science/paper/T3C3JXLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03771&json=true","fetch_graph":"https://pith.science/api/pith-number/T3C3JXLTVRCQ77M6LHXTAV54MU/graph.json","fetch_events":"https://pith.science/api/pith-number/T3C3JXLTVRCQ77M6LHXTAV54MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU/action/storage_attestation","attest_author":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU/action/author_attestation","sign_citation":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU/action/citation_signature","submit_replication":"https://pith.science/pith/T3C3JXLTVRCQ77M6LHXTAV54MU/action/replication_record"}},"created_at":"2026-07-05T04:53:38.845418+00:00","updated_at":"2026-07-05T04:53:38.845418+00:00"}