{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4MARWLW3FQ7KUFXU4VTOK23T7T","short_pith_number":"pith:4MARWLW3","schema_version":"1.0","canonical_sha256":"e3011b2edb2c3eaa16f4e566e56b73fcfa442ffce91f4044b27965a215d571ae","source":{"kind":"arxiv","id":"2405.11416","version":2},"attestation_state":"computed","paper":{"title":"Discrete-state Continuous-time Diffusion for Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hanghang Tong, Huiyuan Chen, Mahashweta Das, Menghai Pan, Ruizhong Qiu, Xiran Fan, Yuzhong Chen, Zhe Xu, Zhichen Zeng","submitted_at":"2024-05-19T00:09:42Z","abstract_excerpt":"Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks. Overall, according to the space of states and time steps, diffusion generative models can be categorized into discrete-/continuous-state discrete-/continuous-time fashions. In this paper, we formulate the graph diffusion generation in a discrete-state continuous-time setting, which has never been studied in previous graph diffusion models. The rationale of such a f"},"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":"2405.11416","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T00:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"cbb74d2a3b7564c879f3e26dbc7348c58f1fd1dbcaf25b33a6f44dccb5c39d0f","abstract_canon_sha256":"cadf4323742ad98ab110724c01575554a51d5d8431d0c1d9c68426484f5670f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:14.209377Z","signature_b64":"aPoTf6hl+/PgXMWIZ2XktKKu6fhSAPLlILQi4YXKxaj++s0GjxzNjstxP5RGOyocKqQhjWO0qbjGaVYTni8gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3011b2edb2c3eaa16f4e566e56b73fcfa442ffce91f4044b27965a215d571ae","last_reissued_at":"2026-07-05T09:30:14.208897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:14.208897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete-state Continuous-time Diffusion for Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hanghang Tong, Huiyuan Chen, Mahashweta Das, Menghai Pan, Ruizhong Qiu, Xiran Fan, Yuzhong Chen, Zhe Xu, Zhichen Zeng","submitted_at":"2024-05-19T00:09:42Z","abstract_excerpt":"Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks. Overall, according to the space of states and time steps, diffusion generative models can be categorized into discrete-/continuous-state discrete-/continuous-time fashions. In this paper, we formulate the graph diffusion generation in a discrete-state continuous-time setting, which has never been studied in previous graph diffusion models. The rationale of such a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11416","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/2405.11416/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":"2405.11416","created_at":"2026-07-05T09:30:14.208955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11416v2","created_at":"2026-07-05T09:30:14.208955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11416","created_at":"2026-07-05T09:30:14.208955+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MARWLW3FQ7K","created_at":"2026-07-05T09:30:14.208955+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MARWLW3FQ7KUFXU","created_at":"2026-07-05T09:30:14.208955+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MARWLW3","created_at":"2026-07-05T09:30:14.208955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.07799","citing_title":"Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2511.03015","citing_title":"Discrete Bayesian Sample Inference for Graph Generation","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T","json":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T.json","graph_json":"https://pith.science/api/pith-number/4MARWLW3FQ7KUFXU4VTOK23T7T/graph.json","events_json":"https://pith.science/api/pith-number/4MARWLW3FQ7KUFXU4VTOK23T7T/events.json","paper":"https://pith.science/paper/4MARWLW3"},"agent_actions":{"view_html":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T","download_json":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T.json","view_paper":"https://pith.science/paper/4MARWLW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11416&json=true","fetch_graph":"https://pith.science/api/pith-number/4MARWLW3FQ7KUFXU4VTOK23T7T/graph.json","fetch_events":"https://pith.science/api/pith-number/4MARWLW3FQ7KUFXU4VTOK23T7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T/action/storage_attestation","attest_author":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T/action/author_attestation","sign_citation":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T/action/citation_signature","submit_replication":"https://pith.science/pith/4MARWLW3FQ7KUFXU4VTOK23T7T/action/replication_record"}},"created_at":"2026-07-05T09:30:14.208955+00:00","updated_at":"2026-07-05T09:30:14.208955+00:00"}