{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C2NPTRQ73NGBKCWLVGPVFPZOTY","short_pith_number":"pith:C2NPTRQ7","schema_version":"1.0","canonical_sha256":"169af9c61fdb4c150acba99f52bf2e9e330d9c8355772baaf40b7980703e66c2","source":{"kind":"arxiv","id":"1906.02226","version":2},"attestation_state":"computed","paper":{"title":"Gradient-Based Neural DAG Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Philippe Brouillard, S\\'ebastien Lachapelle, Simon Lacoste-Julien, Tristan Deleu","submitted_at":"2019-06-05T18:09:55Z","abstract_excerpt":"We propose a novel score-based approach to learning a directed acyclic graph (DAG) from observational data. We adapt a recently proposed continuous constrained optimization formulation to allow for nonlinear relationships between variables using neural networks. This extension allows to model complex interactions while avoiding the combinatorial nature of the problem. In addition to comparing our method to existing continuous optimization methods, we provide missing empirical comparisons to nonlinear greedy search methods. On both synthetic and real-world data sets, this new method outperforms"},"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":"1906.02226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T18:09:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bd7008ca0e6207709267fc2c77298f0dfa0b27ce0261fecd77b77007a9187cc9","abstract_canon_sha256":"989bee540cfe781e18ed6feac2885293173fc367c0b3aa02098bca38b7d42368"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:29.688770Z","signature_b64":"4OaNSXXZDifhUTSyPpTvMk6Xee0uAobslW8MPb+x7YUKrzJ1kGYf8jEWqjKIRkWhmckaeLIIwuCaq++HdA3DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"169af9c61fdb4c150acba99f52bf2e9e330d9c8355772baaf40b7980703e66c2","last_reissued_at":"2026-07-05T00:41:29.688268Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:29.688268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-Based Neural DAG Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Philippe Brouillard, S\\'ebastien Lachapelle, Simon Lacoste-Julien, Tristan Deleu","submitted_at":"2019-06-05T18:09:55Z","abstract_excerpt":"We propose a novel score-based approach to learning a directed acyclic graph (DAG) from observational data. We adapt a recently proposed continuous constrained optimization formulation to allow for nonlinear relationships between variables using neural networks. This extension allows to model complex interactions while avoiding the combinatorial nature of the problem. In addition to comparing our method to existing continuous optimization methods, we provide missing empirical comparisons to nonlinear greedy search methods. On both synthetic and real-world data sets, this new method outperforms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02226","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/1906.02226/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":"1906.02226","created_at":"2026-07-05T00:41:29.688326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02226v2","created_at":"2026-07-05T00:41:29.688326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02226","created_at":"2026-07-05T00:41:29.688326+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2NPTRQ73NGB","created_at":"2026-07-05T00:41:29.688326+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2NPTRQ73NGBKCWL","created_at":"2026-07-05T00:41:29.688326+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2NPTRQ7","created_at":"2026-07-05T00:41:29.688326+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21212","citing_title":"DCD-PFN: A Decoupling-Aware Foundation Model for Causal Discovery","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06908","citing_title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05942","citing_title":"EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learning","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03251","citing_title":"Do Real-World Datasets Contain Natural Experiments? An Empirical Study Using Causal Feature Selection","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2412.07469","citing_title":"Score-matching-based Structure Learning for Temporal Data on Networks","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2502.16156","citing_title":"A Review of Causal Decision Making","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18633","citing_title":"Stable Causal Discovery via Directed Acyclic Graph Aggregation","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11170","citing_title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","ref_index":143,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01134","citing_title":"To Use AI as Dice of Possibilities with Timing Computation","ref_index":95,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03045","citing_title":"TCD-Arena: Assessing Robustness of Time Series Causal Discovery Methods Against Assumption Violations","ref_index":282,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY","json":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY.json","graph_json":"https://pith.science/api/pith-number/C2NPTRQ73NGBKCWLVGPVFPZOTY/graph.json","events_json":"https://pith.science/api/pith-number/C2NPTRQ73NGBKCWLVGPVFPZOTY/events.json","paper":"https://pith.science/paper/C2NPTRQ7"},"agent_actions":{"view_html":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY","download_json":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY.json","view_paper":"https://pith.science/paper/C2NPTRQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02226&json=true","fetch_graph":"https://pith.science/api/pith-number/C2NPTRQ73NGBKCWLVGPVFPZOTY/graph.json","fetch_events":"https://pith.science/api/pith-number/C2NPTRQ73NGBKCWLVGPVFPZOTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY/action/storage_attestation","attest_author":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY/action/author_attestation","sign_citation":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY/action/citation_signature","submit_replication":"https://pith.science/pith/C2NPTRQ73NGBKCWLVGPVFPZOTY/action/replication_record"}},"created_at":"2026-07-05T00:41:29.688326+00:00","updated_at":"2026-07-05T00:41:29.688326+00:00"}