{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2KTYWYDTA2QNGE5NJAIMARRYRI","short_pith_number":"pith:2KTYWYDT","schema_version":"1.0","canonical_sha256":"d2a78b607306a0d313ad4810c046388a23b00b32ea4faaa1b4cccc2b7c553008","source":{"kind":"arxiv","id":"1811.02208","version":1},"attestation_state":"computed","paper":{"title":"DSNet: Deep and Shallow Feature Learning for Efficient Visual Tracking","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanzi Wang, Qiangqiang Wu, Yanjie Liang, Yan Yan, Yi Liu","submitted_at":"2018-11-06T07:55:42Z","abstract_excerpt":"In recent years, Discriminative Correlation Filter (DCF) based tracking methods have achieved great success in visual tracking. However, the multi-resolution convolutional feature maps trained from other tasks like image classification, cannot be naturally used in the conventional DCF formulation. Furthermore, these high-dimensional feature maps significantly increase the tracking complexity and thus limit the tracking speed. In this paper, we present a deep and shallow feature learning network, namely DSNet, to learn the multi-level same-resolution compressed (MSC) features for efficient onli"},"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.02208","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-11-06T07:55:42Z","cross_cats_sorted":[],"title_canon_sha256":"6af1204c8d0d5313400c2f09f08f7132411ec8ce8d4efe8ab5f39b3fb0c9bf38","abstract_canon_sha256":"f98b52ce9096b17b26295a735c2ad74995d224fd2d439830faca5ec089a66b75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.825328Z","signature_b64":"2ifT5I8ZTHWRqzMILxGMzoKwWmExwjbMFah4jc9eI3o2r+ThtS74Vg8M/joRYIxXy/Wvmi3IrShC5dnSCiYGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2a78b607306a0d313ad4810c046388a23b00b32ea4faaa1b4cccc2b7c553008","last_reissued_at":"2026-05-18T00:01:24.824896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.824896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DSNet: Deep and Shallow Feature Learning for Efficient Visual Tracking","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanzi Wang, Qiangqiang Wu, Yanjie Liang, Yan Yan, Yi Liu","submitted_at":"2018-11-06T07:55:42Z","abstract_excerpt":"In recent years, Discriminative Correlation Filter (DCF) based tracking methods have achieved great success in visual tracking. However, the multi-resolution convolutional feature maps trained from other tasks like image classification, cannot be naturally used in the conventional DCF formulation. Furthermore, these high-dimensional feature maps significantly increase the tracking complexity and thus limit the tracking speed. In this paper, we present a deep and shallow feature learning network, namely DSNet, to learn the multi-level same-resolution compressed (MSC) features for efficient onli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02208","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.02208","created_at":"2026-05-18T00:01:24.824953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02208v1","created_at":"2026-05-18T00:01:24.824953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02208","created_at":"2026-05-18T00:01:24.824953+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KTYWYDTA2QN","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KTYWYDTA2QNGE5N","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KTYWYDT","created_at":"2026-05-18T12:32:02.567920+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/2KTYWYDTA2QNGE5NJAIMARRYRI","json":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI.json","graph_json":"https://pith.science/api/pith-number/2KTYWYDTA2QNGE5NJAIMARRYRI/graph.json","events_json":"https://pith.science/api/pith-number/2KTYWYDTA2QNGE5NJAIMARRYRI/events.json","paper":"https://pith.science/paper/2KTYWYDT"},"agent_actions":{"view_html":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI","download_json":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI.json","view_paper":"https://pith.science/paper/2KTYWYDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02208&json=true","fetch_graph":"https://pith.science/api/pith-number/2KTYWYDTA2QNGE5NJAIMARRYRI/graph.json","fetch_events":"https://pith.science/api/pith-number/2KTYWYDTA2QNGE5NJAIMARRYRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI/action/storage_attestation","attest_author":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI/action/author_attestation","sign_citation":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI/action/citation_signature","submit_replication":"https://pith.science/pith/2KTYWYDTA2QNGE5NJAIMARRYRI/action/replication_record"}},"created_at":"2026-05-18T00:01:24.824953+00:00","updated_at":"2026-05-18T00:01:24.824953+00:00"}