{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:54S6BK2COJZ7XW2NWOVI5YRYWM","short_pith_number":"pith:54S6BK2C","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"},"canonical_sha256":"ef25e0ab427273fbdb4db3aa8ee238b324336478d5091d8f43dea31b35ef23fc","source":{"kind":"arxiv","id":"1407.6251","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6251","created_at":"2026-05-18T02:30:31Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6251v2","created_at":"2026-05-18T02:30:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6251","created_at":"2026-05-18T02:30:31Z"},{"alias_kind":"pith_short_12","alias_value":"54S6BK2COJZ7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"54S6BK2COJZ7XW2N","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"54S6BK2C","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:54S6BK2COJZ7XW2NWOVI5YRYWM","target":"record","payload":{"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"},"canonical_sha256":"ef25e0ab427273fbdb4db3aa8ee238b324336478d5091d8f43dea31b35ef23fc","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"},"source_kind":"arxiv","source_id":"1407.6251","source_version":2,"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-05-18T02:30:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jumjra5YjLkGROj1AST1skiS1bO+opXme70mQuQmMwFK/VxwFPqQmVsuzMo5WGO3JmtxZOzIEhpf1TW6DL6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:00:53.721193Z"},"content_sha256":"5f908c39eda5fb244c46003d291acd3866c68a5a896f25062dfb8dfeb0165f72","schema_version":"1.0","event_id":"sha256:5f908c39eda5fb244c46003d291acd3866c68a5a896f25062dfb8dfeb0165f72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:54S6BK2COJZ7XW2NWOVI5YRYWM","target":"graph","payload":{"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"},"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-05-18T02:30:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eEeDZZV+ElVh626L4zinCUm8q3+vquQgQMPw4hjfUkuAKBPUuQSX8uMSKrtaRHCDtBKp1I3fbj5Et4VVsUfsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:00:53.721644Z"},"content_sha256":"8815cbc66bf0c40f502bb0762a5626f8148682b30d26979fb4b9cb04c0a65b4b","schema_version":"1.0","event_id":"sha256:8815cbc66bf0c40f502bb0762a5626f8148682b30d26979fb4b9cb04c0a65b4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/bundle.json","state_url":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/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-06-07T05:00:53Z","links":{"resolver":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM","bundle":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/bundle.json","state":"https://pith.science/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54S6BK2COJZ7XW2NWOVI5YRYWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:54S6BK2COJZ7XW2NWOVI5YRYWM","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":"fbe0253e1ba82cd61934e8ae055e67907637fa93567579db85f15aa44c6e5aba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-23T15:07:12Z","title_canon_sha256":"2f29ec342b106a93f646fd69e3dd0d90f26ed35e71fd75ee99785d0f3cc37d95"},"schema_version":"1.0","source":{"id":"1407.6251","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6251","created_at":"2026-05-18T02:30:31Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6251v2","created_at":"2026-05-18T02:30:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6251","created_at":"2026-05-18T02:30:31Z"},{"alias_kind":"pith_short_12","alias_value":"54S6BK2COJZ7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"54S6BK2COJZ7XW2N","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"54S6BK2C","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:8815cbc66bf0c40f502bb0762a5626f8148682b30d26979fb4b9cb04c0a65b4b","target":"graph","created_at":"2026-05-18T02:30:31Z","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"},"paper":{"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","authors_text":"Andreas Geiger, Philip Lenz, Raquel Urtasun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-23T15:07:12Z","title":"FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6251","kind":"arxiv","version":2},"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:5f908c39eda5fb244c46003d291acd3866c68a5a896f25062dfb8dfeb0165f72","target":"record","created_at":"2026-05-18T02:30:31Z","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":"fbe0253e1ba82cd61934e8ae055e67907637fa93567579db85f15aa44c6e5aba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-23T15:07:12Z","title_canon_sha256":"2f29ec342b106a93f646fd69e3dd0d90f26ed35e71fd75ee99785d0f3cc37d95"},"schema_version":"1.0","source":{"id":"1407.6251","kind":"arxiv","version":2}},"canonical_sha256":"ef25e0ab427273fbdb4db3aa8ee238b324336478d5091d8f43dea31b35ef23fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef25e0ab427273fbdb4db3aa8ee238b324336478d5091d8f43dea31b35ef23fc","first_computed_at":"2026-05-18T02:30:31.805721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:31.805721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"933GNicTfP5DG4W413R7oHj2HBsN0FGrP8Hn7SIvGsdg17TjJYSVNBpIApIIx/97Se33qEyunUk63Qjykv0bCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:31.806285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6251","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f908c39eda5fb244c46003d291acd3866c68a5a896f25062dfb8dfeb0165f72","sha256:8815cbc66bf0c40f502bb0762a5626f8148682b30d26979fb4b9cb04c0a65b4b"],"state_sha256":"5fbde18cec2bcf2ab943cc5a6b1a21f7be7e63529df154abda2f2a715b9d04e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xI/TxOF/J9Odf4p/xk0YTDaZg4DMrE873Fgbqj7MjzrKuVUQMHVQnYe/o+aMLfjQGcDix5jcHd+8W2IN+v5mCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:00:53.724548Z","bundle_sha256":"25a8be1653be764d25cf0ee9416bbe381bdd01367fb25e9ee4359477ada32d39"}}