{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KSXJHIAPPEXBWBFWXBMRKT54NC","short_pith_number":"pith:KSXJHIAP","canonical_record":{"source":{"id":"1512.02413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-08T11:41:30Z","cross_cats_sorted":[],"title_canon_sha256":"901b59e8ab398c6a8578d50ec4ee95fd55d0938e176c36bc61274bcc091c7658","abstract_canon_sha256":"35b9bad591942cd27d45b3629c33d4db076fb54f8b6ecf5aa6e74dcbe5933402"},"schema_version":"1.0"},"canonical_sha256":"54ae93a00f792e1b04b6b859154fbc688d6f0f265f858392a5c30e43990d2918","source":{"kind":"arxiv","id":"1512.02413","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02413","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02413v3","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02413","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"KSXJHIAPPEXB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KSXJHIAPPEXBWBFW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KSXJHIAP","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KSXJHIAPPEXBWBFWXBMRKT54NC","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-08T11:41:30Z","cross_cats_sorted":[],"title_canon_sha256":"901b59e8ab398c6a8578d50ec4ee95fd55d0938e176c36bc61274bcc091c7658","abstract_canon_sha256":"35b9bad591942cd27d45b3629c33d4db076fb54f8b6ecf5aa6e74dcbe5933402"},"schema_version":"1.0"},"canonical_sha256":"54ae93a00f792e1b04b6b859154fbc688d6f0f265f858392a5c30e43990d2918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:36.286893Z","signature_b64":"ZOLrPTqneCvJLUQlxN+BEO2MQbuiKo7+GUH91f0If0WIoq3GFEflO6iuSnKXx1rYVaeHJgwbspXw4npONw2wBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ae93a00f792e1b04b6b859154fbc688d6f0f265f858392a5c30e43990d2918","last_reissued_at":"2026-05-18T01:09:36.286405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:36.286405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02413","source_version":3,"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-18T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mTqELjkko5yyAHaqPBb2ztBwpRY/0uLf8FlaWZXdtKsH0jOKgezzEz7I1oCiGO+BKWY4rCjteRFhuFy65GHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:35:00.812658Z"},"content_sha256":"3a3b1496a12788b0cdcae1839b56086a7c69974fbe61a63f8a343257b599dff1","schema_version":"1.0","event_id":"sha256:3a3b1496a12788b0cdcae1839b56086a7c69974fbe61a63f8a343257b599dff1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KSXJHIAPPEXBWBFWXBMRKT54NC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tracking Objects with Higher Order Interactions using Delayed Column Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Charless Fowlkes, Julian Yarkony, Shaofei Wang, Steffen Wolf","submitted_at":"2015-12-08T11:41:30Z","abstract_excerpt":"We study the problem of multi-target tracking and data association in video. We formulate this in terms of selecting a subset of high-quality tracks subject to the constraint that no pair of selected tracks is associated with a common detection (of an object). This objective is equivalent to the classic NP-hard problem of finding a maximum-weight set packing (MWSP) where tracks correspond to sets and is made further difficult since the number of candidate tracks grows exponentially in the number of detections. We present a relaxation of this combinatorial problem that uses a column generation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02413","kind":"arxiv","version":3},"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-18T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mF7lS91dnyp6GWlMcD/BaIvMZRbDtos6Y5K6XwEMvfQCxFcC6H4x/+ptAgWYQj/LxH3SoCEu9zIr4871hw27CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:35:00.813220Z"},"content_sha256":"23f7077d1fe76aff32ab44f66ac1f2732cc520c5025d4c01a9d0c8c31ba8f2db","schema_version":"1.0","event_id":"sha256:23f7077d1fe76aff32ab44f66ac1f2732cc520c5025d4c01a9d0c8c31ba8f2db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSXJHIAPPEXBWBFWXBMRKT54NC/bundle.json","state_url":"https://pith.science/pith/KSXJHIAPPEXBWBFWXBMRKT54NC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSXJHIAPPEXBWBFWXBMRKT54NC/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-05-26T10:35:00Z","links":{"resolver":"https://pith.science/pith/KSXJHIAPPEXBWBFWXBMRKT54NC","bundle":"https://pith.science/pith/KSXJHIAPPEXBWBFWXBMRKT54NC/bundle.json","state":"https://pith.science/pith/KSXJHIAPPEXBWBFWXBMRKT54NC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSXJHIAPPEXBWBFWXBMRKT54NC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KSXJHIAPPEXBWBFWXBMRKT54NC","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":"35b9bad591942cd27d45b3629c33d4db076fb54f8b6ecf5aa6e74dcbe5933402","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-08T11:41:30Z","title_canon_sha256":"901b59e8ab398c6a8578d50ec4ee95fd55d0938e176c36bc61274bcc091c7658"},"schema_version":"1.0","source":{"id":"1512.02413","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02413","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02413v3","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02413","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"KSXJHIAPPEXB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KSXJHIAPPEXBWBFW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KSXJHIAP","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:23f7077d1fe76aff32ab44f66ac1f2732cc520c5025d4c01a9d0c8c31ba8f2db","target":"graph","created_at":"2026-05-18T01:09:36Z","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":"We study the problem of multi-target tracking and data association in video. We formulate this in terms of selecting a subset of high-quality tracks subject to the constraint that no pair of selected tracks is associated with a common detection (of an object). This objective is equivalent to the classic NP-hard problem of finding a maximum-weight set packing (MWSP) where tracks correspond to sets and is made further difficult since the number of candidate tracks grows exponentially in the number of detections. We present a relaxation of this combinatorial problem that uses a column generation ","authors_text":"Charless Fowlkes, Julian Yarkony, Shaofei Wang, Steffen Wolf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-08T11:41:30Z","title":"Tracking Objects with Higher Order Interactions using Delayed Column Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02413","kind":"arxiv","version":3},"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:3a3b1496a12788b0cdcae1839b56086a7c69974fbe61a63f8a343257b599dff1","target":"record","created_at":"2026-05-18T01:09:36Z","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":"35b9bad591942cd27d45b3629c33d4db076fb54f8b6ecf5aa6e74dcbe5933402","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-08T11:41:30Z","title_canon_sha256":"901b59e8ab398c6a8578d50ec4ee95fd55d0938e176c36bc61274bcc091c7658"},"schema_version":"1.0","source":{"id":"1512.02413","kind":"arxiv","version":3}},"canonical_sha256":"54ae93a00f792e1b04b6b859154fbc688d6f0f265f858392a5c30e43990d2918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ae93a00f792e1b04b6b859154fbc688d6f0f265f858392a5c30e43990d2918","first_computed_at":"2026-05-18T01:09:36.286405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:36.286405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOLrPTqneCvJLUQlxN+BEO2MQbuiKo7+GUH91f0If0WIoq3GFEflO6iuSnKXx1rYVaeHJgwbspXw4npONw2wBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:36.286893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02413","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a3b1496a12788b0cdcae1839b56086a7c69974fbe61a63f8a343257b599dff1","sha256:23f7077d1fe76aff32ab44f66ac1f2732cc520c5025d4c01a9d0c8c31ba8f2db"],"state_sha256":"dabbe56721ff1ffa6cedbff010bd4877d201bc5994586b19d63371ee4cf5405f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5k8KAcWf/kPOZAdgBxC8IkL+qdaoUXGPexxdGP/m5FKbmvU6+lgsC86Rxu1sHv7nrAeN6nn0j3qBA2Ocq5lzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:35:00.816787Z","bundle_sha256":"ee1b313790cd6a87d5327cb03695d8c7835c1571943d6c524960b480f768eaf0"}}