{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RYJ3HUOGY2FOTMXOKO3ZA4GVKH","short_pith_number":"pith:RYJ3HUOG","schema_version":"1.0","canonical_sha256":"8e13b3d1c6c68ae9b2ee53b79070d551e6d2174d247bbcdda7b858f9369665fd","source":{"kind":"arxiv","id":"1606.08023","version":1},"attestation_state":"computed","paper":{"title":"Searching with Advice: Robot Fence-Jumping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexandra Steau, Evangelos Kranakis, Konstantinos Georgiou","submitted_at":"2016-06-26T11:25:47Z","abstract_excerpt":"We study a new search problem on the plane involving a robot and an immobile treasure, initially placed at distance $1$ from each other. The length $\\beta$ of an arc (a fence) within the perimeter of the corresponding circle, as well as the promise that the treasure is outside the fence, is given as part of the input. The goal is to device movement trajectories so that the robot locates the treasure in minimum time. Notably, although the presence of the fence limits searching uncertainty, the location of the fence is unknown, and in the worst case analysis is determined adversarially. Neverthe"},"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":"1606.08023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-26T11:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"0b6db078b14e70e98d04eceff48b2303fe73f399caa2a3b9a6572ac38a8cd339","abstract_canon_sha256":"101d95e090e9281e0e3755d14810601e1b19882576f3319db2a8add76fc66d34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:53.966546Z","signature_b64":"K71ZwRYTsPuxraO8vANIcbc1W5RGmW5c2a/nCsd9tIejZo796oymmfxabj/nIVMhstuBDcYZbkwp1QG2mpU6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e13b3d1c6c68ae9b2ee53b79070d551e6d2174d247bbcdda7b858f9369665fd","last_reissued_at":"2026-05-18T01:11:53.966202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:53.966202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching with Advice: Robot Fence-Jumping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexandra Steau, Evangelos Kranakis, Konstantinos Georgiou","submitted_at":"2016-06-26T11:25:47Z","abstract_excerpt":"We study a new search problem on the plane involving a robot and an immobile treasure, initially placed at distance $1$ from each other. The length $\\beta$ of an arc (a fence) within the perimeter of the corresponding circle, as well as the promise that the treasure is outside the fence, is given as part of the input. The goal is to device movement trajectories so that the robot locates the treasure in minimum time. Notably, although the presence of the fence limits searching uncertainty, the location of the fence is unknown, and in the worst case analysis is determined adversarially. Neverthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08023","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":"1606.08023","created_at":"2026-05-18T01:11:53.966259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08023v1","created_at":"2026-05-18T01:11:53.966259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08023","created_at":"2026-05-18T01:11:53.966259+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYJ3HUOGY2FO","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYJ3HUOGY2FOTMXO","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYJ3HUOG","created_at":"2026-05-18T12:30:41.710351+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/RYJ3HUOGY2FOTMXOKO3ZA4GVKH","json":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH.json","graph_json":"https://pith.science/api/pith-number/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/graph.json","events_json":"https://pith.science/api/pith-number/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/events.json","paper":"https://pith.science/paper/RYJ3HUOG"},"agent_actions":{"view_html":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH","download_json":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH.json","view_paper":"https://pith.science/paper/RYJ3HUOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08023&json=true","fetch_graph":"https://pith.science/api/pith-number/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/graph.json","fetch_events":"https://pith.science/api/pith-number/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/action/storage_attestation","attest_author":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/action/author_attestation","sign_citation":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/action/citation_signature","submit_replication":"https://pith.science/pith/RYJ3HUOGY2FOTMXOKO3ZA4GVKH/action/replication_record"}},"created_at":"2026-05-18T01:11:53.966259+00:00","updated_at":"2026-05-18T01:11:53.966259+00:00"}