{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TIMN6WSICEONDFIV3PMCORSXYW","short_pith_number":"pith:TIMN6WSI","schema_version":"1.0","canonical_sha256":"9a18df5a48111cd19515dbd8274657c58c087a10e313c6f95acc129675dde30a","source":{"kind":"arxiv","id":"1904.10098","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.10098","created_at":"2026-05-17T23:47:55.129982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10098v1","created_at":"2026-05-17T23:47:55.129982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10098","created_at":"2026-05-17T23:47:55.129982+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIMN6WSICEON","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIMN6WSICEONDFIV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIMN6WSI","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27379","citing_title":"Proactive Dialogue Model with Intent Prediction","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW","json":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW.json","graph_json":"https://pith.science/api/pith-number/TIMN6WSICEONDFIV3PMCORSXYW/graph.json","events_json":"https://pith.science/api/pith-number/TIMN6WSICEONDFIV3PMCORSXYW/events.json","paper":"https://pith.science/paper/TIMN6WSI"},"agent_actions":{"view_html":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW","download_json":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW.json","view_paper":"https://pith.science/paper/TIMN6WSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10098&json=true","fetch_graph":"https://pith.science/api/pith-number/TIMN6WSICEONDFIV3PMCORSXYW/graph.json","fetch_events":"https://pith.science/api/pith-number/TIMN6WSICEONDFIV3PMCORSXYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/action/storage_attestation","attest_author":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/action/author_attestation","sign_citation":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/action/citation_signature","submit_replication":"https://pith.science/pith/TIMN6WSICEONDFIV3PMCORSXYW/action/replication_record"}},"created_at":"2026-05-17T23:47:55.129982+00:00","updated_at":"2026-05-17T23:47:55.129982+00:00"}