{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OCKKMC3AFU7ZARXM6OSA2P65RS","short_pith_number":"pith:OCKKMC3A","canonical_record":{"source":{"id":"1905.09717","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-23T15:22:25Z","cross_cats_sorted":[],"title_canon_sha256":"9003c2eb66433d9ef55c8bf438e0921f793dc0a445ee224b8479ac9a4dea99c0","abstract_canon_sha256":"524f347a64c960204969a2159a7a6f5e3f715581dc91461c1aa50fe892e9ec90"},"schema_version":"1.0"},"canonical_sha256":"7094a60b602d3f9046ecf3a40d3fdd8c9e29ad791998f2cfb003b6f9765f3cd0","source":{"kind":"arxiv","id":"1905.09717","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09717","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09717v5","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09717","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"pith_short_12","alias_value":"OCKKMC3AFU7Z","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"pith_short_16","alias_value":"OCKKMC3AFU7ZARXM","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"pith_short_8","alias_value":"OCKKMC3A","created_at":"2026-07-05T00:12:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OCKKMC3AFU7ZARXM6OSA2P65RS","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09717","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-23T15:22:25Z","cross_cats_sorted":[],"title_canon_sha256":"9003c2eb66433d9ef55c8bf438e0921f793dc0a445ee224b8479ac9a4dea99c0","abstract_canon_sha256":"524f347a64c960204969a2159a7a6f5e3f715581dc91461c1aa50fe892e9ec90"},"schema_version":"1.0"},"canonical_sha256":"7094a60b602d3f9046ecf3a40d3fdd8c9e29ad791998f2cfb003b6f9765f3cd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:12:26.431744Z","signature_b64":"NLS13u/zO3rVFmgLuLkkUZIdaBm33AeCgoN/+MQFOor4O/3gwqy6znX574R5tUVJqDFRQ/1yytNMTePlospBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7094a60b602d3f9046ecf3a40d3fdd8c9e29ad791998f2cfb003b6f9765f3cd0","last_reissued_at":"2026-07-05T00:12:26.431356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:12:26.431356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09717","source_version":5,"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-05T00:12:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueXAPzrh1iBgRTEcZCy/zmQ5A/gAPR/NuvTgbNsxGt34O+0dIm91uSLCuk9ngVpN8d7oBXZO9uXe4i/rrnX/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:51:05.175265Z"},"content_sha256":"d0b27ad0c9567c5440ef71bc10be9093988017db44cae90b7688ad0a09823fc0","schema_version":"1.0","event_id":"sha256:d0b27ad0c9567c5440ef71bc10be9093988017db44cae90b7688ad0a09823fc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OCKKMC3AFU7ZARXM6OSA2P65RS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Pruning via Transformable Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Xuanyi Dong, Yi Yang","submitted_at":"2019-05-23T15:22:25Z","abstract_excerpt":"Network pruning reduces the computation costs of an over-parameterized network without performance damage. Prevailing pruning algorithms pre-define the width and depth of the pruned networks, and then transfer parameters from the unpruned network to pruned networks. To break the structure limitation of the pruned networks, we propose to apply neural architecture search to search directly for a network with flexible channel and layer sizes. The number of the channels/layers is learned by minimizing the loss of the pruned networks. The feature map of the pruned network is an aggregation of K fea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09717","kind":"arxiv","version":5},"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/1905.09717/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-05T00:12:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWsd3OR0ciWpzSo9F2Q4QA7HX1kKs3YfsYgqv6zTaMUdXbbhzUasnb7TrTPPJZa87kYGGXTbeX3gMhO85igVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:51:05.176196Z"},"content_sha256":"60e411d7201dbf008b0164de6971c725b12154aa4ddf4dfca1810a005f2dafa8","schema_version":"1.0","event_id":"sha256:60e411d7201dbf008b0164de6971c725b12154aa4ddf4dfca1810a005f2dafa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCKKMC3AFU7ZARXM6OSA2P65RS/bundle.json","state_url":"https://pith.science/pith/OCKKMC3AFU7ZARXM6OSA2P65RS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCKKMC3AFU7ZARXM6OSA2P65RS/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-16T16:51:05Z","links":{"resolver":"https://pith.science/pith/OCKKMC3AFU7ZARXM6OSA2P65RS","bundle":"https://pith.science/pith/OCKKMC3AFU7ZARXM6OSA2P65RS/bundle.json","state":"https://pith.science/pith/OCKKMC3AFU7ZARXM6OSA2P65RS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCKKMC3AFU7ZARXM6OSA2P65RS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OCKKMC3AFU7ZARXM6OSA2P65RS","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":"524f347a64c960204969a2159a7a6f5e3f715581dc91461c1aa50fe892e9ec90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-23T15:22:25Z","title_canon_sha256":"9003c2eb66433d9ef55c8bf438e0921f793dc0a445ee224b8479ac9a4dea99c0"},"schema_version":"1.0","source":{"id":"1905.09717","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09717","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09717v5","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09717","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"pith_short_12","alias_value":"OCKKMC3AFU7Z","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"pith_short_16","alias_value":"OCKKMC3AFU7ZARXM","created_at":"2026-07-05T00:12:26Z"},{"alias_kind":"pith_short_8","alias_value":"OCKKMC3A","created_at":"2026-07-05T00:12:26Z"}],"graph_snapshots":[{"event_id":"sha256:60e411d7201dbf008b0164de6971c725b12154aa4ddf4dfca1810a005f2dafa8","target":"graph","created_at":"2026-07-05T00:12:26Z","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/1905.09717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network pruning reduces the computation costs of an over-parameterized network without performance damage. Prevailing pruning algorithms pre-define the width and depth of the pruned networks, and then transfer parameters from the unpruned network to pruned networks. To break the structure limitation of the pruned networks, we propose to apply neural architecture search to search directly for a network with flexible channel and layer sizes. The number of the channels/layers is learned by minimizing the loss of the pruned networks. The feature map of the pruned network is an aggregation of K fea","authors_text":"Xuanyi Dong, Yi Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-23T15:22:25Z","title":"Network Pruning via Transformable Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09717","kind":"arxiv","version":5},"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:d0b27ad0c9567c5440ef71bc10be9093988017db44cae90b7688ad0a09823fc0","target":"record","created_at":"2026-07-05T00:12:26Z","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":"524f347a64c960204969a2159a7a6f5e3f715581dc91461c1aa50fe892e9ec90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-23T15:22:25Z","title_canon_sha256":"9003c2eb66433d9ef55c8bf438e0921f793dc0a445ee224b8479ac9a4dea99c0"},"schema_version":"1.0","source":{"id":"1905.09717","kind":"arxiv","version":5}},"canonical_sha256":"7094a60b602d3f9046ecf3a40d3fdd8c9e29ad791998f2cfb003b6f9765f3cd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7094a60b602d3f9046ecf3a40d3fdd8c9e29ad791998f2cfb003b6f9765f3cd0","first_computed_at":"2026-07-05T00:12:26.431356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:12:26.431356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLS13u/zO3rVFmgLuLkkUZIdaBm33AeCgoN/+MQFOor4O/3gwqy6znX574R5tUVJqDFRQ/1yytNMTePlospBBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:12:26.431744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09717","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b27ad0c9567c5440ef71bc10be9093988017db44cae90b7688ad0a09823fc0","sha256:60e411d7201dbf008b0164de6971c725b12154aa4ddf4dfca1810a005f2dafa8"],"state_sha256":"c52c70bd1aef291cc2d0791fc7778c49345af415245177ed1f75592cc559fe6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNeGrVJBjP3m0bpP33+rrtHmq/zWFcdiKEht6rZhG6GaJR2Pw6Cz4PZVeQsVRAbUFf/mODorIa+etxSNTs8CDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:51:05.231082Z","bundle_sha256":"a66aa673f8c6e540e85a5555217401b8288b291c780511d1cd4c9fa597942a5c"}}