{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5EXLLIE5LJIXHNIAEE2US44IBF","short_pith_number":"pith:5EXLLIE5","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"},"canonical_sha256":"e92eb5a09d5a5173b50021354973880975dee299a0bc15a8a5c01a1dadb849bc","source":{"kind":"arxiv","id":"2412.07605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.07605","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"2412.07605v1","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07605","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"5EXLLIE5LJIX","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"pith_short_16","alias_value":"5EXLLIE5LJIXHNIA","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"pith_short_8","alias_value":"5EXLLIE5","created_at":"2026-07-05T09:47:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5EXLLIE5LJIXHNIAEE2US44IBF","target":"record","payload":{"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"},"canonical_sha256":"e92eb5a09d5a5173b50021354973880975dee299a0bc15a8a5c01a1dadb849bc","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"},"source_kind":"arxiv","source_id":"2412.07605","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6qzbOiuzRnW4j4c9bzQpVxKiE7z7xzAoAXIyVPF+b1Fy/BpzuEnyCTwrT49QjjPODoWx6pq+5q0W/f1W9eRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:35:48.756860Z"},"content_sha256":"1ca428f0e8e913de857dcdf6e6915805a025f5692e2da856599601918933d7f8","schema_version":"1.0","event_id":"sha256:1ca428f0e8e913de857dcdf6e6915805a025f5692e2da856599601918933d7f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5EXLLIE5LJIXHNIAEE2US44IBF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeOdtD5RINOyKkOxrewZGaon6vFnSIAKfOFZPwFXqqfhe2+122qbo6Y/XUeb51F8GX4D9WgIp+t1MyMv/1GgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:35:48.757761Z"},"content_sha256":"b2e6766c3efdcae3bb6c55364deedbd0b5d0a0c1ee107e7383677bcfef499465","schema_version":"1.0","event_id":"sha256:b2e6766c3efdcae3bb6c55364deedbd0b5d0a0c1ee107e7383677bcfef499465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/bundle.json","state_url":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EXLLIE5LJIXHNIAEE2US44IBF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T16:35:48Z","links":{"resolver":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF","bundle":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/bundle.json","state":"https://pith.science/pith/5EXLLIE5LJIXHNIAEE2US44IBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EXLLIE5LJIXHNIAEE2US44IBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5EXLLIE5LJIXHNIAEE2US44IBF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ce8e5353a141c77a8f5eb5d2bbbe3820092f7cbde0f900b950420d7e2fb08d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-10T15:45:32Z","title_canon_sha256":"83fda90d483012587e015b9782c6c66c7a6bbf5f43791fbaa321fc03faf17ad7"},"schema_version":"1.0","source":{"id":"2412.07605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.07605","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"2412.07605v1","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07605","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"5EXLLIE5LJIX","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"pith_short_16","alias_value":"5EXLLIE5LJIXHNIA","created_at":"2026-07-05T09:47:12Z"},{"alias_kind":"pith_short_8","alias_value":"5EXLLIE5","created_at":"2026-07-05T09:47:12Z"}],"graph_snapshots":[{"event_id":"sha256:b2e6766c3efdcae3bb6c55364deedbd0b5d0a0c1ee107e7383677bcfef499465","target":"graph","created_at":"2026-07-05T09:47:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.07605/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dawei Cheng, Guibin Zhang, Haoran Yang, Yanwei Yue","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-10T15:45:32Z","title":"Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07605","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1ca428f0e8e913de857dcdf6e6915805a025f5692e2da856599601918933d7f8","target":"record","created_at":"2026-07-05T09:47:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ce8e5353a141c77a8f5eb5d2bbbe3820092f7cbde0f900b950420d7e2fb08d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-10T15:45:32Z","title_canon_sha256":"83fda90d483012587e015b9782c6c66c7a6bbf5f43791fbaa321fc03faf17ad7"},"schema_version":"1.0","source":{"id":"2412.07605","kind":"arxiv","version":1}},"canonical_sha256":"e92eb5a09d5a5173b50021354973880975dee299a0bc15a8a5c01a1dadb849bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e92eb5a09d5a5173b50021354973880975dee299a0bc15a8a5c01a1dadb849bc","first_computed_at":"2026-07-05T09:47:12.226114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:12.226114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XdWBW9YFrbsFbevJe5smPj5ahpThaSCgTWvDxggQhXmRYLVlOFCdBi2brq+EDH1vGt6UPM4AWd/5mmu2PZ1KCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:12.226602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.07605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca428f0e8e913de857dcdf6e6915805a025f5692e2da856599601918933d7f8","sha256:b2e6766c3efdcae3bb6c55364deedbd0b5d0a0c1ee107e7383677bcfef499465"],"state_sha256":"cf47aeb500dbd170b738876149651e83bcd9d73e3decf0f7f7bd891af31b407d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgQdjlGun0Lt4eq6UDg+lysmDLkAqJLlwkUTTBBHxh38RicrZCQJmKeU87jSJ4oHL7Mo5232yPaw9i9bh38yCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:35:48.767589Z","bundle_sha256":"4e66be70daf03cf8db4ff7c512d250e24efcaeca900a1fc051cb9976a78d58a8"}}