{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2UEYK5QA6NYVF4YIOQENQ6LQRJ","short_pith_number":"pith:2UEYK5QA","canonical_record":{"source":{"id":"1805.09956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-25T03:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"e1f8bdfb4caf00033ee6c1f61f6f2214bf791d0798d54c719db0ba58bb68c781","abstract_canon_sha256":"d039569379cad3abf88f97cc95eb7c5a34db998bf8934506c9231cf4cd004eb4"},"schema_version":"1.0"},"canonical_sha256":"d509857600f37152f3087408d879708a44d09a6ddba262b1ef64b98e33d43a82","source":{"kind":"arxiv","id":"1805.09956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09956","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09956v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09956","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"2UEYK5QA6NYV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UEYK5QA6NYVF4YI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UEYK5QA","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2UEYK5QA6NYVF4YIOQENQ6LQRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-25T03:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"e1f8bdfb4caf00033ee6c1f61f6f2214bf791d0798d54c719db0ba58bb68c781","abstract_canon_sha256":"d039569379cad3abf88f97cc95eb7c5a34db998bf8934506c9231cf4cd004eb4"},"schema_version":"1.0"},"canonical_sha256":"d509857600f37152f3087408d879708a44d09a6ddba262b1ef64b98e33d43a82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:58.687584Z","signature_b64":"YL0mDxKYpDdWQqoWJnGoWq9hWcNpf/Z2MB/puO+0F/IG0A4a8HkbH09iOPQfg6XtOTtppXgAxYWAyDwiu7uVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d509857600f37152f3087408d879708a44d09a6ddba262b1ef64b98e33d43a82","last_reissued_at":"2026-05-18T00:14:58.686973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:58.686973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09956","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUkeTGm7pC3Xe9YYnV6T7E08yVlJe9dzhcSTqcGS36oI+90sdz9V5rFcUfH7fTUMXTQyGbW6nzTyHbCOQ+CgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:20:00.861883Z"},"content_sha256":"6d17360647cdd40d2980a6e3f70a73d6229754b1dd86cdaa8fd8dc696c479aca","schema_version":"1.0","event_id":"sha256:6d17360647cdd40d2980a6e3f70a73d6229754b1dd86cdaa8fd8dc696c479aca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2UEYK5QA6NYVF4YIOQENQ6LQRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary","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":"2018-05-25T03:01:00Z","abstract_excerpt":"We study the classical Node-Disjoint Paths (NDP) problem: given an undirected $n$-vertex graph G, together with a set {(s_1,t_1),...,(s_k,t_k)} of pairs of its vertices, called source-destination, or demand pairs, find a maximum-cardinality set of mutually node-disjoint paths that connect the demand pairs. The best current approximation for the problem is achieved by a simple greedy $O(\\sqrt{n})$-approximation algorithm.\n  A special case of the problem called NDP-Grid, where the underlying graph is a grid, has been studied extensively. The best current approximation algorithm for NDP-Grid achi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09956","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNRSN5RsJHPtju63r4ulthl1iIgwqrcyXGvDR4MyuMOMHHiEcxrBb+7WznnlqZ2ORtZu8DV3rTQdAcRAl3VIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:20:00.862633Z"},"content_sha256":"ca0b7ba551884c71a1d6027aae9d93240b66802b53f815f5aa705472009a9600","schema_version":"1.0","event_id":"sha256:ca0b7ba551884c71a1d6027aae9d93240b66802b53f815f5aa705472009a9600"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ/bundle.json","state_url":"https://pith.science/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ/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-11T20:20:00Z","links":{"resolver":"https://pith.science/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ","bundle":"https://pith.science/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ/bundle.json","state":"https://pith.science/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UEYK5QA6NYVF4YIOQENQ6LQRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2UEYK5QA6NYVF4YIOQENQ6LQRJ","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":"d039569379cad3abf88f97cc95eb7c5a34db998bf8934506c9231cf4cd004eb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-25T03:01:00Z","title_canon_sha256":"e1f8bdfb4caf00033ee6c1f61f6f2214bf791d0798d54c719db0ba58bb68c781"},"schema_version":"1.0","source":{"id":"1805.09956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09956","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09956v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09956","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"2UEYK5QA6NYV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UEYK5QA6NYVF4YI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UEYK5QA","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:ca0b7ba551884c71a1d6027aae9d93240b66802b53f815f5aa705472009a9600","target":"graph","created_at":"2026-05-18T00:14:58Z","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":"We study the classical Node-Disjoint Paths (NDP) problem: given an undirected $n$-vertex graph G, together with a set {(s_1,t_1),...,(s_k,t_k)} of pairs of its vertices, called source-destination, or demand pairs, find a maximum-cardinality set of mutually node-disjoint paths that connect the demand pairs. The best current approximation for the problem is achieved by a simple greedy $O(\\sqrt{n})$-approximation algorithm.\n  A special case of the problem called NDP-Grid, where the underlying graph is a grid, has been studied extensively. The best current approximation algorithm for NDP-Grid achi","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":"2018-05-25T03:01:00Z","title":"Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09956","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:6d17360647cdd40d2980a6e3f70a73d6229754b1dd86cdaa8fd8dc696c479aca","target":"record","created_at":"2026-05-18T00:14:58Z","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":"d039569379cad3abf88f97cc95eb7c5a34db998bf8934506c9231cf4cd004eb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-25T03:01:00Z","title_canon_sha256":"e1f8bdfb4caf00033ee6c1f61f6f2214bf791d0798d54c719db0ba58bb68c781"},"schema_version":"1.0","source":{"id":"1805.09956","kind":"arxiv","version":1}},"canonical_sha256":"d509857600f37152f3087408d879708a44d09a6ddba262b1ef64b98e33d43a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d509857600f37152f3087408d879708a44d09a6ddba262b1ef64b98e33d43a82","first_computed_at":"2026-05-18T00:14:58.686973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:58.686973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YL0mDxKYpDdWQqoWJnGoWq9hWcNpf/Z2MB/puO+0F/IG0A4a8HkbH09iOPQfg6XtOTtppXgAxYWAyDwiu7uVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:58.687584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d17360647cdd40d2980a6e3f70a73d6229754b1dd86cdaa8fd8dc696c479aca","sha256:ca0b7ba551884c71a1d6027aae9d93240b66802b53f815f5aa705472009a9600"],"state_sha256":"dce19b0cb042e9e2da58a357a2a82223cb34aa84f4c34fae15dae7d797fd0471"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59CGh8c61ngHPo0UddkcLpfVkAJpgPJAW7INMLvIBuQGrZr1IH+n95ppQl+Mqv5aFMfar8JQKc8cYnpiE1P/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:20:00.867556Z","bundle_sha256":"fb870f67062d24203aa0c20a3938546bf5583653349d71ac30ea4eb5a3367304"}}