{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PJ7BDOBUMNGPHPJKDR265RHRHV","short_pith_number":"pith:PJ7BDOBU","canonical_record":{"source":{"id":"1603.01740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-05T16:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"85c9863f3f4a73779c047b641a5bdb44525b29ac9fdd46be348b4594b8d33132","abstract_canon_sha256":"6cbc45a86abef13a1667a0399a51e9ca293fb3458f6f3e84fca5e4cf13819c0c"},"schema_version":"1.0"},"canonical_sha256":"7a7e11b834634cf3bd2a1c75eec4f13d58f104c04edc2dd9dca4765dac1d93b3","source":{"kind":"arxiv","id":"1603.01740","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01740","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01740v2","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01740","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"PJ7BDOBUMNGP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ7BDOBUMNGPHPJK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ7BDOBU","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PJ7BDOBUMNGPHPJKDR265RHRHV","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-05T16:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"85c9863f3f4a73779c047b641a5bdb44525b29ac9fdd46be348b4594b8d33132","abstract_canon_sha256":"6cbc45a86abef13a1667a0399a51e9ca293fb3458f6f3e84fca5e4cf13819c0c"},"schema_version":"1.0"},"canonical_sha256":"7a7e11b834634cf3bd2a1c75eec4f13d58f104c04edc2dd9dca4765dac1d93b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:20.443076Z","signature_b64":"ig/BI4QjJTufcAkA9mCtRdAWwfTg8fsOrhACn1FDOy8U/MiI0OhFZmZ8+mpy0hqdDc11aTjh7Qv8Sl4pLbAeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a7e11b834634cf3bd2a1c75eec4f13d58f104c04edc2dd9dca4765dac1d93b3","last_reissued_at":"2026-05-18T01:14:20.442415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:20.442415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01740","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-18T01:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iGlj2oAyL2JQuq9pC2D5QspXNDIejgHKYNZc7Pvy4fewr6y7Ek5uw86hIyysVxVD8KZ0GKIjmxNwUmfbHt5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:19:58.446503Z"},"content_sha256":"494e1ec9fd6b710095f81c05402ad4e1ca3460fa2e3d06ccc0df1be72c0bd7ff","schema_version":"1.0","event_id":"sha256:494e1ec9fd6b710095f81c05402ad4e1ca3460fa2e3d06ccc0df1be72c0bd7ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PJ7BDOBUMNGPHPJKDR265RHRHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joachim Spoerhase, Krzysztof Fleszar, Matthias Mnich","submitted_at":"2016-03-05T16:50:09Z","abstract_excerpt":"We study the classical NP-hard problems of finding maximum-size subsets from given sets of $k$ terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph. The approximability of MaxEDP/NDP is currently not well understood; the best known lower bound is $\\Omega(\\log^{1/2-\\epsilon}{n})$, assuming NP$~\\not\\subseteq~$ZPTIME$(n^{\\mathrm{poly}\\log n})$. This constitutes a significant gap to the best known approximation upper bound of $O(\\sqrt{n})$ due to Chekuri et al. (2006) and closing this gap is currently one of the big open problems in ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01740","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-18T01:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKfU3qh50OxO68k4EXgtV9y6GtnDEFVR4Ohv+Anerca3244V26rWRykRIC2Rii28GGaBgDVAqt3woDxariVnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:19:58.447361Z"},"content_sha256":"c18491a2ca09fa9ec67fc6d9880cb2b94ac6df5ad4018e4102fda1fcf30b5ab6","schema_version":"1.0","event_id":"sha256:c18491a2ca09fa9ec67fc6d9880cb2b94ac6df5ad4018e4102fda1fcf30b5ab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJ7BDOBUMNGPHPJKDR265RHRHV/bundle.json","state_url":"https://pith.science/pith/PJ7BDOBUMNGPHPJKDR265RHRHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJ7BDOBUMNGPHPJKDR265RHRHV/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-30T07:19:58Z","links":{"resolver":"https://pith.science/pith/PJ7BDOBUMNGPHPJKDR265RHRHV","bundle":"https://pith.science/pith/PJ7BDOBUMNGPHPJKDR265RHRHV/bundle.json","state":"https://pith.science/pith/PJ7BDOBUMNGPHPJKDR265RHRHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJ7BDOBUMNGPHPJKDR265RHRHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PJ7BDOBUMNGPHPJKDR265RHRHV","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":"6cbc45a86abef13a1667a0399a51e9ca293fb3458f6f3e84fca5e4cf13819c0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-05T16:50:09Z","title_canon_sha256":"85c9863f3f4a73779c047b641a5bdb44525b29ac9fdd46be348b4594b8d33132"},"schema_version":"1.0","source":{"id":"1603.01740","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01740","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01740v2","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01740","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"PJ7BDOBUMNGP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ7BDOBUMNGPHPJK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ7BDOBU","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:c18491a2ca09fa9ec67fc6d9880cb2b94ac6df5ad4018e4102fda1fcf30b5ab6","target":"graph","created_at":"2026-05-18T01:14:20Z","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 classical NP-hard problems of finding maximum-size subsets from given sets of $k$ terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph. The approximability of MaxEDP/NDP is currently not well understood; the best known lower bound is $\\Omega(\\log^{1/2-\\epsilon}{n})$, assuming NP$~\\not\\subseteq~$ZPTIME$(n^{\\mathrm{poly}\\log n})$. This constitutes a significant gap to the best known approximation upper bound of $O(\\sqrt{n})$ due to Chekuri et al. (2006) and closing this gap is currently one of the big open problems in ap","authors_text":"Joachim Spoerhase, Krzysztof Fleszar, Matthias Mnich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-05T16:50:09Z","title":"New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01740","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:494e1ec9fd6b710095f81c05402ad4e1ca3460fa2e3d06ccc0df1be72c0bd7ff","target":"record","created_at":"2026-05-18T01:14:20Z","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":"6cbc45a86abef13a1667a0399a51e9ca293fb3458f6f3e84fca5e4cf13819c0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-05T16:50:09Z","title_canon_sha256":"85c9863f3f4a73779c047b641a5bdb44525b29ac9fdd46be348b4594b8d33132"},"schema_version":"1.0","source":{"id":"1603.01740","kind":"arxiv","version":2}},"canonical_sha256":"7a7e11b834634cf3bd2a1c75eec4f13d58f104c04edc2dd9dca4765dac1d93b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a7e11b834634cf3bd2a1c75eec4f13d58f104c04edc2dd9dca4765dac1d93b3","first_computed_at":"2026-05-18T01:14:20.442415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:20.442415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ig/BI4QjJTufcAkA9mCtRdAWwfTg8fsOrhACn1FDOy8U/MiI0OhFZmZ8+mpy0hqdDc11aTjh7Qv8Sl4pLbAeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:20.443076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01740","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:494e1ec9fd6b710095f81c05402ad4e1ca3460fa2e3d06ccc0df1be72c0bd7ff","sha256:c18491a2ca09fa9ec67fc6d9880cb2b94ac6df5ad4018e4102fda1fcf30b5ab6"],"state_sha256":"52a1a438b71e045206f49f20f1e99546deb23cb52907dd27f1438e216dcd2c5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aysBq0/d1gZmsFjHqK++Ew5Op+BNnfgyAqSthhyKFWIrAUTnSi79uAkKbIRV9/vuXFup49HocLRZ5RkHe8d2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:19:58.450171Z","bundle_sha256":"22d5f678ef4a86b2f5cfffa6717a09c1cdf822c806653e05358b55bc8fdc6a6d"}}