{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GPTG2DRF7AUPKJZ2C2VVM2CJKA","short_pith_number":"pith:GPTG2DRF","schema_version":"1.0","canonical_sha256":"33e66d0e25f828f5273a16ab5668495017a2a038630e73f815bbe27ecdf4f89e","source":{"kind":"arxiv","id":"1603.06972","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.06972","created_at":"2026-05-17T23:51:40.021603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06972v1","created_at":"2026-05-17T23:51:40.021603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06972","created_at":"2026-05-17T23:51:40.021603+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPTG2DRF7AUP","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPTG2DRF7AUPKJZ2","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPTG2DRF","created_at":"2026-05-18T12:30:19.053100+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/GPTG2DRF7AUPKJZ2C2VVM2CJKA","json":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA.json","graph_json":"https://pith.science/api/pith-number/GPTG2DRF7AUPKJZ2C2VVM2CJKA/graph.json","events_json":"https://pith.science/api/pith-number/GPTG2DRF7AUPKJZ2C2VVM2CJKA/events.json","paper":"https://pith.science/paper/GPTG2DRF"},"agent_actions":{"view_html":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA","download_json":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA.json","view_paper":"https://pith.science/paper/GPTG2DRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06972&json=true","fetch_graph":"https://pith.science/api/pith-number/GPTG2DRF7AUPKJZ2C2VVM2CJKA/graph.json","fetch_events":"https://pith.science/api/pith-number/GPTG2DRF7AUPKJZ2C2VVM2CJKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/action/storage_attestation","attest_author":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/action/author_attestation","sign_citation":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/action/citation_signature","submit_replication":"https://pith.science/pith/GPTG2DRF7AUPKJZ2C2VVM2CJKA/action/replication_record"}},"created_at":"2026-05-17T23:51:40.021603+00:00","updated_at":"2026-05-17T23:51:40.021603+00:00"}