{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QXHY75W5HT5OMS47TCBE6L36R5","short_pith_number":"pith:QXHY75W5","schema_version":"1.0","canonical_sha256":"85cf8ff6dd3cfae64b9f98824f2f7e8f60105eac3ad757bbb097583aee2e50a0","source":{"kind":"arxiv","id":"2410.08787","version":1},"attestation_state":"computed","paper":{"title":"Efficient Differentiable Discovery of Causal Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arash Mehrjou, Mathieu Chevalley, Patrick Schwab","submitted_at":"2024-10-11T13:11:55Z","abstract_excerpt":"In the algorithm Intersort, Chevalley et al. (2024) proposed a score-based method to discover the causal order of variables in a Directed Acyclic Graph (DAG) model, leveraging interventional data to outperform existing methods. However, as a score-based method over the permutahedron, Intersort is computationally expensive and non-differentiable, limiting its ability to be utilised in problems involving large-scale datasets, such as those in genomics and climate models, or to be integrated into end-to-end gradient-based learning frameworks. We address this limitation by reformulating Intersort "},"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":"2410.08787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-11T13:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"5fed98d15520670484f28b858e5aaf3e9bf33ec2cc5e67efc4bb59df79bf7826","abstract_canon_sha256":"3ba58d20ee8047c0ad21fd8ae29fa523604392db307acbca558a0587b458ea4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:17.630755Z","signature_b64":"V+WGIpDwxTHkocZS0UNoS0QqdTCrMcvOeKYyiObAPbkpZsaqCCtF380MktlV/FYRXsvT6UQhhTxNbx3M9WvMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85cf8ff6dd3cfae64b9f98824f2f7e8f60105eac3ad757bbb097583aee2e50a0","last_reissued_at":"2026-07-05T09:19:17.630300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:17.630300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Differentiable Discovery of Causal Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arash Mehrjou, Mathieu Chevalley, Patrick Schwab","submitted_at":"2024-10-11T13:11:55Z","abstract_excerpt":"In the algorithm Intersort, Chevalley et al. (2024) proposed a score-based method to discover the causal order of variables in a Directed Acyclic Graph (DAG) model, leveraging interventional data to outperform existing methods. However, as a score-based method over the permutahedron, Intersort is computationally expensive and non-differentiable, limiting its ability to be utilised in problems involving large-scale datasets, such as those in genomics and climate models, or to be integrated into end-to-end gradient-based learning frameworks. We address this limitation by reformulating Intersort "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08787","kind":"arxiv","version":1},"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/2410.08787/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":"2410.08787","created_at":"2026-07-05T09:19:17.630380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08787v1","created_at":"2026-07-05T09:19:17.630380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08787","created_at":"2026-07-05T09:19:17.630380+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXHY75W5HT5O","created_at":"2026-07-05T09:19:17.630380+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXHY75W5HT5OMS47","created_at":"2026-07-05T09:19:17.630380+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXHY75W5","created_at":"2026-07-05T09:19:17.630380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03227","citing_title":"Learning Temporal Causal Structure via Smooth Differentiable Optimization","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5","json":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5.json","graph_json":"https://pith.science/api/pith-number/QXHY75W5HT5OMS47TCBE6L36R5/graph.json","events_json":"https://pith.science/api/pith-number/QXHY75W5HT5OMS47TCBE6L36R5/events.json","paper":"https://pith.science/paper/QXHY75W5"},"agent_actions":{"view_html":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5","download_json":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5.json","view_paper":"https://pith.science/paper/QXHY75W5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08787&json=true","fetch_graph":"https://pith.science/api/pith-number/QXHY75W5HT5OMS47TCBE6L36R5/graph.json","fetch_events":"https://pith.science/api/pith-number/QXHY75W5HT5OMS47TCBE6L36R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5/action/storage_attestation","attest_author":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5/action/author_attestation","sign_citation":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5/action/citation_signature","submit_replication":"https://pith.science/pith/QXHY75W5HT5OMS47TCBE6L36R5/action/replication_record"}},"created_at":"2026-07-05T09:19:17.630380+00:00","updated_at":"2026-07-05T09:19:17.630380+00:00"}