{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y4Y67QNXPGCHYEPOSFAQ63HRSZ","short_pith_number":"pith:Y4Y67QNX","schema_version":"1.0","canonical_sha256":"c731efc1b779847c11ee91410f6cf1965fe3bf8c3911ed058a16b5739be236e1","source":{"kind":"arxiv","id":"2011.02764","version":1},"attestation_state":"computed","paper":{"title":"A Bregman Method for Structure Learning on Sparse Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandre d'Aspremont, Manon Romain","submitted_at":"2020-11-05T11:37:44Z","abstract_excerpt":"We develop a Bregman proximal gradient method for structure learning on linear structural causal models. While the problem is non-convex, has high curvature and is in fact NP-hard, Bregman gradient methods allow us to neutralize at least part of the impact of curvature by measuring smoothness against a highly nonlinear kernel. This allows the method to make longer steps and significantly improves convergence. Each iteration requires solving a Bregman proximal step which is convex and efficiently solvable for our particular choice of kernel. We test our method on various synthetic and real data"},"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":"2011.02764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-11-05T11:37:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a460e0e887288ebb16e7d7fc20956b23fd326f1de2d6cda7952994d5cf2ff51f","abstract_canon_sha256":"b426a14e60dc830a596ed88556d9e3b37969600d02d98bdca0315e4faa7f9f91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:25.080357Z","signature_b64":"JScT9uKPQcMpyhtzk54n8R253HVKcyi1NvoJ1cJXuqf9zITwD3qvdx8jro8GSpK/JoJ5SAlGlWSlCoxOY343BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c731efc1b779847c11ee91410f6cf1965fe3bf8c3911ed058a16b5739be236e1","last_reissued_at":"2026-07-05T01:49:25.079953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:25.079953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bregman Method for Structure Learning on Sparse Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandre d'Aspremont, Manon Romain","submitted_at":"2020-11-05T11:37:44Z","abstract_excerpt":"We develop a Bregman proximal gradient method for structure learning on linear structural causal models. While the problem is non-convex, has high curvature and is in fact NP-hard, Bregman gradient methods allow us to neutralize at least part of the impact of curvature by measuring smoothness against a highly nonlinear kernel. This allows the method to make longer steps and significantly improves convergence. Each iteration requires solving a Bregman proximal step which is convex and efficiently solvable for our particular choice of kernel. We test our method on various synthetic and real data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.02764","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/2011.02764/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":"2011.02764","created_at":"2026-07-05T01:49:25.080017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.02764v1","created_at":"2026-07-05T01:49:25.080017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.02764","created_at":"2026-07-05T01:49:25.080017+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4Y67QNXPGCH","created_at":"2026-07-05T01:49:25.080017+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4Y67QNXPGCHYEPO","created_at":"2026-07-05T01:49:25.080017+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4Y67QNX","created_at":"2026-07-05T01:49:25.080017+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/Y4Y67QNXPGCHYEPOSFAQ63HRSZ","json":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ.json","graph_json":"https://pith.science/api/pith-number/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/graph.json","events_json":"https://pith.science/api/pith-number/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/events.json","paper":"https://pith.science/paper/Y4Y67QNX"},"agent_actions":{"view_html":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ","download_json":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ.json","view_paper":"https://pith.science/paper/Y4Y67QNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.02764&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/action/storage_attestation","attest_author":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/action/author_attestation","sign_citation":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/action/citation_signature","submit_replication":"https://pith.science/pith/Y4Y67QNXPGCHYEPOSFAQ63HRSZ/action/replication_record"}},"created_at":"2026-07-05T01:49:25.080017+00:00","updated_at":"2026-07-05T01:49:25.080017+00:00"}