{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UZUX4R3EPZCHJMPFTG6YB7YBEE","short_pith_number":"pith:UZUX4R3E","canonical_record":{"source":{"id":"2112.15579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-31T18:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"ddf16211e6bf576ff674872009035b8cc27967c2f53fcbf4ef7889e190beb1c7","abstract_canon_sha256":"ff06677117a6c6372402ecfdb00abe803918ad1002c1e76425ebf510e94f24d1"},"schema_version":"1.0"},"canonical_sha256":"a6697e47647e4474b1e599bd80ff012106db58129947a299cb608d5e4468d368","source":{"kind":"arxiv","id":"2112.15579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.15579","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2112.15579v1","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.15579","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"UZUX4R3EPZCH","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"pith_short_16","alias_value":"UZUX4R3EPZCHJMPF","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"pith_short_8","alias_value":"UZUX4R3E","created_at":"2026-07-05T03:44:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UZUX4R3EPZCHJMPFTG6YB7YBEE","target":"record","payload":{"canonical_record":{"source":{"id":"2112.15579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-31T18:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"ddf16211e6bf576ff674872009035b8cc27967c2f53fcbf4ef7889e190beb1c7","abstract_canon_sha256":"ff06677117a6c6372402ecfdb00abe803918ad1002c1e76425ebf510e94f24d1"},"schema_version":"1.0"},"canonical_sha256":"a6697e47647e4474b1e599bd80ff012106db58129947a299cb608d5e4468d368","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:47.733189Z","signature_b64":"IhKg4bnAB2XQYRNs0tpuKjZ8s6q8LPhZyYG5KmGeihlYYyJ1qIexGnRqFS8264aK5TGrxo3gi+y5dnyCb3VdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6697e47647e4474b1e599bd80ff012106db58129947a299cb608d5e4468d368","last_reissued_at":"2026-07-05T03:44:47.732825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:47.732825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.15579","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-05T03:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mrvYz4A+q7M8ulwOlYHMxdIAxcPKYVzQ+fRKST6SN4DW70Lk2P3OosaQyNWALNMn9YFU9sQ+aH3M2DVaxL9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:46:31.116216Z"},"content_sha256":"f46e50183bf1e8cb63f61938fb7781173f892f31f2120a22677c3667152b181a","schema_version":"1.0","event_id":"sha256:f46e50183bf1e8cb63f61938fb7781173f892f31f2120a22677c3667152b181a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UZUX4R3EPZCHJMPFTG6YB7YBEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single-Shot Pruning for Offline Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Doina Precup, Riyasat Ohib, Samin Yeasar Arnob, Sergey Plis","submitted_at":"2021-12-31T18:10:02Z","abstract_excerpt":"Deep Reinforcement Learning (RL) is a powerful framework for solving complex real-world problems. Large neural networks employed in the framework are traditionally associated with better generalization capabilities, but their increased size entails the drawbacks of extensive training duration, substantial hardware resources, and longer inference times. One way to tackle this problem is to prune neural networks leaving only the necessary parameters. State-of-the-art concurrent pruning techniques for imposing sparsity perform demonstrably well in applications where data distributions are fixed. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.15579","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/2112.15579/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-05T03:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxQ85CZdc0raG655oKNvk0yFhNUJKfVmfO9IrcsdmUAzQZyreGUOaUVeOzkpMmAZczFbE6Vixe30K26EU3r1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:46:31.116719Z"},"content_sha256":"b035dc72940c4ae0c966cabd3dc20c2886e2a1264b7ef2d5afdf237cadf7b76d","schema_version":"1.0","event_id":"sha256:b035dc72940c4ae0c966cabd3dc20c2886e2a1264b7ef2d5afdf237cadf7b76d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE/bundle.json","state_url":"https://pith.science/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE/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-06T06:46:31Z","links":{"resolver":"https://pith.science/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE","bundle":"https://pith.science/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE/bundle.json","state":"https://pith.science/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZUX4R3EPZCHJMPFTG6YB7YBEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UZUX4R3EPZCHJMPFTG6YB7YBEE","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":"ff06677117a6c6372402ecfdb00abe803918ad1002c1e76425ebf510e94f24d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-31T18:10:02Z","title_canon_sha256":"ddf16211e6bf576ff674872009035b8cc27967c2f53fcbf4ef7889e190beb1c7"},"schema_version":"1.0","source":{"id":"2112.15579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.15579","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2112.15579v1","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.15579","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"UZUX4R3EPZCH","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"pith_short_16","alias_value":"UZUX4R3EPZCHJMPF","created_at":"2026-07-05T03:44:47Z"},{"alias_kind":"pith_short_8","alias_value":"UZUX4R3E","created_at":"2026-07-05T03:44:47Z"}],"graph_snapshots":[{"event_id":"sha256:b035dc72940c4ae0c966cabd3dc20c2886e2a1264b7ef2d5afdf237cadf7b76d","target":"graph","created_at":"2026-07-05T03:44:47Z","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/2112.15579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep Reinforcement Learning (RL) is a powerful framework for solving complex real-world problems. Large neural networks employed in the framework are traditionally associated with better generalization capabilities, but their increased size entails the drawbacks of extensive training duration, substantial hardware resources, and longer inference times. One way to tackle this problem is to prune neural networks leaving only the necessary parameters. State-of-the-art concurrent pruning techniques for imposing sparsity perform demonstrably well in applications where data distributions are fixed. ","authors_text":"Doina Precup, Riyasat Ohib, Samin Yeasar Arnob, Sergey Plis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-31T18:10:02Z","title":"Single-Shot Pruning for Offline Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.15579","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:f46e50183bf1e8cb63f61938fb7781173f892f31f2120a22677c3667152b181a","target":"record","created_at":"2026-07-05T03:44:47Z","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":"ff06677117a6c6372402ecfdb00abe803918ad1002c1e76425ebf510e94f24d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-31T18:10:02Z","title_canon_sha256":"ddf16211e6bf576ff674872009035b8cc27967c2f53fcbf4ef7889e190beb1c7"},"schema_version":"1.0","source":{"id":"2112.15579","kind":"arxiv","version":1}},"canonical_sha256":"a6697e47647e4474b1e599bd80ff012106db58129947a299cb608d5e4468d368","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6697e47647e4474b1e599bd80ff012106db58129947a299cb608d5e4468d368","first_computed_at":"2026-07-05T03:44:47.732825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:47.732825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IhKg4bnAB2XQYRNs0tpuKjZ8s6q8LPhZyYG5KmGeihlYYyJ1qIexGnRqFS8264aK5TGrxo3gi+y5dnyCb3VdAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:47.733189Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.15579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f46e50183bf1e8cb63f61938fb7781173f892f31f2120a22677c3667152b181a","sha256:b035dc72940c4ae0c966cabd3dc20c2886e2a1264b7ef2d5afdf237cadf7b76d"],"state_sha256":"f9151942c08ec3b60e1f4d44936f1fa208c3133261d317bd1d82a16fc6e2f77d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhQLu1A+/mFKxbDYjjkFI8miKzYJpPxePSTbcLXeQCmLWgl87vctiZajM/LbAZ51T63plt56DSVcZZvRGQoIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:46:31.122342Z","bundle_sha256":"f274ba650b669dbf4979d5bf6b300e46d56d56a6d38660ed45b989fdb2d767b7"}}