{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZWZFKIPZLOEGKCAKXGQW7HFWJ4","short_pith_number":"pith:ZWZFKIPZ","schema_version":"1.0","canonical_sha256":"cdb25521f95b8865080ab9a16f9cb64f3baac95bb4164140c47a5ae48bf3127e","source":{"kind":"arxiv","id":"2308.07480","version":2},"attestation_state":"computed","paper":{"title":"Order-based Structure Learning with Normalizing Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Hamidreza Kamkari, Rahul G. Krishnan, Vahid Balazadeh, Vahid Zehtab","submitted_at":"2023-08-14T22:17:33Z","abstract_excerpt":"Estimating the causal structure of observational data is a challenging combinatorial search problem that scales super-exponentially with graph size. Existing methods use continuous relaxations to make this problem computationally tractable but often restrict the data-generating process to additive noise models (ANMs) through explicit or implicit assumptions. We present Order-based Structure Learning with Normalizing Flows (OSLow), a framework that relaxes these assumptions using autoregressive normalizing flows. We leverage the insight that searching over topological orderings is a natural way"},"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":"2308.07480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-14T22:17:33Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"fda157a1f0886c9ed0a70bb68d0bfeca001d0d725e1639c7d5c6fd06414f36f4","abstract_canon_sha256":"280f90dc713d2bae0bcdc22b1097d7156bc5878549b1f948aa0832a521245c19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:21.928275Z","signature_b64":"xtCgPrzTEhK6g9mwb/xA9Du+SeA4/M9Qpv50nb0Vc5YVVouxLfAQEbMOsGDe23tJL8qNaIVmvcQq3L/vIy0SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb25521f95b8865080ab9a16f9cb64f3baac95bb4164140c47a5ae48bf3127e","last_reissued_at":"2026-07-05T07:46:21.927839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:21.927839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order-based Structure Learning with Normalizing Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Hamidreza Kamkari, Rahul G. Krishnan, Vahid Balazadeh, Vahid Zehtab","submitted_at":"2023-08-14T22:17:33Z","abstract_excerpt":"Estimating the causal structure of observational data is a challenging combinatorial search problem that scales super-exponentially with graph size. Existing methods use continuous relaxations to make this problem computationally tractable but often restrict the data-generating process to additive noise models (ANMs) through explicit or implicit assumptions. We present Order-based Structure Learning with Normalizing Flows (OSLow), a framework that relaxes these assumptions using autoregressive normalizing flows. We leverage the insight that searching over topological orderings is a natural way"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07480","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/2308.07480/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":"2308.07480","created_at":"2026-07-05T07:46:21.927893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07480v2","created_at":"2026-07-05T07:46:21.927893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07480","created_at":"2026-07-05T07:46:21.927893+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWZFKIPZLOEG","created_at":"2026-07-05T07:46:21.927893+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWZFKIPZLOEGKCAK","created_at":"2026-07-05T07:46:21.927893+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWZFKIPZ","created_at":"2026-07-05T07:46:21.927893+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09870","citing_title":"Intervention-Based Time Series Causal Discovery via Simulator-Generated Interventional Distributions","ref_index":186,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4","json":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4.json","graph_json":"https://pith.science/api/pith-number/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/graph.json","events_json":"https://pith.science/api/pith-number/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/events.json","paper":"https://pith.science/paper/ZWZFKIPZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4","download_json":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4.json","view_paper":"https://pith.science/paper/ZWZFKIPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07480&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/action/storage_attestation","attest_author":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/action/author_attestation","sign_citation":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/action/citation_signature","submit_replication":"https://pith.science/pith/ZWZFKIPZLOEGKCAKXGQW7HFWJ4/action/replication_record"}},"created_at":"2026-07-05T07:46:21.927893+00:00","updated_at":"2026-07-05T07:46:21.927893+00:00"}