{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GO7GLKL24Y3AGSVHWATKF5LHHL","short_pith_number":"pith:GO7GLKL2","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"},"canonical_sha256":"33be65a97ae636034aa7b026a2f5673ad8af0815dcf89a2956e91179568f3a20","source":{"kind":"arxiv","id":"2607.21368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21368","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21368v1","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21368","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"GO7GLKL24Y3A","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"pith_short_16","alias_value":"GO7GLKL24Y3AGSVH","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"pith_short_8","alias_value":"GO7GLKL2","created_at":"2026-07-24T01:24:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GO7GLKL24Y3AGSVHWATKF5LHHL","target":"record","payload":{"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"},"canonical_sha256":"33be65a97ae636034aa7b026a2f5673ad8af0815dcf89a2956e91179568f3a20","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"},"source_kind":"arxiv","source_id":"2607.21368","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-24T01:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kEx9is2F45ZurVEmHcPTetWa5n47CZbXdI6xUHxv0KvThsvzdzQPhR443frESZq8QQyph/qjYJHRMeH5PpmBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:42:58.175227Z"},"content_sha256":"80ed8e585b42c6469e9fc78d244d40e2f8dc05ce12232052d4c3dfa79fdb42af","schema_version":"1.0","event_id":"sha256:80ed8e585b42c6469e9fc78d244d40e2f8dc05ce12232052d4c3dfa79fdb42af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GO7GLKL24Y3AGSVHWATKF5LHHL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-24T01:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfAtbh7YvuPbZJqOmfS6Cjcm8vdZ7mJ/Dt6gpFA03GgJ3WzDfE1UqQuvoByoZJ4syYVmtLTY1exqOFbjDDzVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:42:58.175744Z"},"content_sha256":"256294f7fcf3a304c80b22a6c5465556132c7c50e3b21de64a28fc6419bf73d4","schema_version":"1.0","event_id":"sha256:256294f7fcf3a304c80b22a6c5465556132c7c50e3b21de64a28fc6419bf73d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/bundle.json","state_url":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T03:42:58Z","links":{"resolver":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL","bundle":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/bundle.json","state":"https://pith.science/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GO7GLKL24Y3AGSVHWATKF5LHHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GO7GLKL24Y3AGSVHWATKF5LHHL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"61baa5b8a877405b12352c5dd3762d8e36b17fe1d6c1770633fbdd5a2da18557","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-23T14:34:42Z","title_canon_sha256":"dd32fa1b648dc3a9616fdeaaad613ef57667ed1779efd371eec2bbccfed24c5e"},"schema_version":"1.0","source":{"id":"2607.21368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21368","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21368v1","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21368","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"GO7GLKL24Y3A","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"pith_short_16","alias_value":"GO7GLKL24Y3AGSVH","created_at":"2026-07-24T01:24:28Z"},{"alias_kind":"pith_short_8","alias_value":"GO7GLKL2","created_at":"2026-07-24T01:24:28Z"}],"graph_snapshots":[{"event_id":"sha256:256294f7fcf3a304c80b22a6c5465556132c7c50e3b21de64a28fc6419bf73d4","target":"graph","created_at":"2026-07-24T01:24:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.21368/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ismail H. Toroslu","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-23T14:34:42Z","title":"Incremental Optimal Assignment for Real-Time Crowd Tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21368","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:80ed8e585b42c6469e9fc78d244d40e2f8dc05ce12232052d4c3dfa79fdb42af","target":"record","created_at":"2026-07-24T01:24:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"61baa5b8a877405b12352c5dd3762d8e36b17fe1d6c1770633fbdd5a2da18557","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-23T14:34:42Z","title_canon_sha256":"dd32fa1b648dc3a9616fdeaaad613ef57667ed1779efd371eec2bbccfed24c5e"},"schema_version":"1.0","source":{"id":"2607.21368","kind":"arxiv","version":1}},"canonical_sha256":"33be65a97ae636034aa7b026a2f5673ad8af0815dcf89a2956e91179568f3a20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33be65a97ae636034aa7b026a2f5673ad8af0815dcf89a2956e91179568f3a20","first_computed_at":"2026-07-24T01:24:28.767293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T01:24:28.767293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kTLCl6v5DddfvbrwYE3AoFgqJXvNV4NrDGtw2h5lEQ2sws7ioNNu8pG7NhGzBlbcjrWQH47dRqOKn6qQxRYYAQ==","signature_status":"signed_v1","signed_at":"2026-07-24T01:24:28.768191Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.21368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80ed8e585b42c6469e9fc78d244d40e2f8dc05ce12232052d4c3dfa79fdb42af","sha256:256294f7fcf3a304c80b22a6c5465556132c7c50e3b21de64a28fc6419bf73d4"],"state_sha256":"fd623d257e330e17f7fde6a78bd9785878a4345dad93faab6434e9cddf616177"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ta1sFu14jSH61nPnGfeB//o6Q3GJ2/JEQ5rH11plzRPoakJEvNs/uXELEWWj5wnn6iYtZY6U6T9C6E78vTYCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T03:42:58.179685Z","bundle_sha256":"da48e1e910985e452ba7cb9e3a961b0323d3518ccdff578583474f0f44cf0912"}}