{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z7IURFGDON4OWCZKNX3IYKCK75","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":"34e5f15ad300a16ab46cbfee27b680ce87af7b6ea27ad4b84cd562195ce1c60f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-16T20:23:18Z","title_canon_sha256":"d069a7e200ca496d1183e0a3d09d673248261ae6560f335819be859018696fee"},"schema_version":"1.0","source":{"id":"1611.05429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05429","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05429v1","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05429","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"Z7IURFGDON4O","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z7IURFGDON4OWCZK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z7IURFGD","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:4c029847fc1336fa89e9283ad2cbc00b491e100fa6b8edef5efc9647c7723067","target":"graph","created_at":"2026-05-18T00:58:27Z","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, 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","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":"2016-11-16T20:23:18Z","title":"New Hardness Results for Routing on Disjoint Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05429","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:b661fbe850c019067ae832b05ec8d481068bf42395f792b0c5b99240710987de","target":"record","created_at":"2026-05-18T00:58:27Z","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":"34e5f15ad300a16ab46cbfee27b680ce87af7b6ea27ad4b84cd562195ce1c60f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-16T20:23:18Z","title_canon_sha256":"d069a7e200ca496d1183e0a3d09d673248261ae6560f335819be859018696fee"},"schema_version":"1.0","source":{"id":"1611.05429","kind":"arxiv","version":1}},"canonical_sha256":"cfd14894c37378eb0b2a6df68c284aff62bcef03a7ecc9c1d659d2ed416cac0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfd14894c37378eb0b2a6df68c284aff62bcef03a7ecc9c1d659d2ed416cac0c","first_computed_at":"2026-05-18T00:58:27.079093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:27.079093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9atRC9cIanDys4hChabkE+07d65aL6s6xdfJsV1WbRaZE+sC3oNBH9opD21PPx1LyfmMGolr8DUpuET5erFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:27.079723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b661fbe850c019067ae832b05ec8d481068bf42395f792b0c5b99240710987de","sha256:4c029847fc1336fa89e9283ad2cbc00b491e100fa6b8edef5efc9647c7723067"],"state_sha256":"981fc34cf2f0d4a24981585f6a18ed7401a4dc69a2cacb654dd54344d725a490"}