{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TIMN6WSICEONDFIV3PMCORSXYW","short_pith_number":"pith:TIMN6WSI","canonical_record":{"source":{"id":"1904.10098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T23:58:49Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"dedc265e0ba819dc3c401d8174bae82c8ecb4f8319be2af7a2ca94a02797ffe9","abstract_canon_sha256":"9057a75aff74e306dbd1a65e77863d8d98b54046692f9247ace11a543dcd35ea"},"schema_version":"1.0"},"canonical_sha256":"9a18df5a48111cd19515dbd8274657c58c087a10e313c6f95acc129675dde30a","source":{"kind":"arxiv","id":"1904.10098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10098","created_at":"2026-05-17T23:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10098v1","created_at":"2026-05-17T23:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10098","created_at":"2026-05-17T23:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"TIMN6WSICEON","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TIMN6WSICEONDFIV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TIMN6WSI","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TIMN6WSICEONDFIV3PMCORSXYW","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T23:58:49Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"dedc265e0ba819dc3c401d8174bae82c8ecb4f8319be2af7a2ca94a02797ffe9","abstract_canon_sha256":"9057a75aff74e306dbd1a65e77863d8d98b54046692f9247ace11a543dcd35ea"},"schema_version":"1.0"},"canonical_sha256":"9a18df5a48111cd19515dbd8274657c58c087a10e313c6f95acc129675dde30a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:55.130513Z","signature_b64":"U0zghSTWnt83LcWorMTa0NreQKg68sPEg6cuxQkXzxxIs6ykPsf3KV3pGjUALk/0LOjkxhjkwk7Uwj5LSLT4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a18df5a48111cd19515dbd8274657c58c087a10e313c6f95acc129675dde30a","last_reissued_at":"2026-05-17T23:47:55.129891Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:55.129891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10098","source_version":1,"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-05-17T23:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMIiqLhSOzUD38o9oF/ZkvSM/oPUH9CzsbfQDB1PcVoVkAV4ksWGMyPgulaoLJIkJsQksa58xcfsPxhd10tMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:46:08.513367Z"},"content_sha256":"20a807e9b291ea18b2944122db3db47b1fb78e1cd14ad19577f9ea480a6f4321","schema_version":"1.0","event_id":"sha256:20a807e9b291ea18b2944122db3db47b1fb78e1cd14ad19577f9ea480a6f4321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TIMN6WSICEONDFIV3PMCORSXYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DAG-GNN: DAG Structure Learning with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jie Chen, Mo Yu, Tian Gao, Yue Yu","submitted_at":"2019-04-22T23:58:49Z","abstract_excerpt":"Learning a faithful directed acyclic graph (DAG) from samples of a joint distribution is a challenging combinatorial problem, owing to the intractable search space superexponential in the number of graph nodes. A recent breakthrough formulates the problem as a continuous optimization with a structural constraint that ensures acyclicity (Zheng et al., 2018). The authors apply the approach to the linear structural equation model (SEM) and the least-squares loss function that are statistically well justified but nevertheless limited. Motivated by the widespread success of deep learning that is ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10098","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":""},"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-05-17T23:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRd1J5U8u7pUFcT5w08u4dtRdzPkAfmEY3nJq2HwBSWQfKO0bFBULv8Lmb/nE/Nel3DPGa4+y9jFx7WJvspMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:46:08.513967Z"},"content_sha256":"677d90bc47319cb8f697422cd59f1cc74f7ff3e903d39ac41a3bdba1289e0021","schema_version":"1.0","event_id":"sha256:677d90bc47319cb8f697422cd59f1cc74f7ff3e903d39ac41a3bdba1289e0021"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/bundle.json","state_url":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIMN6WSICEONDFIV3PMCORSXYW/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-05-19T02:46:08Z","links":{"resolver":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW","bundle":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/bundle.json","state":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIMN6WSICEONDFIV3PMCORSXYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TIMN6WSICEONDFIV3PMCORSXYW","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":"9057a75aff74e306dbd1a65e77863d8d98b54046692f9247ace11a543dcd35ea","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T23:58:49Z","title_canon_sha256":"dedc265e0ba819dc3c401d8174bae82c8ecb4f8319be2af7a2ca94a02797ffe9"},"schema_version":"1.0","source":{"id":"1904.10098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10098","created_at":"2026-05-17T23:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10098v1","created_at":"2026-05-17T23:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10098","created_at":"2026-05-17T23:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"TIMN6WSICEON","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TIMN6WSICEONDFIV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TIMN6WSI","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:677d90bc47319cb8f697422cd59f1cc74f7ff3e903d39ac41a3bdba1289e0021","target":"graph","created_at":"2026-05-17T23:47:55Z","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"},"paper":{"abstract_excerpt":"Learning a faithful directed acyclic graph (DAG) from samples of a joint distribution is a challenging combinatorial problem, owing to the intractable search space superexponential in the number of graph nodes. A recent breakthrough formulates the problem as a continuous optimization with a structural constraint that ensures acyclicity (Zheng et al., 2018). The authors apply the approach to the linear structural equation model (SEM) and the least-squares loss function that are statistically well justified but nevertheless limited. Motivated by the widespread success of deep learning that is ca","authors_text":"Jie Chen, Mo Yu, Tian Gao, Yue Yu","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T23:58:49Z","title":"DAG-GNN: DAG Structure Learning with Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10098","kind":"arxiv","version":1},"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:20a807e9b291ea18b2944122db3db47b1fb78e1cd14ad19577f9ea480a6f4321","target":"record","created_at":"2026-05-17T23:47:55Z","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":"9057a75aff74e306dbd1a65e77863d8d98b54046692f9247ace11a543dcd35ea","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T23:58:49Z","title_canon_sha256":"dedc265e0ba819dc3c401d8174bae82c8ecb4f8319be2af7a2ca94a02797ffe9"},"schema_version":"1.0","source":{"id":"1904.10098","kind":"arxiv","version":1}},"canonical_sha256":"9a18df5a48111cd19515dbd8274657c58c087a10e313c6f95acc129675dde30a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a18df5a48111cd19515dbd8274657c58c087a10e313c6f95acc129675dde30a","first_computed_at":"2026-05-17T23:47:55.129891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:55.129891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U0zghSTWnt83LcWorMTa0NreQKg68sPEg6cuxQkXzxxIs6ykPsf3KV3pGjUALk/0LOjkxhjkwk7Uwj5LSLT4AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:55.130513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20a807e9b291ea18b2944122db3db47b1fb78e1cd14ad19577f9ea480a6f4321","sha256:677d90bc47319cb8f697422cd59f1cc74f7ff3e903d39ac41a3bdba1289e0021"],"state_sha256":"1af700c52e663122ffd449754e8e3eda65099d25fdc7ed2ae512bdbd5938c583"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1dho231LcTpF4/Ibep70dM2t45SWnUwnL+hKZfeuYOxEfC3ig1daWIM1Pt1DYcaZn8+yaKirFnq7ldXVSPBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T02:46:08.515990Z","bundle_sha256":"f71e5da823a3ee005dae258d2172f1809a986dc5e984cbf45f2842bfe329f5a9"}}