{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XCPBHFZF7O4OZLHMGPC3JMDMVX","short_pith_number":"pith:XCPBHFZF","canonical_record":{"source":{"id":"1709.06030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T16:26:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7bc99e9619e05d0dab3a3e1a44aea8d62f2a8e6234962814729b416d2d4f777b","abstract_canon_sha256":"c4067bc3f7fb58e19bc031ac6a0ef7cf4f3db73aafe9250c91cbf0df96cdeb52"},"schema_version":"1.0"},"canonical_sha256":"b89e139725fbb8ecacec33c5b4b06cadfdf5d959ffa705b7f18f953bb2b0de8c","source":{"kind":"arxiv","id":"1709.06030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06030","created_at":"2026-05-18T00:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06030v2","created_at":"2026-05-18T00:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06030","created_at":"2026-05-18T00:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"XCPBHFZF7O4O","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XCPBHFZF7O4OZLHM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XCPBHFZF","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XCPBHFZF7O4OZLHMGPC3JMDMVX","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T16:26:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7bc99e9619e05d0dab3a3e1a44aea8d62f2a8e6234962814729b416d2d4f777b","abstract_canon_sha256":"c4067bc3f7fb58e19bc031ac6a0ef7cf4f3db73aafe9250c91cbf0df96cdeb52"},"schema_version":"1.0"},"canonical_sha256":"b89e139725fbb8ecacec33c5b4b06cadfdf5d959ffa705b7f18f953bb2b0de8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:52.211692Z","signature_b64":"r8GOa7uK9wqEALSaU8rwEImRtXHFNrTIMYp3iQLgRBJlLa5D5yJcwhNBgAR4AGVKEm8JBBeF6lh/8cyxPTwjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89e139725fbb8ecacec33c5b4b06cadfdf5d959ffa705b7f18f953bb2b0de8c","last_reissued_at":"2026-05-18T00:27:52.210968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:52.210968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06030","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-18T00:27:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWl7sjkKB2hD9v3l06kpd1vYyUkfQvDz/qWhLElgn4ETG1B4xNzGDprCwqprSopChfZv4+nZ5rZO99BzZeYtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:01:57.198770Z"},"content_sha256":"cc5960217689d38eed40301663387615b0db705e0cffca05549ec1a09e66f2ba","schema_version":"1.0","event_id":"sha256:cc5960217689d38eed40301663387615b0db705e0cffca05549ec1a09e66f2ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XCPBHFZF7O4OZLHMGPC3JMDMVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"N2N Learning: Network to Network Compression via Policy Gradient Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anubhav Ashok, Fares Beainy, Kris M. Kitani, Nicholas Rhinehart","submitted_at":"2017-09-18T16:26:53Z","abstract_excerpt":"While bigger and deeper neural network architectures continue to advance the state-of-the-art for many computer vision tasks, real-world adoption of these networks is impeded by hardware and speed constraints. Conventional model compression methods attempt to address this problem by modifying the architecture manually or using pre-defined heuristics. Since the space of all reduced architectures is very large, modifying the architecture of a deep neural network in this way is a difficult task. In this paper, we tackle this issue by introducing a principled method for learning reduced network ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06030","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-18T00:27:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vutLLyYH3/hRK+Dd3CxNkNwSI4nKqm+yXHHlA3AND73NPE5w4IruRjVo6C7nhjnLDyXqt31EXDelR9Dsc6U3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:01:57.199119Z"},"content_sha256":"13c7e8b1723c5d46377890c8493823c84f4d710a022a1a6138b88824ab8cabfe","schema_version":"1.0","event_id":"sha256:13c7e8b1723c5d46377890c8493823c84f4d710a022a1a6138b88824ab8cabfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/bundle.json","state_url":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/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-06-24T07:01:57Z","links":{"resolver":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX","bundle":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/bundle.json","state":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XCPBHFZF7O4OZLHMGPC3JMDMVX","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":"c4067bc3f7fb58e19bc031ac6a0ef7cf4f3db73aafe9250c91cbf0df96cdeb52","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T16:26:53Z","title_canon_sha256":"7bc99e9619e05d0dab3a3e1a44aea8d62f2a8e6234962814729b416d2d4f777b"},"schema_version":"1.0","source":{"id":"1709.06030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06030","created_at":"2026-05-18T00:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06030v2","created_at":"2026-05-18T00:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06030","created_at":"2026-05-18T00:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"XCPBHFZF7O4O","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XCPBHFZF7O4OZLHM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XCPBHFZF","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:13c7e8b1723c5d46377890c8493823c84f4d710a022a1a6138b88824ab8cabfe","target":"graph","created_at":"2026-05-18T00:27:52Z","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":"While bigger and deeper neural network architectures continue to advance the state-of-the-art for many computer vision tasks, real-world adoption of these networks is impeded by hardware and speed constraints. Conventional model compression methods attempt to address this problem by modifying the architecture manually or using pre-defined heuristics. Since the space of all reduced architectures is very large, modifying the architecture of a deep neural network in this way is a difficult task. In this paper, we tackle this issue by introducing a principled method for learning reduced network ar","authors_text":"Anubhav Ashok, Fares Beainy, Kris M. Kitani, Nicholas Rhinehart","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T16:26:53Z","title":"N2N Learning: Network to Network Compression via Policy Gradient Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06030","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:cc5960217689d38eed40301663387615b0db705e0cffca05549ec1a09e66f2ba","target":"record","created_at":"2026-05-18T00:27:52Z","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":"c4067bc3f7fb58e19bc031ac6a0ef7cf4f3db73aafe9250c91cbf0df96cdeb52","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T16:26:53Z","title_canon_sha256":"7bc99e9619e05d0dab3a3e1a44aea8d62f2a8e6234962814729b416d2d4f777b"},"schema_version":"1.0","source":{"id":"1709.06030","kind":"arxiv","version":2}},"canonical_sha256":"b89e139725fbb8ecacec33c5b4b06cadfdf5d959ffa705b7f18f953bb2b0de8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89e139725fbb8ecacec33c5b4b06cadfdf5d959ffa705b7f18f953bb2b0de8c","first_computed_at":"2026-05-18T00:27:52.210968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:52.210968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r8GOa7uK9wqEALSaU8rwEImRtXHFNrTIMYp3iQLgRBJlLa5D5yJcwhNBgAR4AGVKEm8JBBeF6lh/8cyxPTwjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:52.211692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc5960217689d38eed40301663387615b0db705e0cffca05549ec1a09e66f2ba","sha256:13c7e8b1723c5d46377890c8493823c84f4d710a022a1a6138b88824ab8cabfe"],"state_sha256":"2375074337729b1e5074f15d43f3603e64ded5a88b67ad0d83364ba83efa6e19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h53utCuhBIjfKh0kSeeoHzFH3JJM1Th2KpvhhmCiC1V5ySXUBoVsUH1fe4xz5g73PqSnbrxhnULbO0e8RmeZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:01:57.201050Z","bundle_sha256":"4e52bc822fa65228bd9c6f8ee1989f0af013ce3a42dbace1835ff468d3b09558"}}