{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AKCXTISJ2PUZ76UDK2UGHTWYV3","short_pith_number":"pith:AKCXTISJ","schema_version":"1.0","canonical_sha256":"028579a249d3e99ffa8356a863ced8aef9e036fafc783cb9dc5597841c733751","source":{"kind":"arxiv","id":"1712.01059","version":1},"attestation_state":"computed","paper":{"title":"SOT for MOT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chi Zhang, Gang Yu, Jianan Wu, Qizheng He","submitted_at":"2017-12-04T13:22:31Z","abstract_excerpt":"In this paper we present a robust tracker to solve the multiple object tracking (MOT) problem, under the framework of tracking-by-detection. As the first contribution, we innovatively combine single object tracking (SOT) algorithms with multiple object tracking algorithms, and our results show that SOT is a general way to strongly reduce the number of false negatives, regardless of the quality of detection. Another contribution is that we show with a deep learning based appearance model, it is easy to associate detections of the same object efficiently and also with high accuracy. This appeara"},"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":"1712.01059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-04T13:22:31Z","cross_cats_sorted":[],"title_canon_sha256":"3ca4b38566b2f2c9c231614e3826033e3d09ed8e6680e1a9d201fb67052beb79","abstract_canon_sha256":"3f4983d227fd99dc53e863e5c46d6d4a8b16ca698a1f33f69bb22618bc4fd98f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:59.633287Z","signature_b64":"PzZozP9zMoxVjRzoQOnut/aHOL3TSS2Ap8oV0/OVelr9cfuGl4l/tvvbKcuRx9d7NtQ45LMXh82wmz8sxVspAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028579a249d3e99ffa8356a863ced8aef9e036fafc783cb9dc5597841c733751","last_reissued_at":"2026-05-18T00:28:59.632764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:59.632764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOT for MOT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chi Zhang, Gang Yu, Jianan Wu, Qizheng He","submitted_at":"2017-12-04T13:22:31Z","abstract_excerpt":"In this paper we present a robust tracker to solve the multiple object tracking (MOT) problem, under the framework of tracking-by-detection. As the first contribution, we innovatively combine single object tracking (SOT) algorithms with multiple object tracking algorithms, and our results show that SOT is a general way to strongly reduce the number of false negatives, regardless of the quality of detection. Another contribution is that we show with a deep learning based appearance model, it is easy to associate detections of the same object efficiently and also with high accuracy. This appeara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01059","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":"1712.01059","created_at":"2026-05-18T00:28:59.632833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01059v1","created_at":"2026-05-18T00:28:59.632833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01059","created_at":"2026-05-18T00:28:59.632833+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKCXTISJ2PUZ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKCXTISJ2PUZ76UD","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKCXTISJ","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05315","citing_title":"Graph Neural Based End-to-end Data Association Framework for Online Multiple-Object Tracking","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3","json":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3.json","graph_json":"https://pith.science/api/pith-number/AKCXTISJ2PUZ76UDK2UGHTWYV3/graph.json","events_json":"https://pith.science/api/pith-number/AKCXTISJ2PUZ76UDK2UGHTWYV3/events.json","paper":"https://pith.science/paper/AKCXTISJ"},"agent_actions":{"view_html":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3","download_json":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3.json","view_paper":"https://pith.science/paper/AKCXTISJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01059&json=true","fetch_graph":"https://pith.science/api/pith-number/AKCXTISJ2PUZ76UDK2UGHTWYV3/graph.json","fetch_events":"https://pith.science/api/pith-number/AKCXTISJ2PUZ76UDK2UGHTWYV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3/action/storage_attestation","attest_author":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3/action/author_attestation","sign_citation":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3/action/citation_signature","submit_replication":"https://pith.science/pith/AKCXTISJ2PUZ76UDK2UGHTWYV3/action/replication_record"}},"created_at":"2026-05-18T00:28:59.632833+00:00","updated_at":"2026-05-18T00:28:59.632833+00:00"}