{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q2BBQAAE4DRVV4CKFUPF7DRYPT","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":"4c7941b186ea6c269fcb732bdeef52478742a185ad4d05f6a5a154613f00cb55","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-11T21:46:36Z","title_canon_sha256":"b982d7b1af8109031535999b1806ae00e4aef6d2556473e7a6bddc301e52806a"},"schema_version":"1.0","source":{"id":"1712.04043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04043","created_at":"2026-05-18T00:28:09Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04043v1","created_at":"2026-05-18T00:28:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04043","created_at":"2026-05-18T00:28:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q2BBQAAE4DRV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2BBQAAE4DRVV4CK","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2BBQAAE","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:3fa6e16ba4a1cf5905ca5bff62dbfdc27f89b44d5ad1c9e1075e8aa94dc81228","target":"graph","created_at":"2026-05-18T00:28:09Z","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":"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","authors_text":"Eduard Eiben, Iyad Kanj","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-11T21:46:36Z","title":"How to navigate through obstacles?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04043","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:920ed6bed26979aa44af70ec1031770c077c3fcf7d0da959cc2a84913c8b765c","target":"record","created_at":"2026-05-18T00:28:09Z","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":"4c7941b186ea6c269fcb732bdeef52478742a185ad4d05f6a5a154613f00cb55","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-11T21:46:36Z","title_canon_sha256":"b982d7b1af8109031535999b1806ae00e4aef6d2556473e7a6bddc301e52806a"},"schema_version":"1.0","source":{"id":"1712.04043","kind":"arxiv","version":1}},"canonical_sha256":"8682180004e0e35af04a2d1e5f8e387cc8a850e83cddfae3cfb8cbc6fea5f316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8682180004e0e35af04a2d1e5f8e387cc8a850e83cddfae3cfb8cbc6fea5f316","first_computed_at":"2026-05-18T00:28:09.422671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:09.422671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hejKE8d140vdB6ZrtJir1N1mNjuKVp4Y2s0bu9bwyczLPeygGJNqpNrF6IEjexkiU+WozTvaXVuGX+BUGrYAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:09.423477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:920ed6bed26979aa44af70ec1031770c077c3fcf7d0da959cc2a84913c8b765c","sha256:3fa6e16ba4a1cf5905ca5bff62dbfdc27f89b44d5ad1c9e1075e8aa94dc81228"],"state_sha256":"55f9e5be29d0e5e7a0d5a1df5a9956a4fceb184767f67158d98d025ee8a1e872"}