{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:L2CMJSEATYEZOSHTT4SRLDJJAZ","short_pith_number":"pith:L2CMJSEA","canonical_record":{"source":{"id":"2403.05630","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-08T19:08:31Z","cross_cats_sorted":["cs.CC","math.MG"],"title_canon_sha256":"5d02b5206e5b06f25fd53e5cb2041ec1094fdba3d9102af5e15b3fce2dd6ca6b","abstract_canon_sha256":"e38262b31fe13d24add96f2f8dba0335da7de446fa3aa7025880e1acabbae3c0"},"schema_version":"1.0"},"canonical_sha256":"5e84c4c8809e099748f39f25158d29064e7695705ecaf1245eef92039ae7e069","source":{"kind":"arxiv","id":"2403.05630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.05630","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"arxiv_version","alias_value":"2403.05630v1","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05630","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"pith_short_12","alias_value":"L2CMJSEATYEZ","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"pith_short_16","alias_value":"L2CMJSEATYEZOSHT","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"pith_short_8","alias_value":"L2CMJSEA","created_at":"2026-07-05T07:54:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:L2CMJSEATYEZOSHTT4SRLDJJAZ","target":"record","payload":{"canonical_record":{"source":{"id":"2403.05630","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-08T19:08:31Z","cross_cats_sorted":["cs.CC","math.MG"],"title_canon_sha256":"5d02b5206e5b06f25fd53e5cb2041ec1094fdba3d9102af5e15b3fce2dd6ca6b","abstract_canon_sha256":"e38262b31fe13d24add96f2f8dba0335da7de446fa3aa7025880e1acabbae3c0"},"schema_version":"1.0"},"canonical_sha256":"5e84c4c8809e099748f39f25158d29064e7695705ecaf1245eef92039ae7e069","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:11.069600Z","signature_b64":"N0XjDJ99GSeisFUSIbpiEOJYdddACZrQYDJfT7uO99j2U/LF6geO0gUEBgH8Vy4z5MLmX/XXxtcpAW7TjAAjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e84c4c8809e099748f39f25158d29064e7695705ecaf1245eef92039ae7e069","last_reissued_at":"2026-07-05T07:54:11.069132Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:11.069132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.05630","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-05T07:54:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9XZr6cR2RXFaFCDqhyc1zocBaRAF3PKvEysmDNR/kuFuetD7ZDOgmQozj15ZeT9FH0luCd7bF2nvWjcd/gmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:53:05.918195Z"},"content_sha256":"46d8f430006d2b9ffdac482b5745cadfc2389f4db9847321c43b652b0ca335fc","schema_version":"1.0","event_id":"sha256:46d8f430006d2b9ffdac482b5745cadfc2389f4db9847321c43b652b0ca335fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:L2CMJSEATYEZOSHTT4SRLDJJAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The metric Menger problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.MG"],"primary_cat":"math.CO","authors_text":"Joseph MacManus, J\\'ulia Balig\\'acs","submitted_at":"2024-03-08T19:08:31Z","abstract_excerpt":"We study a generalization of the well-known disjoint paths problem which we call the metric Menger problem, denoted MM(r,k), where one is given two subsets of a graph and must decide whether they can be connected by $k$ paths of pairwise distance at least $r$. We prove that this problem is NP-complete for every $r\\geq 3$ and $k\\geq 2$ by giving a reduction from 3SAT. This resolves a conjecture recently stated by Georgakopoulos and Papasoglu. On the other hand, we show that the problem is in XP when parameterised by treewidth and maximum degree by observing that it is `locally checkable'. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05630","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/2403.05630/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-05T07:54:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9oqZO2VTuJhuML6gPXAUgpbN0c76YDRriKooDgmjC6EliPBgpAAm4mtnVP/jBTnPNm8/MKLZNoDBikx1tK6MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:53:05.918576Z"},"content_sha256":"daa993e78c9a9b740f728273ad2b9b0cf13d0b574888b012d9b874822111fa20","schema_version":"1.0","event_id":"sha256:daa993e78c9a9b740f728273ad2b9b0cf13d0b574888b012d9b874822111fa20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ/bundle.json","state_url":"https://pith.science/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ/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-08-21T09:53:05Z","links":{"resolver":"https://pith.science/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ","bundle":"https://pith.science/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ/bundle.json","state":"https://pith.science/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2CMJSEATYEZOSHTT4SRLDJJAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L2CMJSEATYEZOSHTT4SRLDJJAZ","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":"e38262b31fe13d24add96f2f8dba0335da7de446fa3aa7025880e1acabbae3c0","cross_cats_sorted":["cs.CC","math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-08T19:08:31Z","title_canon_sha256":"5d02b5206e5b06f25fd53e5cb2041ec1094fdba3d9102af5e15b3fce2dd6ca6b"},"schema_version":"1.0","source":{"id":"2403.05630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.05630","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"arxiv_version","alias_value":"2403.05630v1","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05630","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"pith_short_12","alias_value":"L2CMJSEATYEZ","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"pith_short_16","alias_value":"L2CMJSEATYEZOSHT","created_at":"2026-07-05T07:54:11Z"},{"alias_kind":"pith_short_8","alias_value":"L2CMJSEA","created_at":"2026-07-05T07:54:11Z"}],"graph_snapshots":[{"event_id":"sha256:daa993e78c9a9b740f728273ad2b9b0cf13d0b574888b012d9b874822111fa20","target":"graph","created_at":"2026-07-05T07:54:11Z","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/2403.05630/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a generalization of the well-known disjoint paths problem which we call the metric Menger problem, denoted MM(r,k), where one is given two subsets of a graph and must decide whether they can be connected by $k$ paths of pairwise distance at least $r$. We prove that this problem is NP-complete for every $r\\geq 3$ and $k\\geq 2$ by giving a reduction from 3SAT. This resolves a conjecture recently stated by Georgakopoulos and Papasoglu. On the other hand, we show that the problem is in XP when parameterised by treewidth and maximum degree by observing that it is `locally checkable'. In th","authors_text":"Joseph MacManus, J\\'ulia Balig\\'acs","cross_cats":["cs.CC","math.MG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-08T19:08:31Z","title":"The metric Menger problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05630","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:46d8f430006d2b9ffdac482b5745cadfc2389f4db9847321c43b652b0ca335fc","target":"record","created_at":"2026-07-05T07:54:11Z","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":"e38262b31fe13d24add96f2f8dba0335da7de446fa3aa7025880e1acabbae3c0","cross_cats_sorted":["cs.CC","math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-08T19:08:31Z","title_canon_sha256":"5d02b5206e5b06f25fd53e5cb2041ec1094fdba3d9102af5e15b3fce2dd6ca6b"},"schema_version":"1.0","source":{"id":"2403.05630","kind":"arxiv","version":1}},"canonical_sha256":"5e84c4c8809e099748f39f25158d29064e7695705ecaf1245eef92039ae7e069","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e84c4c8809e099748f39f25158d29064e7695705ecaf1245eef92039ae7e069","first_computed_at":"2026-07-05T07:54:11.069132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:54:11.069132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N0XjDJ99GSeisFUSIbpiEOJYdddACZrQYDJfT7uO99j2U/LF6geO0gUEBgH8Vy4z5MLmX/XXxtcpAW7TjAAjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:54:11.069600Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.05630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46d8f430006d2b9ffdac482b5745cadfc2389f4db9847321c43b652b0ca335fc","sha256:daa993e78c9a9b740f728273ad2b9b0cf13d0b574888b012d9b874822111fa20"],"state_sha256":"17499d5b6fbc8b9335c118d4f712f70d4a47d3bca713edbedfb1d61578616a65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+BwzzHAzVtMtX6OcShAx1lbUGTr0R7PDCXjfeREvr67v8yV6EZs/7AKVx3wbPFSPHmlBjHFwu/zd5unA85LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T09:53:05.920899Z","bundle_sha256":"674ac7823f6f62377c6208a0608b437214d388d86d15303cf0c0ed6782fd3d8b"}}