{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BM3AUAW5MNWLMVNS6V5QDUAX5T","short_pith_number":"pith:BM3AUAW5","schema_version":"1.0","canonical_sha256":"0b360a02dd636cb655b2f57b01d017ecdcd74c7dcd074cd1576ecaa26a62589f","source":{"kind":"arxiv","id":"2506.13099","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Graph Condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dong Chen, Kunlun He, Muhao Xu, Shuai Zheng, Yao Zhao, Yeyu Yan, Zhenfeng Zhu","submitted_at":"2025-06-16T05:11:29Z","abstract_excerpt":"Recent research on deep graph learning has shifted from static to dynamic graphs, motivated by the evolving behaviors observed in complex real-world systems. However, the temporal extension in dynamic graphs poses significant data efficiency challenges, including increased data volume, high spatiotemporal redundancy, and reliance on costly dynamic graph neural networks (DGNNs). To alleviate the concerns, we pioneer the study of dynamic graph condensation (DGC), which aims to substantially reduce the scale of dynamic graphs for data-efficient DGNN training. Accordingly, we propose DyGC, a novel"},"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":"2506.13099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T05:11:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cde79ad7512d42ccf809a9a4143aef7da19e7fcfb9e60b8f6ebc5f8b1fc0d62b","abstract_canon_sha256":"c003ea78ee8c66a0cb69b51af1534254f0ab42260c53f769e163c1f95c39c999"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:05.138233Z","signature_b64":"Sn89qYY1pSFY+MMsVICaOY/3MRcStdF+hueOzChumMsphcLERkABRZ8R5GqzrcrPvXsm8zQRCsR39TFGrryBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b360a02dd636cb655b2f57b01d017ecdcd74c7dcd074cd1576ecaa26a62589f","last_reissued_at":"2026-07-05T11:22:05.137786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:05.137786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Graph Condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dong Chen, Kunlun He, Muhao Xu, Shuai Zheng, Yao Zhao, Yeyu Yan, Zhenfeng Zhu","submitted_at":"2025-06-16T05:11:29Z","abstract_excerpt":"Recent research on deep graph learning has shifted from static to dynamic graphs, motivated by the evolving behaviors observed in complex real-world systems. However, the temporal extension in dynamic graphs poses significant data efficiency challenges, including increased data volume, high spatiotemporal redundancy, and reliance on costly dynamic graph neural networks (DGNNs). To alleviate the concerns, we pioneer the study of dynamic graph condensation (DGC), which aims to substantially reduce the scale of dynamic graphs for data-efficient DGNN training. Accordingly, we propose DyGC, a novel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13099","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.13099/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":"2506.13099","created_at":"2026-07-05T11:22:05.137842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13099v1","created_at":"2026-07-05T11:22:05.137842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13099","created_at":"2026-07-05T11:22:05.137842+00:00"},{"alias_kind":"pith_short_12","alias_value":"BM3AUAW5MNWL","created_at":"2026-07-05T11:22:05.137842+00:00"},{"alias_kind":"pith_short_16","alias_value":"BM3AUAW5MNWLMVNS","created_at":"2026-07-05T11:22:05.137842+00:00"},{"alias_kind":"pith_short_8","alias_value":"BM3AUAW5","created_at":"2026-07-05T11:22:05.137842+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T","json":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T.json","graph_json":"https://pith.science/api/pith-number/BM3AUAW5MNWLMVNS6V5QDUAX5T/graph.json","events_json":"https://pith.science/api/pith-number/BM3AUAW5MNWLMVNS6V5QDUAX5T/events.json","paper":"https://pith.science/paper/BM3AUAW5"},"agent_actions":{"view_html":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T","download_json":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T.json","view_paper":"https://pith.science/paper/BM3AUAW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13099&json=true","fetch_graph":"https://pith.science/api/pith-number/BM3AUAW5MNWLMVNS6V5QDUAX5T/graph.json","fetch_events":"https://pith.science/api/pith-number/BM3AUAW5MNWLMVNS6V5QDUAX5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T/action/storage_attestation","attest_author":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T/action/author_attestation","sign_citation":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T/action/citation_signature","submit_replication":"https://pith.science/pith/BM3AUAW5MNWLMVNS6V5QDUAX5T/action/replication_record"}},"created_at":"2026-07-05T11:22:05.137842+00:00","updated_at":"2026-07-05T11:22:05.137842+00:00"}