{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GO7GLKL24Y3AGSVHWATKF5LHHL","short_pith_number":"pith:GO7GLKL2","schema_version":"1.0","canonical_sha256":"33be65a97ae636034aa7b026a2f5673ad8af0815dcf89a2956e91179568f3a20","source":{"kind":"arxiv","id":"2607.21368","version":1},"attestation_state":"computed","paper":{"title":"Incremental Optimal Assignment for Real-Time Crowd Tracking","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Ismail H. Toroslu","submitted_at":"2026-07-23T14:34:42Z","abstract_excerpt":"Multi-object tracking in dense crowds requires solving a bipartite assignment problem between detections and trajectories at every video frame. The classical Hungarian algorithm solves this in $O(N^3)$ time, which becomes a bottleneck for large scenes with hundreds of people. We propose an \\emph{incremental} assignment algorithm that exploits the block-sparse structure of crowd tracking cost matrices --- dense within each crowd cluster, near-zero between clusters. We compute the exact same optimal $N \\times N$ assignment as the Hungarian algorithm, but via an incremental strategy: we add one p"},"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":"2607.21368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-23T14:34:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dd32fa1b648dc3a9616fdeaaad613ef57667ed1779efd371eec2bbccfed24c5e","abstract_canon_sha256":"61baa5b8a877405b12352c5dd3762d8e36b17fe1d6c1770633fbdd5a2da18557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:24:28.768191Z","signature_b64":"kTLCl6v5DddfvbrwYE3AoFgqJXvNV4NrDGtw2h5lEQ2sws7ioNNu8pG7NhGzBlbcjrWQH47dRqOKn6qQxRYYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33be65a97ae636034aa7b026a2f5673ad8af0815dcf89a2956e91179568f3a20","last_reissued_at":"2026-07-24T01:24:28.767293Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:24:28.767293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Optimal Assignment for Real-Time Crowd Tracking","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Ismail H. Toroslu","submitted_at":"2026-07-23T14:34:42Z","abstract_excerpt":"Multi-object tracking in dense crowds requires solving a bipartite assignment problem between detections and trajectories at every video frame. The classical Hungarian algorithm solves this in $O(N^3)$ time, which becomes a bottleneck for large scenes with hundreds of people. We propose an \\emph{incremental} assignment algorithm that exploits the block-sparse structure of crowd tracking cost matrices --- dense within each crowd cluster, near-zero between clusters. We compute the exact same optimal $N \\times N$ assignment as the Hungarian algorithm, but via an incremental strategy: we add one p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21368","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.21368/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":"2607.21368","created_at":"2026-07-24T01:24:28.767772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.21368v1","created_at":"2026-07-24T01:24:28.767772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21368","created_at":"2026-07-24T01:24:28.767772+00:00"},{"alias_kind":"pith_short_12","alias_value":"GO7GLKL24Y3A","created_at":"2026-07-24T01:24:28.767772+00:00"},{"alias_kind":"pith_short_16","alias_value":"GO7GLKL24Y3AGSVH","created_at":"2026-07-24T01:24:28.767772+00:00"},{"alias_kind":"pith_short_8","alias_value":"GO7GLKL2","created_at":"2026-07-24T01:24:28.767772+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/GO7GLKL24Y3AGSVHWATKF5LHHL","json":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL.json","graph_json":"https://pith.science/api/pith-number/GO7GLKL24Y3AGSVHWATKF5LHHL/graph.json","events_json":"https://pith.science/api/pith-number/GO7GLKL24Y3AGSVHWATKF5LHHL/events.json","paper":"https://pith.science/paper/GO7GLKL2"},"agent_actions":{"view_html":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL","download_json":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL.json","view_paper":"https://pith.science/paper/GO7GLKL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.21368&json=true","fetch_graph":"https://pith.science/api/pith-number/GO7GLKL24Y3AGSVHWATKF5LHHL/graph.json","fetch_events":"https://pith.science/api/pith-number/GO7GLKL24Y3AGSVHWATKF5LHHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/action/storage_attestation","attest_author":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/action/author_attestation","sign_citation":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/action/citation_signature","submit_replication":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/action/replication_record"}},"created_at":"2026-07-24T01:24:28.767772+00:00","updated_at":"2026-07-24T01:24:28.767772+00:00"}