{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WEEDQWDP36HQ2X6JTIVREZ7YF4","short_pith_number":"pith:WEEDQWDP","schema_version":"1.0","canonical_sha256":"b10838586fdf8f0d5fc99a2b1267f82f18cae3e3b7f882f523036b70131d80fb","source":{"kind":"arxiv","id":"1902.10640","version":1},"attestation_state":"computed","paper":{"title":"Efficient Video Classification Using Fewer Frames","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mitesh M. Khapra, Mukundhan Srinivasan, Shweta Bhardwaj","submitted_at":"2019-02-27T17:13:17Z","abstract_excerpt":"Recently,there has been a lot of interest in building compact models for video classification which have a small memory footprint (<1 GB). While these models are compact, they typically operate by repeated application of a small weight matrix to all the frames in a video. E.g. recurrent neural network based methods compute a hidden state for every frame of the video using a recurrent weight matrix. Similarly, cluster-and-aggregate based methods such as NetVLAD, have a learnable clustering matrix which is used to assign soft-clusters to every frame in the video. Since these models look at every"},"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":"1902.10640","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-02-27T17:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"00b35cc88540e2e4b61d9fe3442e329b9ed9a1ecdb2555e0e3cb18856346f0b3","abstract_canon_sha256":"ac458d87c6161cb73f36af898a43768720e6141e522a71e5f469f09a3d487872"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:30.340964Z","signature_b64":"RzdAgwJxpmD+1mAnZi811Mxnw8TfIj36Ij21a0JIhQ1ZowLlHYofH09IUfAWafU6F+kSgPgVmMvEPcH8AKFyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b10838586fdf8f0d5fc99a2b1267f82f18cae3e3b7f882f523036b70131d80fb","last_reissued_at":"2026-05-17T23:52:30.340439Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:30.340439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Video Classification Using Fewer Frames","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mitesh M. Khapra, Mukundhan Srinivasan, Shweta Bhardwaj","submitted_at":"2019-02-27T17:13:17Z","abstract_excerpt":"Recently,there has been a lot of interest in building compact models for video classification which have a small memory footprint (<1 GB). While these models are compact, they typically operate by repeated application of a small weight matrix to all the frames in a video. E.g. recurrent neural network based methods compute a hidden state for every frame of the video using a recurrent weight matrix. Similarly, cluster-and-aggregate based methods such as NetVLAD, have a learnable clustering matrix which is used to assign soft-clusters to every frame in the video. Since these models look at every"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10640","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":"1902.10640","created_at":"2026-05-17T23:52:30.340523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10640v1","created_at":"2026-05-17T23:52:30.340523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10640","created_at":"2026-05-17T23:52:30.340523+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEEDQWDP36HQ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEEDQWDP36HQ2X6J","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEEDQWDP","created_at":"2026-05-18T12:33:30.264802+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/WEEDQWDP36HQ2X6JTIVREZ7YF4","json":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4.json","graph_json":"https://pith.science/api/pith-number/WEEDQWDP36HQ2X6JTIVREZ7YF4/graph.json","events_json":"https://pith.science/api/pith-number/WEEDQWDP36HQ2X6JTIVREZ7YF4/events.json","paper":"https://pith.science/paper/WEEDQWDP"},"agent_actions":{"view_html":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4","download_json":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4.json","view_paper":"https://pith.science/paper/WEEDQWDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10640&json=true","fetch_graph":"https://pith.science/api/pith-number/WEEDQWDP36HQ2X6JTIVREZ7YF4/graph.json","fetch_events":"https://pith.science/api/pith-number/WEEDQWDP36HQ2X6JTIVREZ7YF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4/action/storage_attestation","attest_author":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4/action/author_attestation","sign_citation":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4/action/citation_signature","submit_replication":"https://pith.science/pith/WEEDQWDP36HQ2X6JTIVREZ7YF4/action/replication_record"}},"created_at":"2026-05-17T23:52:30.340523+00:00","updated_at":"2026-05-17T23:52:30.340523+00:00"}