{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F55EXFS3KDQGHIUJVDOZFDOJ7T","short_pith_number":"pith:F55EXFS3","schema_version":"1.0","canonical_sha256":"2f7a4b965b50e063a289a8dd928dc9fceb40caab921ce4ced550ef979de7ba2c","source":{"kind":"arxiv","id":"2405.14246","version":3},"attestation_state":"computed","paper":{"title":"GCondenser: Benchmarking Graph Condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruihong Qiu, Yilun Liu, Zi Huang","submitted_at":"2024-05-23T07:25:31Z","abstract_excerpt":"Large-scale graphs are valuable for graph representation learning, yet the abundant data in these graphs hinders the efficiency of the training process. Graph condensation (GC) alleviates this issue by compressing the large graph into a significantly smaller one that still supports effective model training. Although recent research has introduced various approaches to improve the effectiveness of the condensed graph, comprehensive and practical evaluations across different GC methods are neglected. This paper proposes the first large-scale graph condensation benchmark, GCondenser, to holistica"},"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.14246","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-23T07:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"cc25ffde09b89c1f2be4cd63b3d4d0ffcdb02fdcf87b8dc9cdbb7370cc7077a8","abstract_canon_sha256":"ea562820f05e9b2f0b3d557c9069602405f47e799fb1319da89b40f2ca647b8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:04.465567Z","signature_b64":"aNht0iJrA4ju+RPM+xJcH1X43P9k3tW+GSWZruNKK23f3UThg8ag3li+GjZGRpC8SpYbzhM9caHpYGu/ib6DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f7a4b965b50e063a289a8dd928dc9fceb40caab921ce4ced550ef979de7ba2c","last_reissued_at":"2026-07-05T08:42:04.465083Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:04.465083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GCondenser: Benchmarking Graph Condensation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruihong Qiu, Yilun Liu, Zi Huang","submitted_at":"2024-05-23T07:25:31Z","abstract_excerpt":"Large-scale graphs are valuable for graph representation learning, yet the abundant data in these graphs hinders the efficiency of the training process. Graph condensation (GC) alleviates this issue by compressing the large graph into a significantly smaller one that still supports effective model training. Although recent research has introduced various approaches to improve the effectiveness of the condensed graph, comprehensive and practical evaluations across different GC methods are neglected. This paper proposes the first large-scale graph condensation benchmark, GCondenser, to holistica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14246","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/2405.14246/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.14246","created_at":"2026-07-05T08:42:04.465136+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14246v3","created_at":"2026-07-05T08:42:04.465136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14246","created_at":"2026-07-05T08:42:04.465136+00:00"},{"alias_kind":"pith_short_12","alias_value":"F55EXFS3KDQG","created_at":"2026-07-05T08:42:04.465136+00:00"},{"alias_kind":"pith_short_16","alias_value":"F55EXFS3KDQGHIUJ","created_at":"2026-07-05T08:42:04.465136+00:00"},{"alias_kind":"pith_short_8","alias_value":"F55EXFS3","created_at":"2026-07-05T08:42:04.465136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15696","citing_title":"Random Walk Guided Hyperbolic Graph Distillation","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T","json":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T.json","graph_json":"https://pith.science/api/pith-number/F55EXFS3KDQGHIUJVDOZFDOJ7T/graph.json","events_json":"https://pith.science/api/pith-number/F55EXFS3KDQGHIUJVDOZFDOJ7T/events.json","paper":"https://pith.science/paper/F55EXFS3"},"agent_actions":{"view_html":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T","download_json":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T.json","view_paper":"https://pith.science/paper/F55EXFS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14246&json=true","fetch_graph":"https://pith.science/api/pith-number/F55EXFS3KDQGHIUJVDOZFDOJ7T/graph.json","fetch_events":"https://pith.science/api/pith-number/F55EXFS3KDQGHIUJVDOZFDOJ7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T/action/storage_attestation","attest_author":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T/action/author_attestation","sign_citation":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T/action/citation_signature","submit_replication":"https://pith.science/pith/F55EXFS3KDQGHIUJVDOZFDOJ7T/action/replication_record"}},"created_at":"2026-07-05T08:42:04.465136+00:00","updated_at":"2026-07-05T08:42:04.465136+00:00"}