{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IFUKNRB5GA4QNHMASZZMBJXI4O","short_pith_number":"pith:IFUKNRB5","canonical_record":{"source":{"id":"1408.3304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-14T14:47:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7891622de183677e3ecb2e7bd233add1a1d00b545136b1ab78d6e37174f9ede6","abstract_canon_sha256":"07522f8ab6c91772a240066854091c0412f03ae2f753da7a305dfbe09a2e1519"},"schema_version":"1.0"},"canonical_sha256":"4168a6c43d3039069d809672c0a6e8e385e7b3f1a4d83f5875cc409b36c273c6","source":{"kind":"arxiv","id":"1408.3304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3304","created_at":"2026-05-18T02:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3304v2","created_at":"2026-05-18T02:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3304","created_at":"2026-05-18T02:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"IFUKNRB5GA4Q","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFUKNRB5GA4QNHMA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFUKNRB5","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IFUKNRB5GA4QNHMASZZMBJXI4O","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-14T14:47:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7891622de183677e3ecb2e7bd233add1a1d00b545136b1ab78d6e37174f9ede6","abstract_canon_sha256":"07522f8ab6c91772a240066854091c0412f03ae2f753da7a305dfbe09a2e1519"},"schema_version":"1.0"},"canonical_sha256":"4168a6c43d3039069d809672c0a6e8e385e7b3f1a4d83f5875cc409b36c273c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:51.207364Z","signature_b64":"g7txSCqiKnSD29cq9KGiNlUWnZ5vw0wfxmDDYdFnIKSMoe7FYTOQzZae2uktzb7MrsMtpV8J0R/skUbReIZvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4168a6c43d3039069d809672c0a6e8e385e7b3f1a4d83f5875cc409b36c273c6","last_reissued_at":"2026-05-18T02:16:51.206816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:51.206816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3304","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:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioEl7EXIbHmc5k7UQCrEi7pWCXiCsDc2gfMpY+yJGiO0BO6otUfQglIhU7YWZbWHT/JB9yJySrALNPvzBBa/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:57:14.613181Z"},"content_sha256":"f11d2b3000b7aa540704c3755cfc820798de151782bba3168a4e91cb6260ca6c","schema_version":"1.0","event_id":"sha256:f11d2b3000b7aa540704c3755cfc820798de151782bba3168a4e91cb6260ca6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IFUKNRB5GA4QNHMASZZMBJXI4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Pairwise Costs for Network Flow Multi-Object Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Ivan Laptev, Josef Sivic, Simon Lacoste-Julien, Visesh Chari","submitted_at":"2014-08-14T14:47:01Z","abstract_excerpt":"Multi-object tracking has been recently approached with the min-cost network flow optimization techniques. Such methods simultaneously resolve multiple object tracks in a video and enable modeling of dependencies among tracks. Min-cost network flow methods also fit well within the \"tracking-by-detection\" paradigm where object trajectories are obtained by connecting per-frame outputs of an object detector. Object detectors, however, often fail due to occlusions and clutter in the video. To cope with such situations, we propose to add pairwise costs to the min-cost network flow framework. While "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3304","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:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WL1vTI4iRW7B42oHRs3roUkZZFYTICWFwGodive9JuZ5YOsa1VS9KmVimOBsmQ9dT0E20isik6nVAWcmnPwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:57:14.613547Z"},"content_sha256":"be56e7eedaf146511855a8a4397cf033291f3d043489c64c9baf1e9029582288","schema_version":"1.0","event_id":"sha256:be56e7eedaf146511855a8a4397cf033291f3d043489c64c9baf1e9029582288"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFUKNRB5GA4QNHMASZZMBJXI4O/bundle.json","state_url":"https://pith.science/pith/IFUKNRB5GA4QNHMASZZMBJXI4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFUKNRB5GA4QNHMASZZMBJXI4O/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-24T18:57:14Z","links":{"resolver":"https://pith.science/pith/IFUKNRB5GA4QNHMASZZMBJXI4O","bundle":"https://pith.science/pith/IFUKNRB5GA4QNHMASZZMBJXI4O/bundle.json","state":"https://pith.science/pith/IFUKNRB5GA4QNHMASZZMBJXI4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFUKNRB5GA4QNHMASZZMBJXI4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IFUKNRB5GA4QNHMASZZMBJXI4O","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":"07522f8ab6c91772a240066854091c0412f03ae2f753da7a305dfbe09a2e1519","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-14T14:47:01Z","title_canon_sha256":"7891622de183677e3ecb2e7bd233add1a1d00b545136b1ab78d6e37174f9ede6"},"schema_version":"1.0","source":{"id":"1408.3304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3304","created_at":"2026-05-18T02:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3304v2","created_at":"2026-05-18T02:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3304","created_at":"2026-05-18T02:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"IFUKNRB5GA4Q","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFUKNRB5GA4QNHMA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFUKNRB5","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:be56e7eedaf146511855a8a4397cf033291f3d043489c64c9baf1e9029582288","target":"graph","created_at":"2026-05-18T02:16:51Z","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":"Multi-object tracking has been recently approached with the min-cost network flow optimization techniques. Such methods simultaneously resolve multiple object tracks in a video and enable modeling of dependencies among tracks. Min-cost network flow methods also fit well within the \"tracking-by-detection\" paradigm where object trajectories are obtained by connecting per-frame outputs of an object detector. Object detectors, however, often fail due to occlusions and clutter in the video. To cope with such situations, we propose to add pairwise costs to the min-cost network flow framework. While ","authors_text":"Ivan Laptev, Josef Sivic, Simon Lacoste-Julien, Visesh Chari","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-14T14:47:01Z","title":"On Pairwise Costs for Network Flow Multi-Object Tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3304","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:f11d2b3000b7aa540704c3755cfc820798de151782bba3168a4e91cb6260ca6c","target":"record","created_at":"2026-05-18T02:16:51Z","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":"07522f8ab6c91772a240066854091c0412f03ae2f753da7a305dfbe09a2e1519","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-14T14:47:01Z","title_canon_sha256":"7891622de183677e3ecb2e7bd233add1a1d00b545136b1ab78d6e37174f9ede6"},"schema_version":"1.0","source":{"id":"1408.3304","kind":"arxiv","version":2}},"canonical_sha256":"4168a6c43d3039069d809672c0a6e8e385e7b3f1a4d83f5875cc409b36c273c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4168a6c43d3039069d809672c0a6e8e385e7b3f1a4d83f5875cc409b36c273c6","first_computed_at":"2026-05-18T02:16:51.206816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:51.206816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g7txSCqiKnSD29cq9KGiNlUWnZ5vw0wfxmDDYdFnIKSMoe7FYTOQzZae2uktzb7MrsMtpV8J0R/skUbReIZvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:51.207364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f11d2b3000b7aa540704c3755cfc820798de151782bba3168a4e91cb6260ca6c","sha256:be56e7eedaf146511855a8a4397cf033291f3d043489c64c9baf1e9029582288"],"state_sha256":"611abdc3ce3f43827604b08c2924b4c49d6c80b9f85cf031020912c50a4a7d56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xooRGiEB+ZUk2dO2/dWK7pB1xg03VZEXo2uzBOTnymvJfym+WDHqnzUjvgOQolTBAAr+V4FMW0ocuaF3Jp4iBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:57:14.615536Z","bundle_sha256":"c602c9ad0a814e02d7dd1f194019cea68542329756e4883d2e5d82a2788130c5"}}