{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:57DIKIDYH4NKLX3WCSRLTU4GEE","short_pith_number":"pith:57DIKIDY","schema_version":"1.0","canonical_sha256":"efc68520783f1aa5df7614a2b9d386210edc3e866ef62114c21bd633b8a7b4ea","source":{"kind":"arxiv","id":"2406.13200","version":2},"attestation_state":"computed","paper":{"title":"RobGC: Towards Robust Graph Condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Cui, Guanhua Ye, Hongzhi Yin, Tong Chen, Wentao Zhang, Xinyi Gao","submitted_at":"2024-06-19T04:14:57Z","abstract_excerpt":"Graph neural networks (GNNs) have attracted widespread attention for their impressive capability of graph representation learning. However, the increasing prevalence of large-scale graphs presents a significant challenge for GNN training due to their computational demands, limiting the applicability of GNNs in various scenarios. In response to this challenge, graph condensation (GC) is proposed as a promising acceleration solution, focusing on generating an informative compact graph that enables efficient training of GNNs while retaining performance. Despite the potential to accelerate GNN tra"},"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":"2406.13200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-19T04:14:57Z","cross_cats_sorted":[],"title_canon_sha256":"6c87601c160da447ed70ca353f0a0be777974c2226a7931baeceeaaff624ba86","abstract_canon_sha256":"1a5dcc36668957c804909c4fc167adad16f44dc8e12551205bba81fefb23ddfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:25.014353Z","signature_b64":"KWI23CsIBPG/YtuaLRgU82iGZZEFdf7DpXLYbqM3qN+ZHPgOmj0k5X+CJKkjRoRR9Zi62RpBp5Au7qESLY/VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efc68520783f1aa5df7614a2b9d386210edc3e866ef62114c21bd633b8a7b4ea","last_reissued_at":"2026-07-05T11:01:25.013844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:25.013844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RobGC: Towards Robust Graph Condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Cui, Guanhua Ye, Hongzhi Yin, Tong Chen, Wentao Zhang, Xinyi Gao","submitted_at":"2024-06-19T04:14:57Z","abstract_excerpt":"Graph neural networks (GNNs) have attracted widespread attention for their impressive capability of graph representation learning. However, the increasing prevalence of large-scale graphs presents a significant challenge for GNN training due to their computational demands, limiting the applicability of GNNs in various scenarios. In response to this challenge, graph condensation (GC) is proposed as a promising acceleration solution, focusing on generating an informative compact graph that enables efficient training of GNNs while retaining performance. Despite the potential to accelerate GNN tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13200","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/2406.13200/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":"2406.13200","created_at":"2026-07-05T11:01:25.013898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13200v2","created_at":"2026-07-05T11:01:25.013898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13200","created_at":"2026-07-05T11:01:25.013898+00:00"},{"alias_kind":"pith_short_12","alias_value":"57DIKIDYH4NK","created_at":"2026-07-05T11:01:25.013898+00:00"},{"alias_kind":"pith_short_16","alias_value":"57DIKIDYH4NKLX3W","created_at":"2026-07-05T11:01:25.013898+00:00"},{"alias_kind":"pith_short_8","alias_value":"57DIKIDY","created_at":"2026-07-05T11:01:25.013898+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/57DIKIDYH4NKLX3WCSRLTU4GEE","json":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE.json","graph_json":"https://pith.science/api/pith-number/57DIKIDYH4NKLX3WCSRLTU4GEE/graph.json","events_json":"https://pith.science/api/pith-number/57DIKIDYH4NKLX3WCSRLTU4GEE/events.json","paper":"https://pith.science/paper/57DIKIDY"},"agent_actions":{"view_html":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE","download_json":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE.json","view_paper":"https://pith.science/paper/57DIKIDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13200&json=true","fetch_graph":"https://pith.science/api/pith-number/57DIKIDYH4NKLX3WCSRLTU4GEE/graph.json","fetch_events":"https://pith.science/api/pith-number/57DIKIDYH4NKLX3WCSRLTU4GEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE/action/storage_attestation","attest_author":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE/action/author_attestation","sign_citation":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE/action/citation_signature","submit_replication":"https://pith.science/pith/57DIKIDYH4NKLX3WCSRLTU4GEE/action/replication_record"}},"created_at":"2026-07-05T11:01:25.013898+00:00","updated_at":"2026-07-05T11:01:25.013898+00:00"}