{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VZBVR22VSJQJW4LQV25FUKMBD5","short_pith_number":"pith:VZBVR22V","canonical_record":{"source":{"id":"1511.06297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T18:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"dc43c7cd717cb91a9a339dfb501c13d7cda1b69e80a2222fead2fae46548f1db","abstract_canon_sha256":"7485a9f9afd9790b3aa6cf1f60fa27ca9d9069a60e743b0bb0ab3d17c8433419"},"schema_version":"1.0"},"canonical_sha256":"ae4358eb5592609b7170aeba5a29811f74029029eed9e444aec2dbfb9538e3b1","source":{"kind":"arxiv","id":"1511.06297","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06297","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06297v2","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06297","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"VZBVR22VSJQJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VZBVR22VSJQJW4LQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VZBVR22V","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VZBVR22VSJQJW4LQV25FUKMBD5","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T18:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"dc43c7cd717cb91a9a339dfb501c13d7cda1b69e80a2222fead2fae46548f1db","abstract_canon_sha256":"7485a9f9afd9790b3aa6cf1f60fa27ca9d9069a60e743b0bb0ab3d17c8433419"},"schema_version":"1.0"},"canonical_sha256":"ae4358eb5592609b7170aeba5a29811f74029029eed9e444aec2dbfb9538e3b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:11.828224Z","signature_b64":"yV/b+YTa3If61oHWVF6rbVgdnQN0nmY++ShL42eMGaLhDuRiKwN+LPfV1YuomOVG1c5b8IScb1HjV5Qg2o8gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae4358eb5592609b7170aeba5a29811f74029029eed9e444aec2dbfb9538e3b1","last_reissued_at":"2026-05-18T01:23:11.827646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:11.827646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06297","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-05-18T01:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjTBPM0uCHbMuisTMHI6AHWMOg8Ot35+Q0xcJfUhkoehwn+m/p25SEOrNY6Frk7JPOgKhdSbbLW+/XUqFLiiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:56:47.086015Z"},"content_sha256":"ec4a8d6b6c38ee2157d0b9300f70e5a3f2a98ecc5ae82ccd8ed6d3bf96599836","schema_version":"1.0","event_id":"sha256:ec4a8d6b6c38ee2157d0b9300f70e5a3f2a98ecc5ae82ccd8ed6d3bf96599836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VZBVR22VSJQJW4LQV25FUKMBD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditional Computation in Neural Networks for faster models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Doina Precup, Emmanuel Bengio, Joelle Pineau, Pierre-Luc Bacon","submitted_at":"2015-11-19T18:40:22Z","abstract_excerpt":"Deep learning has become the state-of-art tool in many applications, but the evaluation and training of deep models can be time-consuming and computationally expensive. The conditional computation approach has been proposed to tackle this problem (Bengio et al., 2013; Davis & Arel, 2013). It operates by selectively activating only parts of the network at a time. In this paper, we use reinforcement learning as a tool to optimize conditional computation policies. More specifically, we cast the problem of learning activation-dependent policies for dropping out blocks of units as a reinforcement l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06297","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":""},"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-05-18T01:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yagBQx5Uq9qf+5GWbLQi6eBS1iSHu1s9z3PjauF7sH7DK/IF6zV03XAvrFH05Rxj5HROpp5WU9NLRboP0kijCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:56:47.086678Z"},"content_sha256":"1b61127d46cfd27ba190c95a06ecb373c44983127fcc3d926c043c658c27b834","schema_version":"1.0","event_id":"sha256:1b61127d46cfd27ba190c95a06ecb373c44983127fcc3d926c043c658c27b834"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZBVR22VSJQJW4LQV25FUKMBD5/bundle.json","state_url":"https://pith.science/pith/VZBVR22VSJQJW4LQV25FUKMBD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZBVR22VSJQJW4LQV25FUKMBD5/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-05-26T01:56:47Z","links":{"resolver":"https://pith.science/pith/VZBVR22VSJQJW4LQV25FUKMBD5","bundle":"https://pith.science/pith/VZBVR22VSJQJW4LQV25FUKMBD5/bundle.json","state":"https://pith.science/pith/VZBVR22VSJQJW4LQV25FUKMBD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZBVR22VSJQJW4LQV25FUKMBD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VZBVR22VSJQJW4LQV25FUKMBD5","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":"7485a9f9afd9790b3aa6cf1f60fa27ca9d9069a60e743b0bb0ab3d17c8433419","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T18:40:22Z","title_canon_sha256":"dc43c7cd717cb91a9a339dfb501c13d7cda1b69e80a2222fead2fae46548f1db"},"schema_version":"1.0","source":{"id":"1511.06297","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06297","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06297v2","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06297","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"VZBVR22VSJQJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VZBVR22VSJQJW4LQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VZBVR22V","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:1b61127d46cfd27ba190c95a06ecb373c44983127fcc3d926c043c658c27b834","target":"graph","created_at":"2026-05-18T01:23:11Z","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"},"paper":{"abstract_excerpt":"Deep learning has become the state-of-art tool in many applications, but the evaluation and training of deep models can be time-consuming and computationally expensive. The conditional computation approach has been proposed to tackle this problem (Bengio et al., 2013; Davis & Arel, 2013). It operates by selectively activating only parts of the network at a time. In this paper, we use reinforcement learning as a tool to optimize conditional computation policies. More specifically, we cast the problem of learning activation-dependent policies for dropping out blocks of units as a reinforcement l","authors_text":"Doina Precup, Emmanuel Bengio, Joelle Pineau, Pierre-Luc Bacon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T18:40:22Z","title":"Conditional Computation in Neural Networks for faster models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06297","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:ec4a8d6b6c38ee2157d0b9300f70e5a3f2a98ecc5ae82ccd8ed6d3bf96599836","target":"record","created_at":"2026-05-18T01:23:11Z","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":"7485a9f9afd9790b3aa6cf1f60fa27ca9d9069a60e743b0bb0ab3d17c8433419","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T18:40:22Z","title_canon_sha256":"dc43c7cd717cb91a9a339dfb501c13d7cda1b69e80a2222fead2fae46548f1db"},"schema_version":"1.0","source":{"id":"1511.06297","kind":"arxiv","version":2}},"canonical_sha256":"ae4358eb5592609b7170aeba5a29811f74029029eed9e444aec2dbfb9538e3b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae4358eb5592609b7170aeba5a29811f74029029eed9e444aec2dbfb9538e3b1","first_computed_at":"2026-05-18T01:23:11.827646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:11.827646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yV/b+YTa3If61oHWVF6rbVgdnQN0nmY++ShL42eMGaLhDuRiKwN+LPfV1YuomOVG1c5b8IScb1HjV5Qg2o8gAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:11.828224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06297","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec4a8d6b6c38ee2157d0b9300f70e5a3f2a98ecc5ae82ccd8ed6d3bf96599836","sha256:1b61127d46cfd27ba190c95a06ecb373c44983127fcc3d926c043c658c27b834"],"state_sha256":"e360548e613c9ca70ba5571f2ddbe90e8de7ae970bc1d5b1a7e51b5c3a7245db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3pTtfcaY/mgubcGfQ+uJtWYLUWPqN4Avrs4snYldnZXuj4TBGaO3dpn5eWhV7ZcWQ2uVVVU2StD2CsPQBXiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:56:47.090898Z","bundle_sha256":"b86518db770fd92517df6c85168c4aa012557e2b2f6550c5efed836833dab6ec"}}