{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XCPBHFZF7O4OZLHMGPC3JMDMVX","short_pith_number":"pith:XCPBHFZF","schema_version":"1.0","canonical_sha256":"b89e139725fbb8ecacec33c5b4b06cadfdf5d959ffa705b7f18f953bb2b0de8c","source":{"kind":"arxiv","id":"1709.06030","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.06030","created_at":"2026-05-18T00:27:52.211108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06030v2","created_at":"2026-05-18T00:27:52.211108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06030","created_at":"2026-05-18T00:27:52.211108+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCPBHFZF7O4O","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCPBHFZF7O4OZLHM","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCPBHFZF","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX","json":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX.json","graph_json":"https://pith.science/api/pith-number/XCPBHFZF7O4OZLHMGPC3JMDMVX/graph.json","events_json":"https://pith.science/api/pith-number/XCPBHFZF7O4OZLHMGPC3JMDMVX/events.json","paper":"https://pith.science/paper/XCPBHFZF"},"agent_actions":{"view_html":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX","download_json":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX.json","view_paper":"https://pith.science/paper/XCPBHFZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06030&json=true","fetch_graph":"https://pith.science/api/pith-number/XCPBHFZF7O4OZLHMGPC3JMDMVX/graph.json","fetch_events":"https://pith.science/api/pith-number/XCPBHFZF7O4OZLHMGPC3JMDMVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/action/storage_attestation","attest_author":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/action/author_attestation","sign_citation":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/action/citation_signature","submit_replication":"https://pith.science/pith/XCPBHFZF7O4OZLHMGPC3JMDMVX/action/replication_record"}},"created_at":"2026-05-18T00:27:52.211108+00:00","updated_at":"2026-05-18T00:27:52.211108+00:00"}