{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:37BQJUB75G3GRYZ6CMQUSDTK63","short_pith_number":"pith:37BQJUB7","schema_version":"1.0","canonical_sha256":"dfc304d03fe9b668e33e1321490e6af6f3e9aac08b9ef13527592df6a32b2676","source":{"kind":"arxiv","id":"1604.05972","version":1},"attestation_state":"computed","paper":{"title":"Optimal online escape path against a certificate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CG","authors_text":"David K\\\"ubel, Elmar Langetepe","submitted_at":"2016-04-20T14:21:16Z","abstract_excerpt":"More than fifty years ago, Bellman asked for the best escape path within a known forest but for an unknown starting position. This deterministic finite path is the shortest path that leads out of a given environment from any starting point. There are some worst case positions where the full path length is required. Up to now such a fixed ultimate optimal escape path for a known shape for any starting position is only known for some special convex shapes (i.e., circles, strips of a given width, fat convex bodies, some isosceles triangles). Therefore, we introduce a different, simple and intuiti"},"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":"1604.05972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-20T14:21:16Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8e43dd470464355a07c0e3a41409376f3a14cb88516cc2628af75064c48d5374","abstract_canon_sha256":"3656a76a1d193cc88ea4584f0b81fc3cef3e6fcecdabb02d10e83a21b261b2f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:34.061269Z","signature_b64":"5YzXOL/kYFQ5EXN+T/fYgMe7V+nReUpNac0nt5Z7zeLzW7AgKfmBrZ07d2PtTv2bsmbIZewe45pNg/EsfVSMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfc304d03fe9b668e33e1321490e6af6f3e9aac08b9ef13527592df6a32b2676","last_reissued_at":"2026-05-18T01:16:34.060543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:34.060543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal online escape path against a certificate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CG","authors_text":"David K\\\"ubel, Elmar Langetepe","submitted_at":"2016-04-20T14:21:16Z","abstract_excerpt":"More than fifty years ago, Bellman asked for the best escape path within a known forest but for an unknown starting position. This deterministic finite path is the shortest path that leads out of a given environment from any starting point. There are some worst case positions where the full path length is required. Up to now such a fixed ultimate optimal escape path for a known shape for any starting position is only known for some special convex shapes (i.e., circles, strips of a given width, fat convex bodies, some isosceles triangles). Therefore, we introduce a different, simple and intuiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05972","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":"1604.05972","created_at":"2026-05-18T01:16:34.060664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05972v1","created_at":"2026-05-18T01:16:34.060664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05972","created_at":"2026-05-18T01:16:34.060664+00:00"},{"alias_kind":"pith_short_12","alias_value":"37BQJUB75G3G","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"37BQJUB75G3GRYZ6","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"37BQJUB7","created_at":"2026-05-18T12:29:55.572404+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/37BQJUB75G3GRYZ6CMQUSDTK63","json":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63.json","graph_json":"https://pith.science/api/pith-number/37BQJUB75G3GRYZ6CMQUSDTK63/graph.json","events_json":"https://pith.science/api/pith-number/37BQJUB75G3GRYZ6CMQUSDTK63/events.json","paper":"https://pith.science/paper/37BQJUB7"},"agent_actions":{"view_html":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63","download_json":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63.json","view_paper":"https://pith.science/paper/37BQJUB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05972&json=true","fetch_graph":"https://pith.science/api/pith-number/37BQJUB75G3GRYZ6CMQUSDTK63/graph.json","fetch_events":"https://pith.science/api/pith-number/37BQJUB75G3GRYZ6CMQUSDTK63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63/action/storage_attestation","attest_author":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63/action/author_attestation","sign_citation":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63/action/citation_signature","submit_replication":"https://pith.science/pith/37BQJUB75G3GRYZ6CMQUSDTK63/action/replication_record"}},"created_at":"2026-05-18T01:16:34.060664+00:00","updated_at":"2026-05-18T01:16:34.060664+00:00"}