{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QNC5U7N7YHMNYHWDUDWSMMZXNT","short_pith_number":"pith:QNC5U7N7","canonical_record":{"source":{"id":"1312.4461","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-16T18:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"ca359c9f563205906c76fef62bc7fd8f5030aeb47cd54ce0e4080ffc050d4e82","abstract_canon_sha256":"fa46ed6fdcd9145726444d21caf29c766fa4f0be49ba36201f8adafbe9d0b0d5"},"schema_version":"1.0"},"canonical_sha256":"8345da7dbfc1d8dc1ec3a0ed2633376cf2cc85daf12f85c2521e3c39546dfa5b","source":{"kind":"arxiv","id":"1312.4461","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4461","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4461v4","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4461","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"QNC5U7N7YHMN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QNC5U7N7YHMNYHWD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QNC5U7N7","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QNC5U7N7YHMNYHWDUDWSMMZXNT","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4461","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-16T18:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"ca359c9f563205906c76fef62bc7fd8f5030aeb47cd54ce0e4080ffc050d4e82","abstract_canon_sha256":"fa46ed6fdcd9145726444d21caf29c766fa4f0be49ba36201f8adafbe9d0b0d5"},"schema_version":"1.0"},"canonical_sha256":"8345da7dbfc1d8dc1ec3a0ed2633376cf2cc85daf12f85c2521e3c39546dfa5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.995007Z","signature_b64":"2XP55wB8vYfzy8XJGlU1lbC1VYteBQg5GN6orpGd2Ym/OMMR6oJ98Vh2RCZvVDDMvQgHJtU22xQ6X/u5xR2dBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8345da7dbfc1d8dc1ec3a0ed2633376cf2cc85daf12f85c2521e3c39546dfa5b","last_reissued_at":"2026-05-18T03:00:48.994365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.994365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4461","source_version":4,"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-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/enXdTA1WgXi0unlh5EJ5bzNmI3D629WmX8YolakQ+GhqoewAFXvNcKg0MSXBvMButekpkEsZQr1eDtl1tKcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:27.022693Z"},"content_sha256":"5215dbf860c6d2b81d9e4afffff5b40f4fbed68fc733255fbb87b0d6d65ec807","schema_version":"1.0","event_id":"sha256:5215dbf860c6d2b81d9e4afffff5b40f4fbed68fc733255fbb87b0d6d65ec807"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QNC5U7N7YHMNYHWDUDWSMMZXNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Approximations for Conditional Feedforward Computation in Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrew Davis, Itamar Arel","submitted_at":"2013-12-16T18:58:34Z","abstract_excerpt":"Scalability properties of deep neural networks raise key research questions, particularly as the problems considered become larger and more challenging. This paper expands on the idea of conditional computation introduced by Bengio, et. al., where the nodes of a deep network are augmented by a set of gating units that determine when a node should be calculated. By factorizing the weight matrix into a low-rank approximation, an estimation of the sign of the pre-nonlinearity activation can be efficiently obtained. For networks using rectified-linear hidden units, this implies that the computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4461","kind":"arxiv","version":4},"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-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXttdvfS+6rf0vLQPdFm7LnJuS7WRqgHQdi30Enz474WdRTUELn9C/emdYHw/qO8AnUIlZSrvyDOn1SgrNmlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:27.023033Z"},"content_sha256":"6b4d3dcdd1cbd467dcbee3c0f58361d2e4ee556839d9ff0fc8f526e55488c0d9","schema_version":"1.0","event_id":"sha256:6b4d3dcdd1cbd467dcbee3c0f58361d2e4ee556839d9ff0fc8f526e55488c0d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT/bundle.json","state_url":"https://pith.science/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT/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-19T19:00:27Z","links":{"resolver":"https://pith.science/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT","bundle":"https://pith.science/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT/bundle.json","state":"https://pith.science/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNC5U7N7YHMNYHWDUDWSMMZXNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QNC5U7N7YHMNYHWDUDWSMMZXNT","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":"fa46ed6fdcd9145726444d21caf29c766fa4f0be49ba36201f8adafbe9d0b0d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-16T18:58:34Z","title_canon_sha256":"ca359c9f563205906c76fef62bc7fd8f5030aeb47cd54ce0e4080ffc050d4e82"},"schema_version":"1.0","source":{"id":"1312.4461","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4461","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4461v4","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4461","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"QNC5U7N7YHMN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QNC5U7N7YHMNYHWD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QNC5U7N7","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:6b4d3dcdd1cbd467dcbee3c0f58361d2e4ee556839d9ff0fc8f526e55488c0d9","target":"graph","created_at":"2026-05-18T03:00:48Z","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":"Scalability properties of deep neural networks raise key research questions, particularly as the problems considered become larger and more challenging. This paper expands on the idea of conditional computation introduced by Bengio, et. al., where the nodes of a deep network are augmented by a set of gating units that determine when a node should be calculated. By factorizing the weight matrix into a low-rank approximation, an estimation of the sign of the pre-nonlinearity activation can be efficiently obtained. For networks using rectified-linear hidden units, this implies that the computatio","authors_text":"Andrew Davis, Itamar Arel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-16T18:58:34Z","title":"Low-Rank Approximations for Conditional Feedforward Computation in Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4461","kind":"arxiv","version":4},"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:5215dbf860c6d2b81d9e4afffff5b40f4fbed68fc733255fbb87b0d6d65ec807","target":"record","created_at":"2026-05-18T03:00:48Z","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":"fa46ed6fdcd9145726444d21caf29c766fa4f0be49ba36201f8adafbe9d0b0d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-16T18:58:34Z","title_canon_sha256":"ca359c9f563205906c76fef62bc7fd8f5030aeb47cd54ce0e4080ffc050d4e82"},"schema_version":"1.0","source":{"id":"1312.4461","kind":"arxiv","version":4}},"canonical_sha256":"8345da7dbfc1d8dc1ec3a0ed2633376cf2cc85daf12f85c2521e3c39546dfa5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8345da7dbfc1d8dc1ec3a0ed2633376cf2cc85daf12f85c2521e3c39546dfa5b","first_computed_at":"2026-05-18T03:00:48.994365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:48.994365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2XP55wB8vYfzy8XJGlU1lbC1VYteBQg5GN6orpGd2Ym/OMMR6oJ98Vh2RCZvVDDMvQgHJtU22xQ6X/u5xR2dBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:48.995007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4461","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5215dbf860c6d2b81d9e4afffff5b40f4fbed68fc733255fbb87b0d6d65ec807","sha256:6b4d3dcdd1cbd467dcbee3c0f58361d2e4ee556839d9ff0fc8f526e55488c0d9"],"state_sha256":"7a724b6590753537b3975ff3725b63f3946095bb8cee657e4d430654ceb37b97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZV7vMwYYdJ5Ae421JvDBsmJavCgWhM8NxG8FPSD5gI8vyyIoSVreTJ6Dd+HQUckTxQSdwshVbzC3jZ/aXv5jAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:00:27.025021Z","bundle_sha256":"0ee4a51754f2de47851908312bfe31bd03d2f8c4a54813cad7d00b8be9c039c7"}}