{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5EXLLIE5LJIXHNIAEE2US44IBF","short_pith_number":"pith:5EXLLIE5","schema_version":"1.0","canonical_sha256":"e92eb5a09d5a5173b50021354973880975dee299a0bc15a8a5c01a1dadb849bc","source":{"kind":"arxiv","id":"2412.07605","version":1},"attestation_state":"computed","paper":{"title":"Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dawei Cheng, Guibin Zhang, Haoran Yang, Yanwei Yue","submitted_at":"2024-12-10T15:45:32Z","abstract_excerpt":"Graph Neural Networks (GNNs) demonstrate superior performance in various graph learning tasks, yet their wider real-world application is hindered by the computational overhead when applied to large-scale graphs. To address the issue, the Graph Lottery Hypothesis (GLT) has been proposed, advocating the identification of subgraphs and subnetworks, \\textit{i.e.}, winning tickets, without compromising performance. The effectiveness of current GLT methods largely stems from the use of iterative magnitude pruning (IMP), which offers higher stability and better performance than one-shot pruning. Howe"},"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":"2412.07605","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-10T15:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"83fda90d483012587e015b9782c6c66c7a6bbf5f43791fbaa321fc03faf17ad7","abstract_canon_sha256":"0ce8e5353a141c77a8f5eb5d2bbbe3820092f7cbde0f900b950420d7e2fb08d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:12.226602Z","signature_b64":"XdWBW9YFrbsFbevJe5smPj5ahpThaSCgTWvDxggQhXmRYLVlOFCdBi2brq+EDH1vGt6UPM4AWd/5mmu2PZ1KCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92eb5a09d5a5173b50021354973880975dee299a0bc15a8a5c01a1dadb849bc","last_reissued_at":"2026-07-05T09:47:12.226114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:12.226114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dawei Cheng, Guibin Zhang, Haoran Yang, Yanwei Yue","submitted_at":"2024-12-10T15:45:32Z","abstract_excerpt":"Graph Neural Networks (GNNs) demonstrate superior performance in various graph learning tasks, yet their wider real-world application is hindered by the computational overhead when applied to large-scale graphs. To address the issue, the Graph Lottery Hypothesis (GLT) has been proposed, advocating the identification of subgraphs and subnetworks, \\textit{i.e.}, winning tickets, without compromising performance. The effectiveness of current GLT methods largely stems from the use of iterative magnitude pruning (IMP), which offers higher stability and better performance than one-shot pruning. Howe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07605","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/2412.07605/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":"2412.07605","created_at":"2026-07-05T09:47:12.226225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07605v1","created_at":"2026-07-05T09:47:12.226225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07605","created_at":"2026-07-05T09:47:12.226225+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EXLLIE5LJIX","created_at":"2026-07-05T09:47:12.226225+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EXLLIE5LJIXHNIA","created_at":"2026-07-05T09:47:12.226225+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EXLLIE5","created_at":"2026-07-05T09:47:12.226225+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/5EXLLIE5LJIXHNIAEE2US44IBF","json":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF.json","graph_json":"https://pith.science/api/pith-number/5EXLLIE5LJIXHNIAEE2US44IBF/graph.json","events_json":"https://pith.science/api/pith-number/5EXLLIE5LJIXHNIAEE2US44IBF/events.json","paper":"https://pith.science/paper/5EXLLIE5"},"agent_actions":{"view_html":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF","download_json":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF.json","view_paper":"https://pith.science/paper/5EXLLIE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07605&json=true","fetch_graph":"https://pith.science/api/pith-number/5EXLLIE5LJIXHNIAEE2US44IBF/graph.json","fetch_events":"https://pith.science/api/pith-number/5EXLLIE5LJIXHNIAEE2US44IBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/action/storage_attestation","attest_author":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/action/author_attestation","sign_citation":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/action/citation_signature","submit_replication":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/action/replication_record"}},"created_at":"2026-07-05T09:47:12.226225+00:00","updated_at":"2026-07-05T09:47:12.226225+00:00"}