{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z7IURFGDON4OWCZKNX3IYKCK75","short_pith_number":"pith:Z7IURFGD","schema_version":"1.0","canonical_sha256":"cfd14894c37378eb0b2a6df68c284aff62bcef03a7ecc9c1d659d2ed416cac0c","source":{"kind":"arxiv","id":"1611.05429","version":1},"attestation_state":"computed","paper":{"title":"New Hardness Results for Routing on Disjoint Paths","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":"2016-11-16T20:23:18Z","abstract_excerpt":"In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected $n$-vertex graph $G$, and a collection $\\mathcal{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 the largest possible number of the demand pairs via node-disjoint paths. The best current approximation for the problem is achieved by a simple greedy algorithm, whose approximation factor is $O(\\sqrt n)$, while the best current negative result is an $\\Omega(\\log^{1/2-\\delta}n)$-hardness of approximation for any constant $\\delta$, und"},"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":"1611.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-16T20:23:18Z","cross_cats_sorted":[],"title_canon_sha256":"d069a7e200ca496d1183e0a3d09d673248261ae6560f335819be859018696fee","abstract_canon_sha256":"34e5f15ad300a16ab46cbfee27b680ce87af7b6ea27ad4b84cd562195ce1c60f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:27.079723Z","signature_b64":"t9atRC9cIanDys4hChabkE+07d65aL6s6xdfJsV1WbRaZE+sC3oNBH9opD21PPx1LyfmMGolr8DUpuET5erFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfd14894c37378eb0b2a6df68c284aff62bcef03a7ecc9c1d659d2ed416cac0c","last_reissued_at":"2026-05-18T00:58:27.079093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:27.079093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Hardness Results for Routing on Disjoint Paths","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":"2016-11-16T20:23:18Z","abstract_excerpt":"In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected $n$-vertex graph $G$, and a collection $\\mathcal{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 the largest possible number of the demand pairs via node-disjoint paths. The best current approximation for the problem is achieved by a simple greedy algorithm, whose approximation factor is $O(\\sqrt n)$, while the best current negative result is an $\\Omega(\\log^{1/2-\\delta}n)$-hardness of approximation for any constant $\\delta$, und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05429","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":"1611.05429","created_at":"2026-05-18T00:58:27.079199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05429v1","created_at":"2026-05-18T00:58:27.079199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05429","created_at":"2026-05-18T00:58:27.079199+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7IURFGDON4O","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7IURFGDON4OWCZK","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7IURFGD","created_at":"2026-05-18T12:30:53.716459+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/Z7IURFGDON4OWCZKNX3IYKCK75","json":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75.json","graph_json":"https://pith.science/api/pith-number/Z7IURFGDON4OWCZKNX3IYKCK75/graph.json","events_json":"https://pith.science/api/pith-number/Z7IURFGDON4OWCZKNX3IYKCK75/events.json","paper":"https://pith.science/paper/Z7IURFGD"},"agent_actions":{"view_html":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75","download_json":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75.json","view_paper":"https://pith.science/paper/Z7IURFGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05429&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7IURFGDON4OWCZKNX3IYKCK75/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7IURFGDON4OWCZKNX3IYKCK75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75/action/storage_attestation","attest_author":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75/action/author_attestation","sign_citation":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75/action/citation_signature","submit_replication":"https://pith.science/pith/Z7IURFGDON4OWCZKNX3IYKCK75/action/replication_record"}},"created_at":"2026-05-18T00:58:27.079199+00:00","updated_at":"2026-05-18T00:58:27.079199+00:00"}