{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QZQ7Y2QUDJ5XYITA6EMMSYQWFT","short_pith_number":"pith:QZQ7Y2QU","canonical_record":{"source":{"id":"2201.02571","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-07T18:09:23Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"3935b9dead4b94f6c3cb8d3421aa99be7f6c120f83ae04baa84ea78c0cb6a976","abstract_canon_sha256":"fd606bf15598559aa5495706719ba74b2d0914fc58db8e1ca9d9642584f23c44"},"schema_version":"1.0"},"canonical_sha256":"8661fc6a141a7b7c2260f118c962162ceea90c76f9547fee40051b0c35eecbb2","source":{"kind":"arxiv","id":"2201.02571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.02571","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2201.02571v2","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02571","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"QZQ7Y2QUDJ5X","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"QZQ7Y2QUDJ5XYITA","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"QZQ7Y2QU","created_at":"2026-07-05T04:12:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QZQ7Y2QUDJ5XYITA6EMMSYQWFT","target":"record","payload":{"canonical_record":{"source":{"id":"2201.02571","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-07T18:09:23Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"3935b9dead4b94f6c3cb8d3421aa99be7f6c120f83ae04baa84ea78c0cb6a976","abstract_canon_sha256":"fd606bf15598559aa5495706719ba74b2d0914fc58db8e1ca9d9642584f23c44"},"schema_version":"1.0"},"canonical_sha256":"8661fc6a141a7b7c2260f118c962162ceea90c76f9547fee40051b0c35eecbb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:12:38.030767Z","signature_b64":"1vizAUvFvsTdnOkoiobW5UWc9KkX4q+uoUTNtUEvlFSe/C7XjZpAN0TCakUraXyezNuw93H23CNkwKdhJsedBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8661fc6a141a7b7c2260f118c962162ceea90c76f9547fee40051b0c35eecbb2","last_reissued_at":"2026-07-05T04:12:38.030378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:12:38.030378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.02571","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-05T04:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jW0HkUM9M55JPxEnmjWRpPOnNsnQLGBaiFAEHxsIpY8kmK5IFjYjVn0O8OSJh23Zi4Y5iq7FPTRiKCCIGA3DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:39:04.897750Z"},"content_sha256":"464c88aa8c933b9db5888b6809436985b6170607906fc49bd8ecf145c5afcc39","schema_version":"1.0","event_id":"sha256:464c88aa8c933b9db5888b6809436985b6170607906fc49bd8ecf145c5afcc39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QZQ7Y2QUDJ5XYITA6EMMSYQWFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Network Optimization for Reinforcement Learning Tasks Using Sparse Computations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Denis Larionov, Dmitry Ivanov, Mikhail Kiselev","submitted_at":"2022-01-07T18:09:23Z","abstract_excerpt":"This article proposes a sparse computation-based method for optimizing neural networks for reinforcement learning (RL) tasks. This method combines two ideas: neural network pruning and taking into account input data correlations; it makes it possible to update neuron states only when changes in them exceed a certain threshold. It significantly reduces the number of multiplications when running neural networks. We tested different RL tasks and achieved 20-150x reduction in the number of multiplications. There were no substantial performance losses; sometimes the performance even improved."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02571","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/2201.02571/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-05T04:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORbkSSS+ebjY+DtfiSxrysz5kQToIuSw0zdUxE4l5Xn6Kn9Fv3MucQFJ19y8FodLHlbRpl1S/stwvfk+BaD3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:39:04.898608Z"},"content_sha256":"0710907dd90bcbdbf824f502aaffaa3ef4c4cc1114624f3e17aaba5c54d12d7e","schema_version":"1.0","event_id":"sha256:0710907dd90bcbdbf824f502aaffaa3ef4c4cc1114624f3e17aaba5c54d12d7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT/bundle.json","state_url":"https://pith.science/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT/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-03T20:39:04Z","links":{"resolver":"https://pith.science/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT","bundle":"https://pith.science/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT/bundle.json","state":"https://pith.science/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZQ7Y2QUDJ5XYITA6EMMSYQWFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QZQ7Y2QUDJ5XYITA6EMMSYQWFT","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":"fd606bf15598559aa5495706719ba74b2d0914fc58db8e1ca9d9642584f23c44","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-07T18:09:23Z","title_canon_sha256":"3935b9dead4b94f6c3cb8d3421aa99be7f6c120f83ae04baa84ea78c0cb6a976"},"schema_version":"1.0","source":{"id":"2201.02571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.02571","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2201.02571v2","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02571","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"QZQ7Y2QUDJ5X","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"QZQ7Y2QUDJ5XYITA","created_at":"2026-07-05T04:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"QZQ7Y2QU","created_at":"2026-07-05T04:12:38Z"}],"graph_snapshots":[{"event_id":"sha256:0710907dd90bcbdbf824f502aaffaa3ef4c4cc1114624f3e17aaba5c54d12d7e","target":"graph","created_at":"2026-07-05T04:12:38Z","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/2201.02571/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This article proposes a sparse computation-based method for optimizing neural networks for reinforcement learning (RL) tasks. This method combines two ideas: neural network pruning and taking into account input data correlations; it makes it possible to update neuron states only when changes in them exceed a certain threshold. It significantly reduces the number of multiplications when running neural networks. We tested different RL tasks and achieved 20-150x reduction in the number of multiplications. There were no substantial performance losses; sometimes the performance even improved.","authors_text":"Denis Larionov, Dmitry Ivanov, Mikhail Kiselev","cross_cats":["cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-07T18:09:23Z","title":"Neural Network Optimization for Reinforcement Learning Tasks Using Sparse Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02571","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:464c88aa8c933b9db5888b6809436985b6170607906fc49bd8ecf145c5afcc39","target":"record","created_at":"2026-07-05T04:12:38Z","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":"fd606bf15598559aa5495706719ba74b2d0914fc58db8e1ca9d9642584f23c44","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-07T18:09:23Z","title_canon_sha256":"3935b9dead4b94f6c3cb8d3421aa99be7f6c120f83ae04baa84ea78c0cb6a976"},"schema_version":"1.0","source":{"id":"2201.02571","kind":"arxiv","version":2}},"canonical_sha256":"8661fc6a141a7b7c2260f118c962162ceea90c76f9547fee40051b0c35eecbb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8661fc6a141a7b7c2260f118c962162ceea90c76f9547fee40051b0c35eecbb2","first_computed_at":"2026-07-05T04:12:38.030378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:12:38.030378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1vizAUvFvsTdnOkoiobW5UWc9KkX4q+uoUTNtUEvlFSe/C7XjZpAN0TCakUraXyezNuw93H23CNkwKdhJsedBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:12:38.030767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.02571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:464c88aa8c933b9db5888b6809436985b6170607906fc49bd8ecf145c5afcc39","sha256:0710907dd90bcbdbf824f502aaffaa3ef4c4cc1114624f3e17aaba5c54d12d7e"],"state_sha256":"3efdfe5b5d9de33800a2f78d4cc7a014c1107cc35c02e74dbb310d3368c8a4e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vu7r1Wwt3Da+lVaJVjPN9pAO8VZ6HJ3EIFlHuGQ3ziVJyuNidAGRZrKkk9uvvNMh9kE8eZrZ1udmbXxDY3aCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:39:04.906894Z","bundle_sha256":"f52da9dadff4d3efaf833a4057826b87cfe4007e7b557cb8330021d222f29f9e"}}