{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:54S6BK2COJZ7XW2NWOVI5YRYWM","short_pith_number":"pith:54S6BK2C","schema_version":"1.0","canonical_sha256":"ef25e0ab427273fbdb4db3aa8ee238b324336478d5091d8f43dea31b35ef23fc","source":{"kind":"arxiv","id":"1407.6251","version":2},"attestation_state":"computed","paper":{"title":"FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andreas Geiger, Philip Lenz, Raquel Urtasun","submitted_at":"2014-07-23T15:07:12Z","abstract_excerpt":"One of the most popular approaches to multi-target tracking is tracking-by-detection. Current min-cost flow algorithms which solve the data association problem optimally have three main drawbacks: they are computationally expensive, they assume that the whole video is given as a batch, and they scale badly in memory and computation with the length of the video sequence. In this paper, we address each of these issues, resulting in a computationally and memory-bounded solution. First, we introduce a dynamic version of the successive shortest-path algorithm which solves the data association probl"},"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":"1407.6251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-23T15:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"2f29ec342b106a93f646fd69e3dd0d90f26ed35e71fd75ee99785d0f3cc37d95","abstract_canon_sha256":"fbe0253e1ba82cd61934e8ae055e67907637fa93567579db85f15aa44c6e5aba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:31.806285Z","signature_b64":"933GNicTfP5DG4W413R7oHj2HBsN0FGrP8Hn7SIvGsdg17TjJYSVNBpIApIIx/97Se33qEyunUk63Qjykv0bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef25e0ab427273fbdb4db3aa8ee238b324336478d5091d8f43dea31b35ef23fc","last_reissued_at":"2026-05-18T02:30:31.805721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:31.805721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andreas Geiger, Philip Lenz, Raquel Urtasun","submitted_at":"2014-07-23T15:07:12Z","abstract_excerpt":"One of the most popular approaches to multi-target tracking is tracking-by-detection. Current min-cost flow algorithms which solve the data association problem optimally have three main drawbacks: they are computationally expensive, they assume that the whole video is given as a batch, and they scale badly in memory and computation with the length of the video sequence. In this paper, we address each of these issues, resulting in a computationally and memory-bounded solution. First, we introduce a dynamic version of the successive shortest-path algorithm which solves the data association probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6251","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":"1407.6251","created_at":"2026-05-18T02:30:31.805815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6251v2","created_at":"2026-05-18T02:30:31.805815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6251","created_at":"2026-05-18T02:30:31.805815+00:00"},{"alias_kind":"pith_short_12","alias_value":"54S6BK2COJZ7","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"54S6BK2COJZ7XW2N","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"54S6BK2C","created_at":"2026-05-18T12:28:14.216126+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/54S6BK2COJZ7XW2NWOVI5YRYWM","json":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM.json","graph_json":"https://pith.science/api/pith-number/54S6BK2COJZ7XW2NWOVI5YRYWM/graph.json","events_json":"https://pith.science/api/pith-number/54S6BK2COJZ7XW2NWOVI5YRYWM/events.json","paper":"https://pith.science/paper/54S6BK2C"},"agent_actions":{"view_html":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM","download_json":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM.json","view_paper":"https://pith.science/paper/54S6BK2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6251&json=true","fetch_graph":"https://pith.science/api/pith-number/54S6BK2COJZ7XW2NWOVI5YRYWM/graph.json","fetch_events":"https://pith.science/api/pith-number/54S6BK2COJZ7XW2NWOVI5YRYWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/action/storage_attestation","attest_author":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/action/author_attestation","sign_citation":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/action/citation_signature","submit_replication":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/action/replication_record"}},"created_at":"2026-05-18T02:30:31.805815+00:00","updated_at":"2026-05-18T02:30:31.805815+00:00"}