{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:24D6DSZNG6XROR52S5PNKHCQ4C","short_pith_number":"pith:24D6DSZN","schema_version":"1.0","canonical_sha256":"d707e1cb2d37af1747ba975ed51c50e0a2a7861555f12b99059bbfd1b23dcced","source":{"kind":"arxiv","id":"1709.03572","version":2},"attestation_state":"computed","paper":{"title":"Real-Time Multiple Object Tracking - A Study on the Importance of Speed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Samuel Murray","submitted_at":"2017-09-11T20:16:22Z","abstract_excerpt":"In this project, we implement a multiple object tracker, following the tracking-by-detection paradigm, as an extension of an existing method. It works by modelling the movement of objects by solving the filtering problem, and associating detections with predicted new locations in new frames using the Hungarian algorithm. Three different similarity measures are used, which use the location and shape of the bounding boxes. Compared to other trackers on the MOTChallenge leaderboard, our method, referred to as C++SORT, is the fastest non-anonymous submission, while also achieving decent score on o"},"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":"1709.03572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-11T20:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"cac9e9cd9402b9fcba53729638e5139ac1b97fd89fb73d03ed2936d988f7dc32","abstract_canon_sha256":"48aee35e79bcf4c0a2df5968afb82ea085125998356123fa97e15e81a5db3c0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:58.446168Z","signature_b64":"QlFiFGqmXXBq/2Go21qwAWtrr2ckuWXmQoeDilWzK80F9vj5kp9hQwNnP8fweQliTg54B2o0IbUGjALoJGSXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d707e1cb2d37af1747ba975ed51c50e0a2a7861555f12b99059bbfd1b23dcced","last_reissued_at":"2026-05-18T00:33:58.445523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:58.445523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-Time Multiple Object Tracking - A Study on the Importance of Speed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Samuel Murray","submitted_at":"2017-09-11T20:16:22Z","abstract_excerpt":"In this project, we implement a multiple object tracker, following the tracking-by-detection paradigm, as an extension of an existing method. It works by modelling the movement of objects by solving the filtering problem, and associating detections with predicted new locations in new frames using the Hungarian algorithm. Three different similarity measures are used, which use the location and shape of the bounding boxes. Compared to other trackers on the MOTChallenge leaderboard, our method, referred to as C++SORT, is the fastest non-anonymous submission, while also achieving decent score on o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03572","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":"1709.03572","created_at":"2026-05-18T00:33:58.445608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03572v2","created_at":"2026-05-18T00:33:58.445608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03572","created_at":"2026-05-18T00:33:58.445608+00:00"},{"alias_kind":"pith_short_12","alias_value":"24D6DSZNG6XR","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"24D6DSZNG6XROR52","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"24D6DSZN","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10313","citing_title":"DensePeds: Pedestrian Tracking in Dense Crowds Using Front-RVO and Sparse Features","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C","json":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C.json","graph_json":"https://pith.science/api/pith-number/24D6DSZNG6XROR52S5PNKHCQ4C/graph.json","events_json":"https://pith.science/api/pith-number/24D6DSZNG6XROR52S5PNKHCQ4C/events.json","paper":"https://pith.science/paper/24D6DSZN"},"agent_actions":{"view_html":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C","download_json":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C.json","view_paper":"https://pith.science/paper/24D6DSZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03572&json=true","fetch_graph":"https://pith.science/api/pith-number/24D6DSZNG6XROR52S5PNKHCQ4C/graph.json","fetch_events":"https://pith.science/api/pith-number/24D6DSZNG6XROR52S5PNKHCQ4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C/action/storage_attestation","attest_author":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C/action/author_attestation","sign_citation":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C/action/citation_signature","submit_replication":"https://pith.science/pith/24D6DSZNG6XROR52S5PNKHCQ4C/action/replication_record"}},"created_at":"2026-05-18T00:33:58.445608+00:00","updated_at":"2026-05-18T00:33:58.445608+00:00"}