{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AB2BJOWBLT23YVZSN4RN43XSBG","short_pith_number":"pith:AB2BJOWB","canonical_record":{"source":{"id":"1603.05520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T14:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"30747ae44c4516e2138c6740cd5c14b8e8e16ad5e48cc5a722ee733e467fdbca","abstract_canon_sha256":"6e2caeae6e2b884da1d3a481f1763f56a5f205280d9e9048e0d038388462a2c2"},"schema_version":"1.0"},"canonical_sha256":"007414bac15cf5bc57326f22de6ef2098da07d7b84fd7cac15d86bcd2305a907","source":{"kind":"arxiv","id":"1603.05520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05520","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05520v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05520","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"AB2BJOWBLT23","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"AB2BJOWBLT23YVZS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"AB2BJOWB","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AB2BJOWBLT23YVZSN4RN43XSBG","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T14:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"30747ae44c4516e2138c6740cd5c14b8e8e16ad5e48cc5a722ee733e467fdbca","abstract_canon_sha256":"6e2caeae6e2b884da1d3a481f1763f56a5f205280d9e9048e0d038388462a2c2"},"schema_version":"1.0"},"canonical_sha256":"007414bac15cf5bc57326f22de6ef2098da07d7b84fd7cac15d86bcd2305a907","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.168248Z","signature_b64":"X5kaiNn1advs4IFj9vYBWqy7lZv4lxz159oiItKFi79pBoxjGEZovoXXojiweo70h1T1NSAXgpTCTd0Z3EfOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"007414bac15cf5bc57326f22de6ef2098da07d7b84fd7cac15d86bcd2305a907","last_reissued_at":"2026-05-18T01:18:56.167753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.167753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05520","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-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXCAZfVazLAHtG4t+7Xxj8UrdvuDXuT04OrzHWFUCIqa1tkHBTRxMjetNBpmcadBwNN0ah2gsxx9EQEnpCyAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:12:59.400599Z"},"content_sha256":"99161367fa5abe6617c280342ddf6c4aa0d97c7de2eaf9c82198c789fdaac3da","schema_version":"1.0","event_id":"sha256:99161367fa5abe6617c280342ddf6c4aa0d97c7de2eaf9c82198c789fdaac3da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AB2BJOWBLT23YVZSN4RN43XSBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation for Node-Disjoint Paths in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David H. K. Kim, Julia Chuzhoy, Shi Li","submitted_at":"2016-03-17T14:57:12Z","abstract_excerpt":"We study the classical Node-Disjoint Paths (NDP) problem: given an $n$-vertex graph $G$ and a collection $M=\\{(s_1,t_1),\\ldots,(s_k,t_k)\\}$ of pairs of vertices of $G$ called demand pairs, find a maximum-cardinality set of node-disjoint paths connecting the demand pairs. NDP is one of the most basic routing problems, that has been studied extensively. Despite this, there are still wide gaps in our understanding of its approximability: the best currently known upper bound of $O(\\sqrt n)$ on its approximation ratio is achieved via a simple greedy algorithm, while the best current negative result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05520","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-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMXKMD1eb1vvt4sl5vULaokfu7N/+cZ7Qof1eW7rOhJlVOMBsRJbkh52W+jOqbZZdJbDyCR3sn1oOqcvGkptAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:12:59.400953Z"},"content_sha256":"2dae65f9e1f6b9bc1114a3ce191e002af799677271883cf0c8753b2dc9b3e3af","schema_version":"1.0","event_id":"sha256:2dae65f9e1f6b9bc1114a3ce191e002af799677271883cf0c8753b2dc9b3e3af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AB2BJOWBLT23YVZSN4RN43XSBG/bundle.json","state_url":"https://pith.science/pith/AB2BJOWBLT23YVZSN4RN43XSBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AB2BJOWBLT23YVZSN4RN43XSBG/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:12:59Z","links":{"resolver":"https://pith.science/pith/AB2BJOWBLT23YVZSN4RN43XSBG","bundle":"https://pith.science/pith/AB2BJOWBLT23YVZSN4RN43XSBG/bundle.json","state":"https://pith.science/pith/AB2BJOWBLT23YVZSN4RN43XSBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AB2BJOWBLT23YVZSN4RN43XSBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AB2BJOWBLT23YVZSN4RN43XSBG","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":"6e2caeae6e2b884da1d3a481f1763f56a5f205280d9e9048e0d038388462a2c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T14:57:12Z","title_canon_sha256":"30747ae44c4516e2138c6740cd5c14b8e8e16ad5e48cc5a722ee733e467fdbca"},"schema_version":"1.0","source":{"id":"1603.05520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05520","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05520v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05520","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"AB2BJOWBLT23","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"AB2BJOWBLT23YVZS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"AB2BJOWB","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:2dae65f9e1f6b9bc1114a3ce191e002af799677271883cf0c8753b2dc9b3e3af","target":"graph","created_at":"2026-05-18T01:18:56Z","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 $n$-vertex graph $G$ and a collection $M=\\{(s_1,t_1),\\ldots,(s_k,t_k)\\}$ of pairs of vertices of $G$ called demand pairs, find a maximum-cardinality set of node-disjoint paths connecting the demand pairs. NDP is one of the most basic routing problems, that has been studied extensively. Despite this, there are still wide gaps in our understanding of its approximability: the best currently known upper bound of $O(\\sqrt n)$ on its approximation ratio is achieved via a simple greedy algorithm, while the best current negative result","authors_text":"David H. K. Kim, Julia Chuzhoy, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T14:57:12Z","title":"Improved Approximation for Node-Disjoint Paths in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05520","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:99161367fa5abe6617c280342ddf6c4aa0d97c7de2eaf9c82198c789fdaac3da","target":"record","created_at":"2026-05-18T01:18:56Z","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":"6e2caeae6e2b884da1d3a481f1763f56a5f205280d9e9048e0d038388462a2c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T14:57:12Z","title_canon_sha256":"30747ae44c4516e2138c6740cd5c14b8e8e16ad5e48cc5a722ee733e467fdbca"},"schema_version":"1.0","source":{"id":"1603.05520","kind":"arxiv","version":1}},"canonical_sha256":"007414bac15cf5bc57326f22de6ef2098da07d7b84fd7cac15d86bcd2305a907","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"007414bac15cf5bc57326f22de6ef2098da07d7b84fd7cac15d86bcd2305a907","first_computed_at":"2026-05-18T01:18:56.167753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:56.167753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5kaiNn1advs4IFj9vYBWqy7lZv4lxz159oiItKFi79pBoxjGEZovoXXojiweo70h1T1NSAXgpTCTd0Z3EfOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:56.168248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99161367fa5abe6617c280342ddf6c4aa0d97c7de2eaf9c82198c789fdaac3da","sha256:2dae65f9e1f6b9bc1114a3ce191e002af799677271883cf0c8753b2dc9b3e3af"],"state_sha256":"4f77ecd68cd6d4068a2a20557e926ad965698d1dacc28256f1b254e6cf08eec1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qq/4osqbFnWhIyC7/qkNYHLK73bJq2o94Wdr9PwLOkTqjusYxpvGtQcxm4ERBBW7wcE2jbfMcJbAyHCdxIWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:12:59.402906Z","bundle_sha256":"270ed72cdcd2477021ff499eacfb5ecb1dc0fa62eb31103d48320cc09f5b3bd8"}}