{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SMT7UMOJMYL3ZJQUTQJ63KW7TC","short_pith_number":"pith:SMT7UMOJ","schema_version":"1.0","canonical_sha256":"9327fa31c96617bca6149c13edaadf9892bce15728155dde68d45fffae243ef5","source":{"kind":"arxiv","id":"1411.7935","version":2},"attestation_state":"computed","paper":{"title":"Multiple object tracking with context awareness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Laura Leal-Taix\\'e","submitted_at":"2014-11-24T09:24:24Z","abstract_excerpt":"Multiple people tracking is a key problem for many applications such as surveillance, animation or car navigation, and a key input for tasks such as activity recognition. In crowded environments occlusions and false detections are common, and although there have been substantial advances in recent years, tracking is still a challenging task. Tracking is typically divided into two steps: detection, i.e., locating the pedestrians in the image, and data association, i.e., linking detections across frames to form complete trajectories.\n  For the data association task, approaches typically aim at d"},"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":"1411.7935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-24T09:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"81cd6a06eced707fd7adc42ce537d4131e15e3d285b92020696131c4d2471590","abstract_canon_sha256":"ca30101cbaef1ac8cb1351deea754d1a6cec04a184b21e1f31d0728661bca887"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:12.611598Z","signature_b64":"mRatIMEs0Ow+JWgIVGWQoPhH/lxRQfbmzcDYhDaApK3XcioMGbOdRfNGW02DFG78O4lPT6L5auEHJ4d1Vy7DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9327fa31c96617bca6149c13edaadf9892bce15728155dde68d45fffae243ef5","last_reissued_at":"2026-05-18T00:56:12.610883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:12.610883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple object tracking with context awareness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Laura Leal-Taix\\'e","submitted_at":"2014-11-24T09:24:24Z","abstract_excerpt":"Multiple people tracking is a key problem for many applications such as surveillance, animation or car navigation, and a key input for tasks such as activity recognition. In crowded environments occlusions and false detections are common, and although there have been substantial advances in recent years, tracking is still a challenging task. Tracking is typically divided into two steps: detection, i.e., locating the pedestrians in the image, and data association, i.e., linking detections across frames to form complete trajectories.\n  For the data association task, approaches typically aim at d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7935","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":"1411.7935","created_at":"2026-05-18T00:56:12.611001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7935v2","created_at":"2026-05-18T00:56:12.611001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7935","created_at":"2026-05-18T00:56:12.611001+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMT7UMOJMYL3","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMT7UMOJMYL3ZJQU","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMT7UMOJ","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13131","citing_title":"ERPPO: Entropy Regularization-based Proximal Policy Optimization","ref_index":213,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC","json":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC.json","graph_json":"https://pith.science/api/pith-number/SMT7UMOJMYL3ZJQUTQJ63KW7TC/graph.json","events_json":"https://pith.science/api/pith-number/SMT7UMOJMYL3ZJQUTQJ63KW7TC/events.json","paper":"https://pith.science/paper/SMT7UMOJ"},"agent_actions":{"view_html":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC","download_json":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC.json","view_paper":"https://pith.science/paper/SMT7UMOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7935&json=true","fetch_graph":"https://pith.science/api/pith-number/SMT7UMOJMYL3ZJQUTQJ63KW7TC/graph.json","fetch_events":"https://pith.science/api/pith-number/SMT7UMOJMYL3ZJQUTQJ63KW7TC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC/action/storage_attestation","attest_author":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC/action/author_attestation","sign_citation":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC/action/citation_signature","submit_replication":"https://pith.science/pith/SMT7UMOJMYL3ZJQUTQJ63KW7TC/action/replication_record"}},"created_at":"2026-05-18T00:56:12.611001+00:00","updated_at":"2026-05-18T00:56:12.611001+00:00"}