{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZJLPRONG36RDGOC7IKL3YCXNWF","short_pith_number":"pith:ZJLPRONG","schema_version":"1.0","canonical_sha256":"ca56f8b9a6dfa233385f4297bc0aedb176e8a21a12a89dbcd5e7394d6a6adb1b","source":{"kind":"arxiv","id":"1811.08589","version":1},"attestation_state":"computed","paper":{"title":"Graph-Adaptive Pruning for Efficient Inference of Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jun Yang, Mengdi Wang, Qing Zhang, Wei Lin, Xiaoyuan Cui","submitted_at":"2018-11-21T03:43:38Z","abstract_excerpt":"In this work, we propose a graph-adaptive pruning (GAP) method for efficient inference of convolutional neural networks (CNNs). In this method, the network is viewed as a computational graph, in which the vertices denote the computation nodes and edges represent the information flow. Through topology analysis, GAP is capable of adapting to different network structures, especially the widely used cross connections and multi-path data flow in recent novel convolutional models. The models can be adaptively pruned at vertex-level as well as edge-level without any post-processing, thus GAP can dire"},"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":"1811.08589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-21T03:43:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ee387c62553126a635fd863f7e9ea9cf7333cd0ef3c626584c8003b710eed25b","abstract_canon_sha256":"69021b658d10eb99dd4cffebfeab0bc678eba97754d86e72b41e2d66881077f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.149030Z","signature_b64":"q8WZm5VUMB5nN48E6a2TR9lBevhdCny8/jbhKvIKBkDAZSKke9nF28ActdeWj9J995Tx8aiu2PfBXaO5eczmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca56f8b9a6dfa233385f4297bc0aedb176e8a21a12a89dbcd5e7394d6a6adb1b","last_reissued_at":"2026-05-18T00:00:12.148362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.148362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Adaptive Pruning for Efficient Inference of Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jun Yang, Mengdi Wang, Qing Zhang, Wei Lin, Xiaoyuan Cui","submitted_at":"2018-11-21T03:43:38Z","abstract_excerpt":"In this work, we propose a graph-adaptive pruning (GAP) method for efficient inference of convolutional neural networks (CNNs). In this method, the network is viewed as a computational graph, in which the vertices denote the computation nodes and edges represent the information flow. Through topology analysis, GAP is capable of adapting to different network structures, especially the widely used cross connections and multi-path data flow in recent novel convolutional models. The models can be adaptively pruned at vertex-level as well as edge-level without any post-processing, thus GAP can dire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08589","kind":"arxiv","version":1},"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":"1811.08589","created_at":"2026-05-18T00:00:12.148482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08589v1","created_at":"2026-05-18T00:00:12.148482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08589","created_at":"2026-05-18T00:00:12.148482+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJLPRONG36RD","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJLPRONG36RDGOC7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJLPRONG","created_at":"2026-05-18T12:33:07.085635+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/ZJLPRONG36RDGOC7IKL3YCXNWF","json":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF.json","graph_json":"https://pith.science/api/pith-number/ZJLPRONG36RDGOC7IKL3YCXNWF/graph.json","events_json":"https://pith.science/api/pith-number/ZJLPRONG36RDGOC7IKL3YCXNWF/events.json","paper":"https://pith.science/paper/ZJLPRONG"},"agent_actions":{"view_html":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF","download_json":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF.json","view_paper":"https://pith.science/paper/ZJLPRONG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08589&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJLPRONG36RDGOC7IKL3YCXNWF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJLPRONG36RDGOC7IKL3YCXNWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF/action/storage_attestation","attest_author":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF/action/author_attestation","sign_citation":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF/action/citation_signature","submit_replication":"https://pith.science/pith/ZJLPRONG36RDGOC7IKL3YCXNWF/action/replication_record"}},"created_at":"2026-05-18T00:00:12.148482+00:00","updated_at":"2026-05-18T00:00:12.148482+00:00"}