{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UCNE3AF43TQXFJNPMBSGWRZ5FF","short_pith_number":"pith:UCNE3AF4","schema_version":"1.0","canonical_sha256":"a09a4d80bcdce172a5af60646b473d297368578d3dfd55d16fee480264760359","source":{"kind":"arxiv","id":"1611.09224","version":2},"attestation_state":"computed","paper":{"title":"ECO: Efficient Convolution Operators for Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fahad Shahbaz Khan, Goutam Bhat, Martin Danelljan, Michael Felsberg","submitted_at":"2016-11-28T16:26:27Z","abstract_excerpt":"In recent years, Discriminative Correlation Filter (DCF) based methods have significantly advanced the state-of-the-art in tracking. However, in the pursuit of ever increasing tracking performance, their characteristic speed and real-time capability have gradually faded. Further, the increasingly complex models, with massive number of trainable parameters, have introduced the risk of severe over-fitting. In this work, we tackle the key causes behind the problems of computational complexity and over-fitting, with the aim of simultaneously improving both speed and performance.\n  We revisit the 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":"1611.09224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-28T16:26:27Z","cross_cats_sorted":[],"title_canon_sha256":"abe111ac578fcf3aa383848e721bb5a5ab38964a24e6a82a659038886db8471c","abstract_canon_sha256":"855a1bd5f75bcd24bf082658907ca55e0b09725e3dbd0225e90af997e7d52577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:38.762894Z","signature_b64":"V4xjzzT6pW80KZ3NQSJqDX+0jgKnD/ujXjnZUKxliPKOxQDvC23mfRk4nkAvBft5C/sEIUzqA3mwfmgdBFJ7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09a4d80bcdce172a5af60646b473d297368578d3dfd55d16fee480264760359","last_reissued_at":"2026-05-18T00:46:38.762333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:38.762333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ECO: Efficient Convolution Operators for Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fahad Shahbaz Khan, Goutam Bhat, Martin Danelljan, Michael Felsberg","submitted_at":"2016-11-28T16:26:27Z","abstract_excerpt":"In recent years, Discriminative Correlation Filter (DCF) based methods have significantly advanced the state-of-the-art in tracking. However, in the pursuit of ever increasing tracking performance, their characteristic speed and real-time capability have gradually faded. Further, the increasingly complex models, with massive number of trainable parameters, have introduced the risk of severe over-fitting. In this work, we tackle the key causes behind the problems of computational complexity and over-fitting, with the aim of simultaneously improving both speed and performance.\n  We revisit the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09224","kind":"arxiv","version":2},"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":"1611.09224","created_at":"2026-05-18T00:46:38.762432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09224v2","created_at":"2026-05-18T00:46:38.762432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09224","created_at":"2026-05-18T00:46:38.762432+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCNE3AF43TQX","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCNE3AF43TQXFJNP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCNE3AF4","created_at":"2026-05-18T12:30:46.583412+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/UCNE3AF43TQXFJNPMBSGWRZ5FF","json":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF.json","graph_json":"https://pith.science/api/pith-number/UCNE3AF43TQXFJNPMBSGWRZ5FF/graph.json","events_json":"https://pith.science/api/pith-number/UCNE3AF43TQXFJNPMBSGWRZ5FF/events.json","paper":"https://pith.science/paper/UCNE3AF4"},"agent_actions":{"view_html":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF","download_json":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF.json","view_paper":"https://pith.science/paper/UCNE3AF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09224&json=true","fetch_graph":"https://pith.science/api/pith-number/UCNE3AF43TQXFJNPMBSGWRZ5FF/graph.json","fetch_events":"https://pith.science/api/pith-number/UCNE3AF43TQXFJNPMBSGWRZ5FF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF/action/storage_attestation","attest_author":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF/action/author_attestation","sign_citation":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF/action/citation_signature","submit_replication":"https://pith.science/pith/UCNE3AF43TQXFJNPMBSGWRZ5FF/action/replication_record"}},"created_at":"2026-05-18T00:46:38.762432+00:00","updated_at":"2026-05-18T00:46:38.762432+00:00"}