{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IMKOKYFWG2MLAHC562HL32OTMF","short_pith_number":"pith:IMKOKYFW","schema_version":"1.0","canonical_sha256":"4314e560b63698b01c5df68ebde9d36152e16e0578160dffde1643d27a9cbfe0","source":{"kind":"arxiv","id":"2402.03687","version":3},"attestation_state":"computed","paper":{"title":"Pard: Permutation-Invariant Autoregressive Diffusion for Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Leman Akoglu, Lingxiao Zhao, Xueying Ding","submitted_at":"2024-02-06T04:17:44Z","abstract_excerpt":"Graph generation has been dominated by autoregressive models due to their simplicity and effectiveness, despite their sensitivity to ordering. Yet diffusion models have garnered increasing attention, as they offer comparable performance while being permutation-invariant. Current graph diffusion models generate graphs in a one-shot fashion, but they require extra features and thousands of denoising steps to achieve optimal performance. We introduce PARD, a Permutation-invariant Auto Regressive Diffusion model that integrates diffusion models with autoregressive methods. PARD harnesses the effec"},"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":"2402.03687","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-06T04:17:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"43c61be6084fe6b765a9fc040aab1e2452ddec137e3847384fe87a605c6bef36","abstract_canon_sha256":"6f30782e4a2f0a28f2acfa0621429fc05b53fd31a1d538b3fe349c71681ef6b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:24.980191Z","signature_b64":"GvtYO7n6TjIhRHShvaj07cYodPoHFSAilw4cb5V/cc2/JXqlIPgWq9+/7xuU+KsBgq59NJoOdcBdp0kdnyKfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4314e560b63698b01c5df68ebde9d36152e16e0578160dffde1643d27a9cbfe0","last_reissued_at":"2026-07-05T09:43:24.979651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:24.979651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pard: Permutation-Invariant Autoregressive Diffusion for Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Leman Akoglu, Lingxiao Zhao, Xueying Ding","submitted_at":"2024-02-06T04:17:44Z","abstract_excerpt":"Graph generation has been dominated by autoregressive models due to their simplicity and effectiveness, despite their sensitivity to ordering. Yet diffusion models have garnered increasing attention, as they offer comparable performance while being permutation-invariant. Current graph diffusion models generate graphs in a one-shot fashion, but they require extra features and thousands of denoising steps to achieve optimal performance. We introduce PARD, a Permutation-invariant Auto Regressive Diffusion model that integrates diffusion models with autoregressive methods. PARD harnesses the effec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03687","kind":"arxiv","version":3},"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/2402.03687/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":"2402.03687","created_at":"2026-07-05T09:43:24.979715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.03687v3","created_at":"2026-07-05T09:43:24.979715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03687","created_at":"2026-07-05T09:43:24.979715+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMKOKYFWG2ML","created_at":"2026-07-05T09:43:24.979715+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMKOKYFWG2MLAHC5","created_at":"2026-07-05T09:43:24.979715+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMKOKYFW","created_at":"2026-07-05T09:43:24.979715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF","json":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF.json","graph_json":"https://pith.science/api/pith-number/IMKOKYFWG2MLAHC562HL32OTMF/graph.json","events_json":"https://pith.science/api/pith-number/IMKOKYFWG2MLAHC562HL32OTMF/events.json","paper":"https://pith.science/paper/IMKOKYFW"},"agent_actions":{"view_html":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF","download_json":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF.json","view_paper":"https://pith.science/paper/IMKOKYFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.03687&json=true","fetch_graph":"https://pith.science/api/pith-number/IMKOKYFWG2MLAHC562HL32OTMF/graph.json","fetch_events":"https://pith.science/api/pith-number/IMKOKYFWG2MLAHC562HL32OTMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF/action/storage_attestation","attest_author":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF/action/author_attestation","sign_citation":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF/action/citation_signature","submit_replication":"https://pith.science/pith/IMKOKYFWG2MLAHC562HL32OTMF/action/replication_record"}},"created_at":"2026-07-05T09:43:24.979715+00:00","updated_at":"2026-07-05T09:43:24.979715+00:00"}