{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GPTG2DRF7AUPKJZ2C2VVM2CJKA","short_pith_number":"pith:GPTG2DRF","canonical_record":{"source":{"id":"1603.06972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-22T20:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"aa914246a952d4a67357feafa7c8ea2fb313108532ef3d29be470603580c70be","abstract_canon_sha256":"686d7e3e949a6d8160cd0594fa820f1e10a775bfc7092f71c7aa37e23733d385"},"schema_version":"1.0"},"canonical_sha256":"33e66d0e25f828f5273a16ab5668495017a2a038630e73f815bbe27ecdf4f89e","source":{"kind":"arxiv","id":"1603.06972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06972","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06972v1","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06972","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"GPTG2DRF7AUP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GPTG2DRF7AUPKJZ2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GPTG2DRF","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GPTG2DRF7AUPKJZ2C2VVM2CJKA","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-22T20:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"aa914246a952d4a67357feafa7c8ea2fb313108532ef3d29be470603580c70be","abstract_canon_sha256":"686d7e3e949a6d8160cd0594fa820f1e10a775bfc7092f71c7aa37e23733d385"},"schema_version":"1.0"},"canonical_sha256":"33e66d0e25f828f5273a16ab5668495017a2a038630e73f815bbe27ecdf4f89e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:40.022136Z","signature_b64":"jQeAVVvskKrA9nO0SGtGu6+S43iYtKWgONlUdz54SmKL3nVCTttJPEvdARjX5iZqvBJ1Knps77aH4VyywKedDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33e66d0e25f828f5273a16ab5668495017a2a038630e73f815bbe27ecdf4f89e","last_reissued_at":"2026-05-17T23:51:40.021499Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:40.021499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06972","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-17T23:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bPn6iqJ828v9CZ7jnZeboruOxdpEXZhaO0yfl4FrYoKec9qOFul09VJbJCssDhw3PIS8ZVBnx9mo6VMhJEWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:04:35.754331Z"},"content_sha256":"59156666f26502317d015b447a28714ca5146192ab25f83c24951d566645d273","schema_version":"1.0","event_id":"sha256:59156666f26502317d015b447a28714ca5146192ab25f83c24951d566645d273"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GPTG2DRF7AUPKJZ2C2VVM2CJKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of minimum-link path problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Irina Kostitsyna, Maarten L\\\"offler, Valentin Polishchuk","submitted_at":"2016-03-22T20:41:16Z","abstract_excerpt":"We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are restricted to lie on the boundary of the domain, or can be in its interior. Our results include bit complexity bounds, a novel general hardness construction, and a polynomial-time approximation scheme. We fully characterize the situation in 2D, and provide first results in dimensions 3 and higher for several variants of the problem.\n  Concretely, our results resolve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06972","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-17T23:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30rsbkUSPtomT3ehI3s/L70oU5JNzRV5QhT3XBcgqh7w/Cjj4kW6+9IQUA+K5lpgk68RharTzK2EjONJStVwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:04:35.755126Z"},"content_sha256":"8af26c486eaafc66b5a046c9456fe4f0996ee05775b8da94da9fac7d77f8b0fa","schema_version":"1.0","event_id":"sha256:8af26c486eaafc66b5a046c9456fe4f0996ee05775b8da94da9fac7d77f8b0fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/bundle.json","state_url":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/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-09T06:04:35Z","links":{"resolver":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA","bundle":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/bundle.json","state":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GPTG2DRF7AUPKJZ2C2VVM2CJKA","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":"686d7e3e949a6d8160cd0594fa820f1e10a775bfc7092f71c7aa37e23733d385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-22T20:41:16Z","title_canon_sha256":"aa914246a952d4a67357feafa7c8ea2fb313108532ef3d29be470603580c70be"},"schema_version":"1.0","source":{"id":"1603.06972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06972","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06972v1","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06972","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"GPTG2DRF7AUP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GPTG2DRF7AUPKJZ2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GPTG2DRF","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:8af26c486eaafc66b5a046c9456fe4f0996ee05775b8da94da9fac7d77f8b0fa","target":"graph","created_at":"2026-05-17T23:51:40Z","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 revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are restricted to lie on the boundary of the domain, or can be in its interior. Our results include bit complexity bounds, a novel general hardness construction, and a polynomial-time approximation scheme. We fully characterize the situation in 2D, and provide first results in dimensions 3 and higher for several variants of the problem.\n  Concretely, our results resolve","authors_text":"Frank Staals, Irina Kostitsyna, Maarten L\\\"offler, Valentin Polishchuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-22T20:41:16Z","title":"On the complexity of minimum-link path problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06972","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:59156666f26502317d015b447a28714ca5146192ab25f83c24951d566645d273","target":"record","created_at":"2026-05-17T23:51:40Z","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":"686d7e3e949a6d8160cd0594fa820f1e10a775bfc7092f71c7aa37e23733d385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-22T20:41:16Z","title_canon_sha256":"aa914246a952d4a67357feafa7c8ea2fb313108532ef3d29be470603580c70be"},"schema_version":"1.0","source":{"id":"1603.06972","kind":"arxiv","version":1}},"canonical_sha256":"33e66d0e25f828f5273a16ab5668495017a2a038630e73f815bbe27ecdf4f89e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33e66d0e25f828f5273a16ab5668495017a2a038630e73f815bbe27ecdf4f89e","first_computed_at":"2026-05-17T23:51:40.021499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:40.021499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jQeAVVvskKrA9nO0SGtGu6+S43iYtKWgONlUdz54SmKL3nVCTttJPEvdARjX5iZqvBJ1Knps77aH4VyywKedDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:40.022136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59156666f26502317d015b447a28714ca5146192ab25f83c24951d566645d273","sha256:8af26c486eaafc66b5a046c9456fe4f0996ee05775b8da94da9fac7d77f8b0fa"],"state_sha256":"b5f1c8d8d5b370cf9119da60c457f4e8854c64efecac281fad497578b16e330d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/Hkll+HLpLtVpFHaMcZS/zSIwZq4vLfeUz3GPrBtqCjA62OpJJclcBp7IkLLjYyK7XNGQwD4iWGkouVieU5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:04:35.759204Z","bundle_sha256":"54188997ee68e90a3a079622cd2f88a6edb948791919ec00bb034301f167ba89"}}