{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ILCICRZTFPFMVAC2ASCRJNB5C3","short_pith_number":"pith:ILCICRZT","schema_version":"1.0","canonical_sha256":"42c48147332bcaca805a048514b43d16db4864f2e451acac64dab8ff3154ccfb","source":{"kind":"arxiv","id":"2010.07548","version":2},"attestation_state":"computed","paper":{"title":"MOTChallenge: A Benchmark for Single-Camera Multiple Target Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Aljo\\v{s}a O\\v{s}ep, Anton Milan, Daniel Cremers, Ian Reid, Konrad Schindler, Laura Leal-Taix\\'e, Patrick Dendorfer, Stefan Roth","submitted_at":"2020-10-15T06:52:16Z","abstract_excerpt":"Standardized benchmarks have been crucial in pushing the performance of computer vision algorithms, especially since the advent of deep learning. Although leaderboards should not be over-claimed, they often provide the most objective measure of performance and are therefore important guides for research. We present MOTChallenge, a benchmark for single-camera Multiple Object Tracking (MOT) launched in late 2014, to collect existing and new data, and create a framework for the standardized evaluation of multiple object tracking methods. The benchmark is focused on multiple people tracking, since"},"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":"2010.07548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-10-15T06:52:16Z","cross_cats_sorted":[],"title_canon_sha256":"86ae30298f2633a716554603cd7a513bc90022afcb11433c30ba95ed5cc79e04","abstract_canon_sha256":"21045fd8f8d41652c53fa0fd5d56a95169c89f5ef3c9a7e24936c9627bebcdec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:56.061101Z","signature_b64":"P+HnSWjQOd7ys+/kYX4pVUlMeMjnHWNFEKQcxMmiYRL0qz41FrpqPYAIVbXco6G8PQd55b3ldW96k2GtpDCADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42c48147332bcaca805a048514b43d16db4864f2e451acac64dab8ff3154ccfb","last_reissued_at":"2026-07-05T01:57:56.060652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:56.060652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MOTChallenge: A Benchmark for Single-Camera Multiple Target Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Aljo\\v{s}a O\\v{s}ep, Anton Milan, Daniel Cremers, Ian Reid, Konrad Schindler, Laura Leal-Taix\\'e, Patrick Dendorfer, Stefan Roth","submitted_at":"2020-10-15T06:52:16Z","abstract_excerpt":"Standardized benchmarks have been crucial in pushing the performance of computer vision algorithms, especially since the advent of deep learning. Although leaderboards should not be over-claimed, they often provide the most objective measure of performance and are therefore important guides for research. We present MOTChallenge, a benchmark for single-camera Multiple Object Tracking (MOT) launched in late 2014, to collect existing and new data, and create a framework for the standardized evaluation of multiple object tracking methods. The benchmark is focused on multiple people tracking, since"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07548","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.07548/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.07548","created_at":"2026-07-05T01:57:56.060715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.07548v2","created_at":"2026-07-05T01:57:56.060715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07548","created_at":"2026-07-05T01:57:56.060715+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILCICRZTFPFM","created_at":"2026-07-05T01:57:56.060715+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILCICRZTFPFMVAC2","created_at":"2026-07-05T01:57:56.060715+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILCICRZT","created_at":"2026-07-05T01:57:56.060715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.02111","citing_title":"NOOUGAT: Towards Unified Online and Offline Multi-Object Tracking","ref_index":75,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3","json":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3.json","graph_json":"https://pith.science/api/pith-number/ILCICRZTFPFMVAC2ASCRJNB5C3/graph.json","events_json":"https://pith.science/api/pith-number/ILCICRZTFPFMVAC2ASCRJNB5C3/events.json","paper":"https://pith.science/paper/ILCICRZT"},"agent_actions":{"view_html":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3","download_json":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3.json","view_paper":"https://pith.science/paper/ILCICRZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.07548&json=true","fetch_graph":"https://pith.science/api/pith-number/ILCICRZTFPFMVAC2ASCRJNB5C3/graph.json","fetch_events":"https://pith.science/api/pith-number/ILCICRZTFPFMVAC2ASCRJNB5C3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3/action/storage_attestation","attest_author":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3/action/author_attestation","sign_citation":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3/action/citation_signature","submit_replication":"https://pith.science/pith/ILCICRZTFPFMVAC2ASCRJNB5C3/action/replication_record"}},"created_at":"2026-07-05T01:57:56.060715+00:00","updated_at":"2026-07-05T01:57:56.060715+00:00"}