{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5QPVLQRFT3O3YUXTMZAKWHVFFJ","short_pith_number":"pith:5QPVLQRF","canonical_record":{"source":{"id":"2007.12502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-24T12:38:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ef909acf1d1a71ac0ffa750803f8439a67634319eaa3dae9c9c128615dd40bca","abstract_canon_sha256":"2192d5fa0ef7612348ff7f609cd42c81f06ca66a91544d380585226dc520a59b"},"schema_version":"1.0"},"canonical_sha256":"ec1f55c2259eddbc52f36640ab1ea52a58e2c344e999fb9244a2d303b980b9f5","source":{"kind":"arxiv","id":"2007.12502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12502","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12502v2","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12502","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"5QPVLQRFT3O3","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"5QPVLQRFT3O3YUXT","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"5QPVLQRF","created_at":"2026-07-05T04:19:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5QPVLQRFT3O3YUXTMZAKWHVFFJ","target":"record","payload":{"canonical_record":{"source":{"id":"2007.12502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-24T12:38:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ef909acf1d1a71ac0ffa750803f8439a67634319eaa3dae9c9c128615dd40bca","abstract_canon_sha256":"2192d5fa0ef7612348ff7f609cd42c81f06ca66a91544d380585226dc520a59b"},"schema_version":"1.0"},"canonical_sha256":"ec1f55c2259eddbc52f36640ab1ea52a58e2c344e999fb9244a2d303b980b9f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:21.394679Z","signature_b64":"+1h5m1gpMW/3IruJ7fQ1NNJNjHNJZOSNiyHeeXqpplgIMFMSdWGAVk7TL5kkdjEEBqLkjCyAXuNCfnPSwfSxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec1f55c2259eddbc52f36640ab1ea52a58e2c344e999fb9244a2d303b980b9f5","last_reissued_at":"2026-07-05T04:19:21.394304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:21.394304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.12502","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-07-05T04:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/tMu0x9o3qDHHtHWpfsHmVJZjNrUAt/h7auu4+QK6fmi3gnIuiQJtlJKwg2o0hOncNub163SqesR38T/UVfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:44:44.093547Z"},"content_sha256":"1ff4e6b5c3d5b766c814ed8b991a207c6a9fdf03b339d3f806d7c5772b511b64","schema_version":"1.0","event_id":"sha256:1ff4e6b5c3d5b766c814ed8b991a207c6a9fdf03b339d3f806d7c5772b511b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5QPVLQRFT3O3YUXTMZAKWHVFFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using a geometric lens to find k disjoint shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Andr\\'e Nichterlein, Malte Renken, Matthias Bentert, Philipp Zschoche","submitted_at":"2020-07-24T12:38:59Z","abstract_excerpt":"Given an undirected $n$-vertex graph and $k$ pairs of terminal vertices $(s_1,t_1), \\ldots, (s_k,t_k)$, the $k$-Disjoint Shortest Paths ($k$-DSP)-problem asks whether there are $k$ pairwise vertex-disjoint paths $P_1,\\ldots, P_k$ such that $P_i$ is a shortest $s_i$-$t_i$-path for each $i \\in [k]$. Recently, Lochet [SODA 2021] provided an algorithm that solves $k$-DSP in $n^{O(k^{5^k})}$ time, answering a 20-year old question about the computational complexity of $k$-DSP for constant $k$. On the one hand, we present an improved $n^{O(k!k)}$-time algorithm based on a novel geometric view on this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12502","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.12502/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-05T04:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ootbJQ67+AYG5eUm0f4acEj4f2ei9ldF3qD0yvlFfL1TBibB7iaqG6BguCIywvpbD0fpAtMSwOftc5FvIxAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:44:44.093927Z"},"content_sha256":"baf09b81e6a028bbb28ee5db3603820ab8d6b7129a344e4a82b63df1745009ef","schema_version":"1.0","event_id":"sha256:baf09b81e6a028bbb28ee5db3603820ab8d6b7129a344e4a82b63df1745009ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ/bundle.json","state_url":"https://pith.science/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ/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-06T18:44:44Z","links":{"resolver":"https://pith.science/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ","bundle":"https://pith.science/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ/bundle.json","state":"https://pith.science/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QPVLQRFT3O3YUXTMZAKWHVFFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5QPVLQRFT3O3YUXTMZAKWHVFFJ","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":"2192d5fa0ef7612348ff7f609cd42c81f06ca66a91544d380585226dc520a59b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-24T12:38:59Z","title_canon_sha256":"ef909acf1d1a71ac0ffa750803f8439a67634319eaa3dae9c9c128615dd40bca"},"schema_version":"1.0","source":{"id":"2007.12502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12502","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12502v2","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12502","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"5QPVLQRFT3O3","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"5QPVLQRFT3O3YUXT","created_at":"2026-07-05T04:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"5QPVLQRF","created_at":"2026-07-05T04:19:21Z"}],"graph_snapshots":[{"event_id":"sha256:baf09b81e6a028bbb28ee5db3603820ab8d6b7129a344e4a82b63df1745009ef","target":"graph","created_at":"2026-07-05T04:19:21Z","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/2007.12502/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an undirected $n$-vertex graph and $k$ pairs of terminal vertices $(s_1,t_1), \\ldots, (s_k,t_k)$, the $k$-Disjoint Shortest Paths ($k$-DSP)-problem asks whether there are $k$ pairwise vertex-disjoint paths $P_1,\\ldots, P_k$ such that $P_i$ is a shortest $s_i$-$t_i$-path for each $i \\in [k]$. Recently, Lochet [SODA 2021] provided an algorithm that solves $k$-DSP in $n^{O(k^{5^k})}$ time, answering a 20-year old question about the computational complexity of $k$-DSP for constant $k$. On the one hand, we present an improved $n^{O(k!k)}$-time algorithm based on a novel geometric view on this","authors_text":"Andr\\'e Nichterlein, Malte Renken, Matthias Bentert, Philipp Zschoche","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-24T12:38:59Z","title":"Using a geometric lens to find k disjoint shortest paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12502","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:1ff4e6b5c3d5b766c814ed8b991a207c6a9fdf03b339d3f806d7c5772b511b64","target":"record","created_at":"2026-07-05T04:19:21Z","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":"2192d5fa0ef7612348ff7f609cd42c81f06ca66a91544d380585226dc520a59b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-24T12:38:59Z","title_canon_sha256":"ef909acf1d1a71ac0ffa750803f8439a67634319eaa3dae9c9c128615dd40bca"},"schema_version":"1.0","source":{"id":"2007.12502","kind":"arxiv","version":2}},"canonical_sha256":"ec1f55c2259eddbc52f36640ab1ea52a58e2c344e999fb9244a2d303b980b9f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec1f55c2259eddbc52f36640ab1ea52a58e2c344e999fb9244a2d303b980b9f5","first_computed_at":"2026-07-05T04:19:21.394304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:19:21.394304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1h5m1gpMW/3IruJ7fQ1NNJNjHNJZOSNiyHeeXqpplgIMFMSdWGAVk7TL5kkdjEEBqLkjCyAXuNCfnPSwfSxAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:19:21.394679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.12502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ff4e6b5c3d5b766c814ed8b991a207c6a9fdf03b339d3f806d7c5772b511b64","sha256:baf09b81e6a028bbb28ee5db3603820ab8d6b7129a344e4a82b63df1745009ef"],"state_sha256":"53031a080715b88c7f66889728b1c62681b7125b156e0d85b7da38e1d194e5c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHk8Oom583LHF9ql+whV4NBPjKlNM/uXC+9rwDpnTdXrj+eWumRTnQigUCMWoGbDIeekMiIero50gsQ9TntvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:44:44.095867Z","bundle_sha256":"e9aba5e0a6f66227c90ead856d52330361ec77de5dc3a349a409fe6850226074"}}