{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:UTPOBE7GIUQSMDY5NMAZUM56YF","short_pith_number":"pith:UTPOBE7G","canonical_record":{"source":{"id":"2009.11094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-22T17:36:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b68277e0f2840d544d01325135709872c9e683addc7e37393ed5cb8480fc1437","abstract_canon_sha256":"295cd8fb99a9da34537c4a80518a744cb6cadbb30cb84f48329d8148038c55ee"},"schema_version":"1.0"},"canonical_sha256":"a4dee093e64521260f1d6b019a33bec1440ff186627a4eafb89148e0b56f9868","source":{"kind":"arxiv","id":"2009.11094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11094","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11094v2","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11094","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"UTPOBE7GIUQS","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"pith_short_16","alias_value":"UTPOBE7GIUQSMDY5","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"pith_short_8","alias_value":"UTPOBE7G","created_at":"2026-07-05T01:45:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:UTPOBE7GIUQSMDY5NMAZUM56YF","target":"record","payload":{"canonical_record":{"source":{"id":"2009.11094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-22T17:36:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b68277e0f2840d544d01325135709872c9e683addc7e37393ed5cb8480fc1437","abstract_canon_sha256":"295cd8fb99a9da34537c4a80518a744cb6cadbb30cb84f48329d8148038c55ee"},"schema_version":"1.0"},"canonical_sha256":"a4dee093e64521260f1d6b019a33bec1440ff186627a4eafb89148e0b56f9868","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:06.265364Z","signature_b64":"cnu4TKybrVO65LKjF135iVq9uGDFbvcA38cR/zci4KDiAoj+Xjqbn3B6tmw/+tnXoHBcwRkNKovHmUKbOePUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4dee093e64521260f1d6b019a33bec1440ff186627a4eafb89148e0b56f9868","last_reissued_at":"2026-07-05T01:45:06.264865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:06.264865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.11094","source_version":2,"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-05T01:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhDPT8UMiUnQeouFiyb8pKibZIOcmlF1S0oMDgQ9Jq9i9CUXTB31Dm5tORdlwvWryrO60pXUBUtGnszLYTh2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:05:36.799186Z"},"content_sha256":"351e57722611ac0fec00d9b09ff69997dfb44c29269d349d79e90b20f32c6964","schema_version":"1.0","event_id":"sha256:351e57722611ac0fec00d9b09ff69997dfb44c29269d349d79e90b20f32c6964"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:UTPOBE7GIUQSMDY5NMAZUM56YF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jason D. Lee, Jingtong Su, Liwei Wang, Ruiqi Gao, Tianhao Wu, Tianle Cai, Yihang Chen","submitted_at":"2020-09-22T17:36:17Z","abstract_excerpt":"Network pruning is a method for reducing test-time computational resource requirements with minimal performance degradation. Conventional wisdom of pruning algorithms suggests that: (1) Pruning methods exploit information from training data to find good subnetworks; (2) The architecture of the pruned network is crucial for good performance. In this paper, we conduct sanity checks for the above beliefs on several recent unstructured pruning methods and surprisingly find that: (1) A set of methods which aims to find good subnetworks of the randomly-initialized network (which we call \"initial tic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11094","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/2009.11094/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-05T01:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LrCh7iisvuBiVMtQkxIv864lKVYNIDM5D/j91R9IKj+knWJHTS1og2Q+zrM3vm1Nq0NuVEGRl74z2ZhtQCBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:05:36.799857Z"},"content_sha256":"3de665cbf3fad06f75881441fd91a74577a6bf0e3a74d5262fa58449a13aab3a","schema_version":"1.0","event_id":"sha256:3de665cbf3fad06f75881441fd91a74577a6bf0e3a74d5262fa58449a13aab3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTPOBE7GIUQSMDY5NMAZUM56YF/bundle.json","state_url":"https://pith.science/pith/UTPOBE7GIUQSMDY5NMAZUM56YF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTPOBE7GIUQSMDY5NMAZUM56YF/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-07-05T15:05:36Z","links":{"resolver":"https://pith.science/pith/UTPOBE7GIUQSMDY5NMAZUM56YF","bundle":"https://pith.science/pith/UTPOBE7GIUQSMDY5NMAZUM56YF/bundle.json","state":"https://pith.science/pith/UTPOBE7GIUQSMDY5NMAZUM56YF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTPOBE7GIUQSMDY5NMAZUM56YF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:UTPOBE7GIUQSMDY5NMAZUM56YF","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":"295cd8fb99a9da34537c4a80518a744cb6cadbb30cb84f48329d8148038c55ee","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-22T17:36:17Z","title_canon_sha256":"b68277e0f2840d544d01325135709872c9e683addc7e37393ed5cb8480fc1437"},"schema_version":"1.0","source":{"id":"2009.11094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11094","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11094v2","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11094","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"UTPOBE7GIUQS","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"pith_short_16","alias_value":"UTPOBE7GIUQSMDY5","created_at":"2026-07-05T01:45:06Z"},{"alias_kind":"pith_short_8","alias_value":"UTPOBE7G","created_at":"2026-07-05T01:45:06Z"}],"graph_snapshots":[{"event_id":"sha256:3de665cbf3fad06f75881441fd91a74577a6bf0e3a74d5262fa58449a13aab3a","target":"graph","created_at":"2026-07-05T01:45:06Z","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/2009.11094/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network pruning is a method for reducing test-time computational resource requirements with minimal performance degradation. Conventional wisdom of pruning algorithms suggests that: (1) Pruning methods exploit information from training data to find good subnetworks; (2) The architecture of the pruned network is crucial for good performance. In this paper, we conduct sanity checks for the above beliefs on several recent unstructured pruning methods and surprisingly find that: (1) A set of methods which aims to find good subnetworks of the randomly-initialized network (which we call \"initial tic","authors_text":"Jason D. Lee, Jingtong Su, Liwei Wang, Ruiqi Gao, Tianhao Wu, Tianle Cai, Yihang Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-22T17:36:17Z","title":"Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11094","kind":"arxiv","version":2},"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:351e57722611ac0fec00d9b09ff69997dfb44c29269d349d79e90b20f32c6964","target":"record","created_at":"2026-07-05T01:45:06Z","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":"295cd8fb99a9da34537c4a80518a744cb6cadbb30cb84f48329d8148038c55ee","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-22T17:36:17Z","title_canon_sha256":"b68277e0f2840d544d01325135709872c9e683addc7e37393ed5cb8480fc1437"},"schema_version":"1.0","source":{"id":"2009.11094","kind":"arxiv","version":2}},"canonical_sha256":"a4dee093e64521260f1d6b019a33bec1440ff186627a4eafb89148e0b56f9868","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4dee093e64521260f1d6b019a33bec1440ff186627a4eafb89148e0b56f9868","first_computed_at":"2026-07-05T01:45:06.264865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:06.264865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cnu4TKybrVO65LKjF135iVq9uGDFbvcA38cR/zci4KDiAoj+Xjqbn3B6tmw/+tnXoHBcwRkNKovHmUKbOePUCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:06.265364Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:351e57722611ac0fec00d9b09ff69997dfb44c29269d349d79e90b20f32c6964","sha256:3de665cbf3fad06f75881441fd91a74577a6bf0e3a74d5262fa58449a13aab3a"],"state_sha256":"1e0d2d9b836c8b1365f63629fe7193cd3e7f98bfe8264546d0fb95f63109269e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55pg6QVd9Yg8W+Feb1kZE1NNoQDlnJY+cvuQRcsTzpKU++2D/qyM0VQca52mxM3DrgVuLjxBuofvhgZXVqHXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:05:36.803260Z","bundle_sha256":"a25ad6b2ad2927b696b54f23dd72275a7c25e48b34b5171c60741e5256937d7c"}}