{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ARWI46FAT7DWGPIH5MPPWNJJNH","short_pith_number":"pith:ARWI46FA","schema_version":"1.0","canonical_sha256":"046c8e78a09fc7633d07eb1efb352969c76e6d941545d3e76659940ee82d7930","source":{"kind":"arxiv","id":"2107.10483","version":3},"attestation_state":"computed","paper":{"title":"Efficient Neural Causal Discovery without Acyclicity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Efstratios Gavves, Phillip Lippe, Taco Cohen","submitted_at":"2021-07-22T07:01:41Z","abstract_excerpt":"Learning the structure of a causal graphical model using both observational and interventional data is a fundamental problem in many scientific fields. A promising direction is continuous optimization for score-based methods, which, however, require constrained optimization to enforce acyclicity or lack convergence guarantees. In this paper, we present ENCO, an efficient structure learning method for directed, acyclic causal graphs leveraging observational and interventional data. ENCO formulates the graph search as an optimization of independent edge likelihoods, with the edge orientation bei"},"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":"2107.10483","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-22T07:01:41Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"890cdd060caf78cc7ba5401ceb514446d485baefce5844183d4c4156d2efbb9f","abstract_canon_sha256":"4a047478ea7521a853dde84d4485f4616e1f3e969d1025e228f3644b5b8949d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:02.421407Z","signature_b64":"Q/ojNQAzEJqRlhAMbXfizwTvzbk/d/Pp276X4d+AL109ZnwA0akX+8wMyNNC0y068BWpp8+O11PBJLbpA8M1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046c8e78a09fc7633d07eb1efb352969c76e6d941545d3e76659940ee82d7930","last_reissued_at":"2026-07-05T04:00:02.420953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:02.420953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Neural Causal Discovery without Acyclicity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Efstratios Gavves, Phillip Lippe, Taco Cohen","submitted_at":"2021-07-22T07:01:41Z","abstract_excerpt":"Learning the structure of a causal graphical model using both observational and interventional data is a fundamental problem in many scientific fields. A promising direction is continuous optimization for score-based methods, which, however, require constrained optimization to enforce acyclicity or lack convergence guarantees. In this paper, we present ENCO, an efficient structure learning method for directed, acyclic causal graphs leveraging observational and interventional data. ENCO formulates the graph search as an optimization of independent edge likelihoods, with the edge orientation bei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.10483","kind":"arxiv","version":3},"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/2107.10483/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":"2107.10483","created_at":"2026-07-05T04:00:02.421013+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.10483v3","created_at":"2026-07-05T04:00:02.421013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.10483","created_at":"2026-07-05T04:00:02.421013+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARWI46FAT7DW","created_at":"2026-07-05T04:00:02.421013+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARWI46FAT7DWGPIH","created_at":"2026-07-05T04:00:02.421013+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARWI46FA","created_at":"2026-07-05T04:00:02.421013+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21385","citing_title":"Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability","ref_index":32,"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":45,"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":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH","json":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH.json","graph_json":"https://pith.science/api/pith-number/ARWI46FAT7DWGPIH5MPPWNJJNH/graph.json","events_json":"https://pith.science/api/pith-number/ARWI46FAT7DWGPIH5MPPWNJJNH/events.json","paper":"https://pith.science/paper/ARWI46FA"},"agent_actions":{"view_html":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH","download_json":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH.json","view_paper":"https://pith.science/paper/ARWI46FA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.10483&json=true","fetch_graph":"https://pith.science/api/pith-number/ARWI46FAT7DWGPIH5MPPWNJJNH/graph.json","fetch_events":"https://pith.science/api/pith-number/ARWI46FAT7DWGPIH5MPPWNJJNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH/action/storage_attestation","attest_author":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH/action/author_attestation","sign_citation":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH/action/citation_signature","submit_replication":"https://pith.science/pith/ARWI46FAT7DWGPIH5MPPWNJJNH/action/replication_record"}},"created_at":"2026-07-05T04:00:02.421013+00:00","updated_at":"2026-07-05T04:00:02.421013+00:00"}