{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:E5VFKVFGCKTT6ZVB5DU6E4IPJT","short_pith_number":"pith:E5VFKVFG","schema_version":"1.0","canonical_sha256":"276a5554a612a73f66a1e8e9e2710f4ce7b5c6ce101b23f2519fd081ec70c5a4","source":{"kind":"arxiv","id":"2006.14550","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.14550","created_at":"2026-07-05T01:13:33.429212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14550v1","created_at":"2026-07-05T01:13:33.429212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14550","created_at":"2026-07-05T01:13:33.429212+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5VFKVFGCKTT","created_at":"2026-07-05T01:13:33.429212+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5VFKVFGCKTT6ZVB","created_at":"2026-07-05T01:13:33.429212+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5VFKVFG","created_at":"2026-07-05T01:13:33.429212+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/E5VFKVFGCKTT6ZVB5DU6E4IPJT","json":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT.json","graph_json":"https://pith.science/api/pith-number/E5VFKVFGCKTT6ZVB5DU6E4IPJT/graph.json","events_json":"https://pith.science/api/pith-number/E5VFKVFGCKTT6ZVB5DU6E4IPJT/events.json","paper":"https://pith.science/paper/E5VFKVFG"},"agent_actions":{"view_html":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT","download_json":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT.json","view_paper":"https://pith.science/paper/E5VFKVFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14550&json=true","fetch_graph":"https://pith.science/api/pith-number/E5VFKVFGCKTT6ZVB5DU6E4IPJT/graph.json","fetch_events":"https://pith.science/api/pith-number/E5VFKVFGCKTT6ZVB5DU6E4IPJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/action/storage_attestation","attest_author":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/action/author_attestation","sign_citation":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/action/citation_signature","submit_replication":"https://pith.science/pith/E5VFKVFGCKTT6ZVB5DU6E4IPJT/action/replication_record"}},"created_at":"2026-07-05T01:13:33.429212+00:00","updated_at":"2026-07-05T01:13:33.429212+00:00"}