{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:R34N3QCD2DKM2QPONSKJMU26CN","short_pith_number":"pith:R34N3QCD","canonical_record":{"source":{"id":"2311.10263","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-17T01:14:24Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"508a36b9c8d0ceca124b68816dcf6c5559bf2c3ab830a73138dacf24a04b016d","abstract_canon_sha256":"15575db17d355926be9bc4a570a9de5c02c9299545c99a07b98471af8b03c4be"},"schema_version":"1.0"},"canonical_sha256":"8ef8ddc043d0d4cd41ee6c9496535e13718ccd6ceb4a7d6ab4226a3d19703828","source":{"kind":"arxiv","id":"2311.10263","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10263","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10263v2","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10263","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"pith_short_12","alias_value":"R34N3QCD2DKM","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"pith_short_16","alias_value":"R34N3QCD2DKM2QPO","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"pith_short_8","alias_value":"R34N3QCD","created_at":"2026-07-05T08:37:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:R34N3QCD2DKM2QPONSKJMU26CN","target":"record","payload":{"canonical_record":{"source":{"id":"2311.10263","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-17T01:14:24Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"508a36b9c8d0ceca124b68816dcf6c5559bf2c3ab830a73138dacf24a04b016d","abstract_canon_sha256":"15575db17d355926be9bc4a570a9de5c02c9299545c99a07b98471af8b03c4be"},"schema_version":"1.0"},"canonical_sha256":"8ef8ddc043d0d4cd41ee6c9496535e13718ccd6ceb4a7d6ab4226a3d19703828","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:15.497374Z","signature_b64":"RYyBSVh3gwSHswcYo5NgukcSjO78N7diNFl+4zHBfTMpSAs3Y5wKOK/Egzreg3GiBh8jAG/5Ltls2lqM2/QHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef8ddc043d0d4cd41ee6c9496535e13718ccd6ceb4a7d6ab4226a3d19703828","last_reissued_at":"2026-07-05T08:37:15.496876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:15.496876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.10263","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:37:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfkJsBEkcCdjW9vLQi9crvDLY4cXiPmyk4wFeejjCHJk13Qk5qH0SB78j/uSyZtLRmoC8JHkbO7mfx1dTF3vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:04:49.534859Z"},"content_sha256":"71b4d77babe8f1963c0d272c6848c71164e1127982c341024e8e6f9f7502edb8","schema_version":"1.0","event_id":"sha256:71b4d77babe8f1963c0d272c6848c71164e1127982c341024e8e6f9f7502edb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:R34N3QCD2DKM2QPONSKJMU26CN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable Differentiable Causal Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Achille Nazaret, David Blei, Elham Azizi, Justin Hong","submitted_at":"2023-11-17T01:14:24Z","abstract_excerpt":"Inferring causal relationships as directed acyclic graphs (DAGs) is an important but challenging problem. Differentiable Causal Discovery (DCD) is a promising approach to this problem, framing the search as a continuous optimization. But existing DCD methods are numerically unstable, with poor performance beyond tens of variables. In this paper, we propose Stable Differentiable Causal Discovery (SDCD), a new method that improves previous DCD methods in two ways: (1) It employs an alternative constraint for acyclicity; this constraint is more stable, both theoretically and empirically, and fast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10263","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/2311.10263/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:37:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Udvo/gEU79GfjgnXcgFW6BsrTRB9TMJh7+nMMbEkw2jmgMYrHtt7DQt6JMPjQVrutYgDbACmMSBiVaGByqniBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:04:49.535899Z"},"content_sha256":"36676add7823e9220300ff6781424150c9ba9458b5932091a7aba46c35f52d65","schema_version":"1.0","event_id":"sha256:36676add7823e9220300ff6781424150c9ba9458b5932091a7aba46c35f52d65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R34N3QCD2DKM2QPONSKJMU26CN/bundle.json","state_url":"https://pith.science/pith/R34N3QCD2DKM2QPONSKJMU26CN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R34N3QCD2DKM2QPONSKJMU26CN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T13:04:49Z","links":{"resolver":"https://pith.science/pith/R34N3QCD2DKM2QPONSKJMU26CN","bundle":"https://pith.science/pith/R34N3QCD2DKM2QPONSKJMU26CN/bundle.json","state":"https://pith.science/pith/R34N3QCD2DKM2QPONSKJMU26CN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R34N3QCD2DKM2QPONSKJMU26CN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:R34N3QCD2DKM2QPONSKJMU26CN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"15575db17d355926be9bc4a570a9de5c02c9299545c99a07b98471af8b03c4be","cross_cats_sorted":["stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-17T01:14:24Z","title_canon_sha256":"508a36b9c8d0ceca124b68816dcf6c5559bf2c3ab830a73138dacf24a04b016d"},"schema_version":"1.0","source":{"id":"2311.10263","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10263","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10263v2","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10263","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"pith_short_12","alias_value":"R34N3QCD2DKM","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"pith_short_16","alias_value":"R34N3QCD2DKM2QPO","created_at":"2026-07-05T08:37:15Z"},{"alias_kind":"pith_short_8","alias_value":"R34N3QCD","created_at":"2026-07-05T08:37:15Z"}],"graph_snapshots":[{"event_id":"sha256:36676add7823e9220300ff6781424150c9ba9458b5932091a7aba46c35f52d65","target":"graph","created_at":"2026-07-05T08:37:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.10263/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inferring causal relationships as directed acyclic graphs (DAGs) is an important but challenging problem. Differentiable Causal Discovery (DCD) is a promising approach to this problem, framing the search as a continuous optimization. But existing DCD methods are numerically unstable, with poor performance beyond tens of variables. In this paper, we propose Stable Differentiable Causal Discovery (SDCD), a new method that improves previous DCD methods in two ways: (1) It employs an alternative constraint for acyclicity; this constraint is more stable, both theoretically and empirically, and fast","authors_text":"Achille Nazaret, David Blei, Elham Azizi, Justin Hong","cross_cats":["stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-17T01:14:24Z","title":"Stable Differentiable Causal Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10263","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:71b4d77babe8f1963c0d272c6848c71164e1127982c341024e8e6f9f7502edb8","target":"record","created_at":"2026-07-05T08:37:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"15575db17d355926be9bc4a570a9de5c02c9299545c99a07b98471af8b03c4be","cross_cats_sorted":["stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-17T01:14:24Z","title_canon_sha256":"508a36b9c8d0ceca124b68816dcf6c5559bf2c3ab830a73138dacf24a04b016d"},"schema_version":"1.0","source":{"id":"2311.10263","kind":"arxiv","version":2}},"canonical_sha256":"8ef8ddc043d0d4cd41ee6c9496535e13718ccd6ceb4a7d6ab4226a3d19703828","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef8ddc043d0d4cd41ee6c9496535e13718ccd6ceb4a7d6ab4226a3d19703828","first_computed_at":"2026-07-05T08:37:15.496876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:15.496876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYyBSVh3gwSHswcYo5NgukcSjO78N7diNFl+4zHBfTMpSAs3Y5wKOK/Egzreg3GiBh8jAG/5Ltls2lqM2/QHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:15.497374Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.10263","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71b4d77babe8f1963c0d272c6848c71164e1127982c341024e8e6f9f7502edb8","sha256:36676add7823e9220300ff6781424150c9ba9458b5932091a7aba46c35f52d65"],"state_sha256":"3f0ac621da88dcc126b8d557d818df45f2e9816f182ba3f06acc16ccb9f1fb97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIdm2hbR1wRuPareCw/fYomeNNiO6NemtTt/GoFa8ERrdxQbaVfNQK4sPLFHq3/9ZUmkXnb0z7ApoiNEm1YGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T13:04:49.545573Z","bundle_sha256":"7ae825ea0cddfd7fc27fcdf88475e2600b9066d29eb6665f94a64a857598adf1"}}