{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4YKKFIZ7SYVAHFPWAHINE6IRAD","short_pith_number":"pith:4YKKFIZ7","schema_version":"1.0","canonical_sha256":"e614a2a33f962a0395f601d0d2791100c1216698b72dd60083c639d098013c6d","source":{"kind":"arxiv","id":"2401.06197","version":1},"attestation_state":"computed","paper":{"title":"Efficient Deformable ConvNets: Rethinking Dynamic and Sparse Operator for Vision Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Feng Wang, Hongsheng Li, Jiapeng Luo, Jie Zhou, Jifeng Dai, Lewei Lu, Tong Lu, Wenhai Wang, Xizhou Zhu, Yuntao Chen, Yu Qiao, Yuwen Xiong, Zhiqi Li","submitted_at":"2024-01-11T14:53:24Z","abstract_excerpt":"We introduce Deformable Convolution v4 (DCNv4), a highly efficient and effective operator designed for a broad spectrum of vision applications. DCNv4 addresses the limitations of its predecessor, DCNv3, with two key enhancements: 1. removing softmax normalization in spatial aggregation to enhance its dynamic property and expressive power and 2. optimizing memory access to minimize redundant operations for speedup. These improvements result in a significantly faster convergence compared to DCNv3 and a substantial increase in processing speed, with DCNv4 achieving more than three times the forwa"},"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":"2401.06197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-01-11T14:53:24Z","cross_cats_sorted":[],"title_canon_sha256":"0b99d84fa06db3ba05fe3c4c1302e57d33fc80fe71b0542c65e04536d4b0abf5","abstract_canon_sha256":"e4012101f8d343492ce5e28e47ca02895693e1831e3bb0cb334852d1fd31c83f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:47.112453Z","signature_b64":"0X45yMbe0s66bqJ1+dbMT9waDZPoIzRWtrORrr9z+Qbpw1ZjD1h8MvI5pzW8ZgcjsLbcKMiuHYuvAl7Ohk5BDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e614a2a33f962a0395f601d0d2791100c1216698b72dd60083c639d098013c6d","last_reissued_at":"2026-07-05T07:32:47.111820Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:47.111820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Deformable ConvNets: Rethinking Dynamic and Sparse Operator for Vision Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Feng Wang, Hongsheng Li, Jiapeng Luo, Jie Zhou, Jifeng Dai, Lewei Lu, Tong Lu, Wenhai Wang, Xizhou Zhu, Yuntao Chen, Yu Qiao, Yuwen Xiong, Zhiqi Li","submitted_at":"2024-01-11T14:53:24Z","abstract_excerpt":"We introduce Deformable Convolution v4 (DCNv4), a highly efficient and effective operator designed for a broad spectrum of vision applications. DCNv4 addresses the limitations of its predecessor, DCNv3, with two key enhancements: 1. removing softmax normalization in spatial aggregation to enhance its dynamic property and expressive power and 2. optimizing memory access to minimize redundant operations for speedup. These improvements result in a significantly faster convergence compared to DCNv3 and a substantial increase in processing speed, with DCNv4 achieving more than three times the forwa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06197","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.06197/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.06197","created_at":"2026-07-05T07:32:47.111931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.06197v1","created_at":"2026-07-05T07:32:47.111931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06197","created_at":"2026-07-05T07:32:47.111931+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YKKFIZ7SYVA","created_at":"2026-07-05T07:32:47.111931+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YKKFIZ7SYVAHFPW","created_at":"2026-07-05T07:32:47.111931+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YKKFIZ7","created_at":"2026-07-05T07:32:47.111931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20608","citing_title":"Conformable Convolution for Topologically Aware Learning of Complex Anatomical Structures","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD","json":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD.json","graph_json":"https://pith.science/api/pith-number/4YKKFIZ7SYVAHFPWAHINE6IRAD/graph.json","events_json":"https://pith.science/api/pith-number/4YKKFIZ7SYVAHFPWAHINE6IRAD/events.json","paper":"https://pith.science/paper/4YKKFIZ7"},"agent_actions":{"view_html":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD","download_json":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD.json","view_paper":"https://pith.science/paper/4YKKFIZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.06197&json=true","fetch_graph":"https://pith.science/api/pith-number/4YKKFIZ7SYVAHFPWAHINE6IRAD/graph.json","fetch_events":"https://pith.science/api/pith-number/4YKKFIZ7SYVAHFPWAHINE6IRAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD/action/storage_attestation","attest_author":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD/action/author_attestation","sign_citation":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD/action/citation_signature","submit_replication":"https://pith.science/pith/4YKKFIZ7SYVAHFPWAHINE6IRAD/action/replication_record"}},"created_at":"2026-07-05T07:32:47.111931+00:00","updated_at":"2026-07-05T07:32:47.111931+00:00"}