{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V5JDDXV4DVLH22UV6X42DSNABD","short_pith_number":"pith:V5JDDXV4","schema_version":"1.0","canonical_sha256":"af5231debc1d567d6a95f5f9a1c9a008eed6a66d09cb9738222004ec65b90c97","source":{"kind":"arxiv","id":"1711.01980","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01980","created_at":"2026-05-18T00:31:16.411079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01980v1","created_at":"2026-05-18T00:31:16.411079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01980","created_at":"2026-05-18T00:31:16.411079+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5JDDXV4DVLH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5JDDXV4DVLH22UV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5JDDXV4","created_at":"2026-05-18T12:31:49.984773+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/V5JDDXV4DVLH22UV6X42DSNABD","json":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD.json","graph_json":"https://pith.science/api/pith-number/V5JDDXV4DVLH22UV6X42DSNABD/graph.json","events_json":"https://pith.science/api/pith-number/V5JDDXV4DVLH22UV6X42DSNABD/events.json","paper":"https://pith.science/paper/V5JDDXV4"},"agent_actions":{"view_html":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD","download_json":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD.json","view_paper":"https://pith.science/paper/V5JDDXV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01980&json=true","fetch_graph":"https://pith.science/api/pith-number/V5JDDXV4DVLH22UV6X42DSNABD/graph.json","fetch_events":"https://pith.science/api/pith-number/V5JDDXV4DVLH22UV6X42DSNABD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/action/storage_attestation","attest_author":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/action/author_attestation","sign_citation":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/action/citation_signature","submit_replication":"https://pith.science/pith/V5JDDXV4DVLH22UV6X42DSNABD/action/replication_record"}},"created_at":"2026-05-18T00:31:16.411079+00:00","updated_at":"2026-05-18T00:31:16.411079+00:00"}