{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4DT2EF5MZ2ZOLY6727PKVOXWJN","short_pith_number":"pith:4DT2EF5M","schema_version":"1.0","canonical_sha256":"e0e7a217acceb2e5e3dfd7deaabaf64b787cae3dda58bf00e0c834d7293d3623","source":{"kind":"arxiv","id":"2104.11487","version":1},"attestation_state":"computed","paper":{"title":"Skip-Convolutions for Efficient Video Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Amirhossein Habibian, Babak Ehteshami Bejnordi, Davide Abati, Taco S. Cohen","submitted_at":"2021-04-23T09:10:39Z","abstract_excerpt":"We propose Skip-Convolutions to leverage the large amount of redundancies in video streams and save computations. Each video is represented as a series of changes across frames and network activations, denoted as residuals. We reformulate standard convolution to be efficiently computed on residual frames: each layer is coupled with a binary gate deciding whether a residual is important to the model prediction,~\\eg foreground regions, or it can be safely skipped, e.g. background regions. These gates can either be implemented as an efficient network trained jointly with convolution kernels, or c"},"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":"2104.11487","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-04-23T09:10:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c2089fd03a634aa1e70dcf070b0477840ab9a8f9b7e7967f4202e4509d58724b","abstract_canon_sha256":"df46bdcf98547b4c5ad62aa76fc88f75bab6653855aab4bd414537f9466be04c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:32.483968Z","signature_b64":"gP/oTmpcFmD19VQpNrdrpf4mcNBnyNTb6hf8d9fqPgBbMa7+7mz6uQp5lgI+ttNEsHZp+cCl/nQ7iGCGJ/XcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e7a217acceb2e5e3dfd7deaabaf64b787cae3dda58bf00e0c834d7293d3623","last_reissued_at":"2026-07-05T02:34:32.483437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:32.483437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skip-Convolutions for Efficient Video Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Amirhossein Habibian, Babak Ehteshami Bejnordi, Davide Abati, Taco S. Cohen","submitted_at":"2021-04-23T09:10:39Z","abstract_excerpt":"We propose Skip-Convolutions to leverage the large amount of redundancies in video streams and save computations. Each video is represented as a series of changes across frames and network activations, denoted as residuals. We reformulate standard convolution to be efficiently computed on residual frames: each layer is coupled with a binary gate deciding whether a residual is important to the model prediction,~\\eg foreground regions, or it can be safely skipped, e.g. background regions. These gates can either be implemented as an efficient network trained jointly with convolution kernels, or c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.11487","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/2104.11487/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":"2104.11487","created_at":"2026-07-05T02:34:32.483497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.11487v1","created_at":"2026-07-05T02:34:32.483497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.11487","created_at":"2026-07-05T02:34:32.483497+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DT2EF5MZ2ZO","created_at":"2026-07-05T02:34:32.483497+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DT2EF5MZ2ZOLY67","created_at":"2026-07-05T02:34:32.483497+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DT2EF5M","created_at":"2026-07-05T02:34:32.483497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15628","citing_title":"A Survey on Efficiency Optimization Techniques for DNN-based Video Analytics: Process Systems, Algorithms, and Applications","ref_index":85,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN","json":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN.json","graph_json":"https://pith.science/api/pith-number/4DT2EF5MZ2ZOLY6727PKVOXWJN/graph.json","events_json":"https://pith.science/api/pith-number/4DT2EF5MZ2ZOLY6727PKVOXWJN/events.json","paper":"https://pith.science/paper/4DT2EF5M"},"agent_actions":{"view_html":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN","download_json":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN.json","view_paper":"https://pith.science/paper/4DT2EF5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.11487&json=true","fetch_graph":"https://pith.science/api/pith-number/4DT2EF5MZ2ZOLY6727PKVOXWJN/graph.json","fetch_events":"https://pith.science/api/pith-number/4DT2EF5MZ2ZOLY6727PKVOXWJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN/action/storage_attestation","attest_author":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN/action/author_attestation","sign_citation":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN/action/citation_signature","submit_replication":"https://pith.science/pith/4DT2EF5MZ2ZOLY6727PKVOXWJN/action/replication_record"}},"created_at":"2026-07-05T02:34:32.483497+00:00","updated_at":"2026-07-05T02:34:32.483497+00:00"}