{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q2BBQAAE4DRVV4CKFUPF7DRYPT","short_pith_number":"pith:Q2BBQAAE","schema_version":"1.0","canonical_sha256":"8682180004e0e35af04a2d1e5f8e387cc8a850e83cddfae3cfb8cbc6fea5f316","source":{"kind":"arxiv","id":"1712.04043","version":1},"attestation_state":"computed","paper":{"title":"How to navigate through obstacles?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Eduard Eiben, Iyad Kanj","submitted_at":"2017-12-11T21:46:36Z","abstract_excerpt":"Given a set of obstacles and two points, is there a path between the two points that does not cross more than $k$ different obstacles? This is a fundamental problem that has undergone a tremendous amount of work. It is known to be NP-hard, even when the obstacles are very simple geometric shapes (e.g., unit-length line segments). The problem can be generalized into the following graph problem: Given a planar graph $G$ whose vertices are colored by color sets, two designated vertices $s, t \\in V(G)$, and $k \\in \\mathbb{N}$, is there an $s$-$t$ path in $G$ that uses at most $k$ colors? If each o"},"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":"1712.04043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-11T21:46:36Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"b982d7b1af8109031535999b1806ae00e4aef6d2556473e7a6bddc301e52806a","abstract_canon_sha256":"4c7941b186ea6c269fcb732bdeef52478742a185ad4d05f6a5a154613f00cb55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:09.423477Z","signature_b64":"7hejKE8d140vdB6ZrtJir1N1mNjuKVp4Y2s0bu9bwyczLPeygGJNqpNrF6IEjexkiU+WozTvaXVuGX+BUGrYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8682180004e0e35af04a2d1e5f8e387cc8a850e83cddfae3cfb8cbc6fea5f316","last_reissued_at":"2026-05-18T00:28:09.422671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:09.422671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to navigate through obstacles?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Eduard Eiben, Iyad Kanj","submitted_at":"2017-12-11T21:46:36Z","abstract_excerpt":"Given a set of obstacles and two points, is there a path between the two points that does not cross more than $k$ different obstacles? This is a fundamental problem that has undergone a tremendous amount of work. It is known to be NP-hard, even when the obstacles are very simple geometric shapes (e.g., unit-length line segments). The problem can be generalized into the following graph problem: Given a planar graph $G$ whose vertices are colored by color sets, two designated vertices $s, t \\in V(G)$, and $k \\in \\mathbb{N}$, is there an $s$-$t$ path in $G$ that uses at most $k$ colors? If each o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04043","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":"1712.04043","created_at":"2026-05-18T00:28:09.422775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04043v1","created_at":"2026-05-18T00:28:09.422775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04043","created_at":"2026-05-18T00:28:09.422775+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2BBQAAE4DRV","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2BBQAAE4DRVV4CK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2BBQAAE","created_at":"2026-05-18T12:31:37.085036+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/Q2BBQAAE4DRVV4CKFUPF7DRYPT","json":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT.json","graph_json":"https://pith.science/api/pith-number/Q2BBQAAE4DRVV4CKFUPF7DRYPT/graph.json","events_json":"https://pith.science/api/pith-number/Q2BBQAAE4DRVV4CKFUPF7DRYPT/events.json","paper":"https://pith.science/paper/Q2BBQAAE"},"agent_actions":{"view_html":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT","download_json":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT.json","view_paper":"https://pith.science/paper/Q2BBQAAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04043&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2BBQAAE4DRVV4CKFUPF7DRYPT/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2BBQAAE4DRVV4CKFUPF7DRYPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT/action/storage_attestation","attest_author":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT/action/author_attestation","sign_citation":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT/action/citation_signature","submit_replication":"https://pith.science/pith/Q2BBQAAE4DRVV4CKFUPF7DRYPT/action/replication_record"}},"created_at":"2026-05-18T00:28:09.422775+00:00","updated_at":"2026-05-18T00:28:09.422775+00:00"}