{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V5JDDXV4DVLH22UV6X42DSNABD","short_pith_number":"pith:V5JDDXV4","canonical_record":{"source":{"id":"1711.01980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T16:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"d6c37e423299a62fa44c852ab491def5a89b6b016c00d297ca8aca93e7416dd0","abstract_canon_sha256":"7789f3726ad1762f569a60b2a3376ea73ae1af1636b4c7e26b351481c651e026"},"schema_version":"1.0"},"canonical_sha256":"af5231debc1d567d6a95f5f9a1c9a008eed6a66d09cb9738222004ec65b90c97","source":{"kind":"arxiv","id":"1711.01980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01980","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01980v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01980","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"V5JDDXV4DVLH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5JDDXV4DVLH22UV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5JDDXV4","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V5JDDXV4DVLH22UV6X42DSNABD","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T16:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"d6c37e423299a62fa44c852ab491def5a89b6b016c00d297ca8aca93e7416dd0","abstract_canon_sha256":"7789f3726ad1762f569a60b2a3376ea73ae1af1636b4c7e26b351481c651e026"},"schema_version":"1.0"},"canonical_sha256":"af5231debc1d567d6a95f5f9a1c9a008eed6a66d09cb9738222004ec65b90c97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.411529Z","signature_b64":"syLYXhnLbFW4HRzf10Iqa0XF6lFJ6oolGf5Ms0JTZHMtVp/eAP/6EHKe3cW4gHZnAfiRV15LTCJpLpeP+R8qDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af5231debc1d567d6a95f5f9a1c9a008eed6a66d09cb9738222004ec65b90c97","last_reissued_at":"2026-05-18T00:31:16.410987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.410987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01980","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-05-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9+FevrE9LoIev5toy+c2OeoKbTZlQxrzvZKSwYJx82Yswr5b5waOtADyh8IkavcrC3314W3ubGn0HlqlURYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:21:37.370443Z"},"content_sha256":"ca231cdca442dd905e4e67edbe73d7564aa251d60cfb096133fb1645dabadeaa","schema_version":"1.0","event_id":"sha256:ca231cdca442dd905e4e67edbe73d7564aa251d60cfb096133fb1645dabadeaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V5JDDXV4DVLH22UV6X42DSNABD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Polynomial Hardness of Node-Disjoint Paths in Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David H. K. Kim, Julia Chuzhoy, Rachit Nimavat","submitted_at":"2017-11-06T16:06:10Z","abstract_excerpt":"In the classical Node-Disjoint Paths (NDP) problem, we are given an $n$-vertex graph $G=(V,E)$, and a collection $M=\\{(s_1,t_1),\\ldots,(s_k,t_k)\\}$ of pairs of its vertices, called source-destination, or demand pairs. The goal is to route as many of the demand pairs as possible, where to route a pair we need to select a path connecting it, so that all selected paths are disjoint in their vertices. The best current algorithm for NDP achieves an $O(\\sqrt{n})$-approximation, while, until recently, the best negative result was a factor $\\Omega(\\log^{1/2-\\epsilon}n)$-hardness of approximation, for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01980","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":""},"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-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGpyx37uo758ZD0/coU3l16un9aaEYwPqHOPHcgnumojBNsc/EeiY1SaJ6e+uwciDTpbJK+lRtFbQoBiGNWMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:21:37.370793Z"},"content_sha256":"93e74d69a1771544d985933d53bcfba2d00e0c454f7fc44219f520a43479e25c","schema_version":"1.0","event_id":"sha256:93e74d69a1771544d985933d53bcfba2d00e0c454f7fc44219f520a43479e25c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/bundle.json","state_url":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5JDDXV4DVLH22UV6X42DSNABD/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-06-11T12:21:37Z","links":{"resolver":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD","bundle":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/bundle.json","state":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5JDDXV4DVLH22UV6X42DSNABD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V5JDDXV4DVLH22UV6X42DSNABD","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":"7789f3726ad1762f569a60b2a3376ea73ae1af1636b4c7e26b351481c651e026","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T16:06:10Z","title_canon_sha256":"d6c37e423299a62fa44c852ab491def5a89b6b016c00d297ca8aca93e7416dd0"},"schema_version":"1.0","source":{"id":"1711.01980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01980","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01980v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01980","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"V5JDDXV4DVLH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5JDDXV4DVLH22UV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5JDDXV4","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:93e74d69a1771544d985933d53bcfba2d00e0c454f7fc44219f520a43479e25c","target":"graph","created_at":"2026-05-18T00:31:16Z","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":"In the classical Node-Disjoint Paths (NDP) problem, we are given an $n$-vertex graph $G=(V,E)$, and a collection $M=\\{(s_1,t_1),\\ldots,(s_k,t_k)\\}$ of pairs of its vertices, called source-destination, or demand pairs. The goal is to route as many of the demand pairs as possible, where to route a pair we need to select a path connecting it, so that all selected paths are disjoint in their vertices. The best current algorithm for NDP achieves an $O(\\sqrt{n})$-approximation, while, until recently, the best negative result was a factor $\\Omega(\\log^{1/2-\\epsilon}n)$-hardness of approximation, for ","authors_text":"David H. K. Kim, Julia Chuzhoy, Rachit Nimavat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T16:06:10Z","title":"Almost Polynomial Hardness of Node-Disjoint Paths in Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01980","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:ca231cdca442dd905e4e67edbe73d7564aa251d60cfb096133fb1645dabadeaa","target":"record","created_at":"2026-05-18T00:31:16Z","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":"7789f3726ad1762f569a60b2a3376ea73ae1af1636b4c7e26b351481c651e026","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T16:06:10Z","title_canon_sha256":"d6c37e423299a62fa44c852ab491def5a89b6b016c00d297ca8aca93e7416dd0"},"schema_version":"1.0","source":{"id":"1711.01980","kind":"arxiv","version":1}},"canonical_sha256":"af5231debc1d567d6a95f5f9a1c9a008eed6a66d09cb9738222004ec65b90c97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af5231debc1d567d6a95f5f9a1c9a008eed6a66d09cb9738222004ec65b90c97","first_computed_at":"2026-05-18T00:31:16.410987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:16.410987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"syLYXhnLbFW4HRzf10Iqa0XF6lFJ6oolGf5Ms0JTZHMtVp/eAP/6EHKe3cW4gHZnAfiRV15LTCJpLpeP+R8qDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:16.411529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca231cdca442dd905e4e67edbe73d7564aa251d60cfb096133fb1645dabadeaa","sha256:93e74d69a1771544d985933d53bcfba2d00e0c454f7fc44219f520a43479e25c"],"state_sha256":"33916f4dc83add5f933c0823410e809dd482aed5ca3181a768e4f80a99b1ea6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTb9VFH16UHt8lVp40HmObWQnfEQKAKoCl5gnX7zmTbwK992zvCQsMtEak5zOYGXh99JKldO+M0Ix0e9GMerDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:21:37.372738Z","bundle_sha256":"1086bcf896f2c117f79120203a49162b512ba7c0467fa5734ed3bf06cdf0c0c9"}}