{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:E5VFKVFGCKTT6ZVB5DU6E4IPJT","short_pith_number":"pith:E5VFKVFG","canonical_record":{"source":{"id":"2006.14550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-25T16:49:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"05938fe30b250810cc3a7a5ec4284829031f6716271b96c297c29acf02373ee3","abstract_canon_sha256":"6746dd9c51ee3b84e09769062624aea5d491cff6eae05441be75a3a5cf5271c9"},"schema_version":"1.0"},"canonical_sha256":"276a5554a612a73f66a1e8e9e2710f4ce7b5c6ce101b23f2519fd081ec70c5a4","source":{"kind":"arxiv","id":"2006.14550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14550","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14550v1","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14550","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"E5VFKVFGCKTT","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"pith_short_16","alias_value":"E5VFKVFGCKTT6ZVB","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"pith_short_8","alias_value":"E5VFKVFG","created_at":"2026-07-05T01:13:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:E5VFKVFGCKTT6ZVB5DU6E4IPJT","target":"record","payload":{"canonical_record":{"source":{"id":"2006.14550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-25T16:49:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"05938fe30b250810cc3a7a5ec4284829031f6716271b96c297c29acf02373ee3","abstract_canon_sha256":"6746dd9c51ee3b84e09769062624aea5d491cff6eae05441be75a3a5cf5271c9"},"schema_version":"1.0"},"canonical_sha256":"276a5554a612a73f66a1e8e9e2710f4ce7b5c6ce101b23f2519fd081ec70c5a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:33.429566Z","signature_b64":"RPScP/ClUcpt14C1y36gnNa6zbwP7UKWSNsbRbXfoUUfFgDmtJ9wGoGgGjcZ7/WpzujLw/bSz6sKsJ0P/7ckAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276a5554a612a73f66a1e8e9e2710f4ce7b5c6ce101b23f2519fd081ec70c5a4","last_reissued_at":"2026-07-05T01:13:33.429155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:33.429155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.14550","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-05T01:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImDOnmDD0bw8jvZtn0ct+2140DzWL7JVYQDN9LxBjb0muZcV9l3fK+vcfFvfLdUd5OIwrKbK/JKdrGuaRCVjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:50:17.121539Z"},"content_sha256":"bbfb47752d8762170e1c38390a87824d17138cc12570930f2ce21a8ded1d5b96","schema_version":"1.0","event_id":"sha256:bbfb47752d8762170e1c38390a87824d17138cc12570930f2ce21a8ded1d5b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:E5VFKVFGCKTT6ZVB5DU6E4IPJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lifted Disjoint Paths with Application in Multiple Object Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CV","authors_text":"Andrea Hornakova, Bodo Rosenhahn, Paul Swoboda, Roberto Henschel","submitted_at":"2020-06-25T16:49:08Z","abstract_excerpt":"We present an extension to the disjoint paths problem in which additional \\emph{lifted} edges are introduced to provide path connectivity priors. We call the resulting optimization problem the lifted disjoint paths problem. We show that this problem is NP-hard by reduction from integer multicommodity flow and 3-SAT. To enable practical global optimization, we propose several classes of linear inequalities that produce a high-quality LP-relaxation. Additionally, we propose efficient cutting plane algorithms for separating the proposed linear inequalities. The lifted disjoint path problem is a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14550","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/2006.14550/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-05T01:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IM9R6yForYOmi3zqe7XrxCbgmTI3+ZHcYYMSimkvQe3ZsuDYfB8fkeqv6xPVbDgOze9KBmaPO1gjW+Wg4Z93CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:50:17.121918Z"},"content_sha256":"3ed8d8e4b7272fd5833c01bd90ba04b3d876da3f4ab2435cbb1e36dbe0ff1e6b","schema_version":"1.0","event_id":"sha256:3ed8d8e4b7272fd5833c01bd90ba04b3d876da3f4ab2435cbb1e36dbe0ff1e6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/bundle.json","state_url":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/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-07-06T14:50:17Z","links":{"resolver":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT","bundle":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/bundle.json","state":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:E5VFKVFGCKTT6ZVB5DU6E4IPJT","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":"6746dd9c51ee3b84e09769062624aea5d491cff6eae05441be75a3a5cf5271c9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-25T16:49:08Z","title_canon_sha256":"05938fe30b250810cc3a7a5ec4284829031f6716271b96c297c29acf02373ee3"},"schema_version":"1.0","source":{"id":"2006.14550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14550","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14550v1","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14550","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"E5VFKVFGCKTT","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"pith_short_16","alias_value":"E5VFKVFGCKTT6ZVB","created_at":"2026-07-05T01:13:33Z"},{"alias_kind":"pith_short_8","alias_value":"E5VFKVFG","created_at":"2026-07-05T01:13:33Z"}],"graph_snapshots":[{"event_id":"sha256:3ed8d8e4b7272fd5833c01bd90ba04b3d876da3f4ab2435cbb1e36dbe0ff1e6b","target":"graph","created_at":"2026-07-05T01:13:33Z","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/2006.14550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an extension to the disjoint paths problem in which additional \\emph{lifted} edges are introduced to provide path connectivity priors. We call the resulting optimization problem the lifted disjoint paths problem. We show that this problem is NP-hard by reduction from integer multicommodity flow and 3-SAT. To enable practical global optimization, we propose several classes of linear inequalities that produce a high-quality LP-relaxation. Additionally, we propose efficient cutting plane algorithms for separating the proposed linear inequalities. The lifted disjoint path problem is a n","authors_text":"Andrea Hornakova, Bodo Rosenhahn, Paul Swoboda, Roberto Henschel","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-25T16:49:08Z","title":"Lifted Disjoint Paths with Application in Multiple Object Tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14550","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:bbfb47752d8762170e1c38390a87824d17138cc12570930f2ce21a8ded1d5b96","target":"record","created_at":"2026-07-05T01:13:33Z","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":"6746dd9c51ee3b84e09769062624aea5d491cff6eae05441be75a3a5cf5271c9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-25T16:49:08Z","title_canon_sha256":"05938fe30b250810cc3a7a5ec4284829031f6716271b96c297c29acf02373ee3"},"schema_version":"1.0","source":{"id":"2006.14550","kind":"arxiv","version":1}},"canonical_sha256":"276a5554a612a73f66a1e8e9e2710f4ce7b5c6ce101b23f2519fd081ec70c5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"276a5554a612a73f66a1e8e9e2710f4ce7b5c6ce101b23f2519fd081ec70c5a4","first_computed_at":"2026-07-05T01:13:33.429155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:33.429155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RPScP/ClUcpt14C1y36gnNa6zbwP7UKWSNsbRbXfoUUfFgDmtJ9wGoGgGjcZ7/WpzujLw/bSz6sKsJ0P/7ckAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:33.429566Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.14550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbfb47752d8762170e1c38390a87824d17138cc12570930f2ce21a8ded1d5b96","sha256:3ed8d8e4b7272fd5833c01bd90ba04b3d876da3f4ab2435cbb1e36dbe0ff1e6b"],"state_sha256":"1a3695135267fb2320f4cec338ff76570b5a33707c7c69451709f52f38e03e39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oc8ilNCFggz5n57fE3rCmDNdDWveMf5Bkf8cMFUhn6llBQSs4yhBSVLNhg5diuYvS54epiwndsWHzql9Pes1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T14:50:17.123916Z","bundle_sha256":"372039771ba31f1ad451f9c0b9d016b2c22e52d8a06f71b1ae3fdf6972dbcdc0"}}