{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XINTD5KKLXAW3T4KUO3A6YO4JE","short_pith_number":"pith:XINTD5KK","schema_version":"1.0","canonical_sha256":"ba1b31f54a5dc16dcf8aa3b60f61dc4901b1e454c99fdc1ca998ba2ab47c43ed","source":{"kind":"arxiv","id":"1304.7693","version":1},"attestation_state":"computed","paper":{"title":"The Beachcombers' Problem: Walking and Searching with Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Evangelos Kranakis, Fraser MacQuarrie, Jurek Czyzowicz, Konstantinos Georgiou, Leszek Gasieniec","submitted_at":"2013-04-29T15:48:52Z","abstract_excerpt":"We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment $[0,I]$ and a set of $n$ mobile robots $r_1,r_2,..., r_n$ placed at one of its endpoints. Each robot has a {\\em searching speed} $s_i$ and a {\\em walking speed} $w_i$, where $s_i <w_i$. We assume that each robot is aware of the number of robots of the collection and their corresponding speeds. At each time moment a robot $r_i$ either walks along a portion of the segment not exceeding its walking speed $w_i$ or searches a portion of the segment with the speed not excee"},"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":"1304.7693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T15:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"497fa667dfeb53f4c42751da24114ac2ba7e8c255fc33135aa00442fa329f82e","abstract_canon_sha256":"bc65da70939ed4cdf81c897a8ad4eaf6c92e28cc4089953fd25ed5d52668b5cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.343483Z","signature_b64":"2dgzBMkZZn8g/FDPBOa1YnirAQrHAw9fkFfYy6e9asLW+73iTYgiP/xaf0ezdlz71yq6fqOgLFGMZnQOAgQADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba1b31f54a5dc16dcf8aa3b60f61dc4901b1e454c99fdc1ca998ba2ab47c43ed","last_reissued_at":"2026-05-18T03:26:53.342669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.342669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Beachcombers' Problem: Walking and Searching with Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Evangelos Kranakis, Fraser MacQuarrie, Jurek Czyzowicz, Konstantinos Georgiou, Leszek Gasieniec","submitted_at":"2013-04-29T15:48:52Z","abstract_excerpt":"We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment $[0,I]$ and a set of $n$ mobile robots $r_1,r_2,..., r_n$ placed at one of its endpoints. Each robot has a {\\em searching speed} $s_i$ and a {\\em walking speed} $w_i$, where $s_i <w_i$. We assume that each robot is aware of the number of robots of the collection and their corresponding speeds. At each time moment a robot $r_i$ either walks along a portion of the segment not exceeding its walking speed $w_i$ or searches a portion of the segment with the speed not excee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7693","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":"1304.7693","created_at":"2026-05-18T03:26:53.342803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7693v1","created_at":"2026-05-18T03:26:53.342803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7693","created_at":"2026-05-18T03:26:53.342803+00:00"},{"alias_kind":"pith_short_12","alias_value":"XINTD5KKLXAW","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XINTD5KKLXAW3T4K","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XINTD5KK","created_at":"2026-05-18T12:28:06.772260+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/XINTD5KKLXAW3T4KUO3A6YO4JE","json":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE.json","graph_json":"https://pith.science/api/pith-number/XINTD5KKLXAW3T4KUO3A6YO4JE/graph.json","events_json":"https://pith.science/api/pith-number/XINTD5KKLXAW3T4KUO3A6YO4JE/events.json","paper":"https://pith.science/paper/XINTD5KK"},"agent_actions":{"view_html":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE","download_json":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE.json","view_paper":"https://pith.science/paper/XINTD5KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7693&json=true","fetch_graph":"https://pith.science/api/pith-number/XINTD5KKLXAW3T4KUO3A6YO4JE/graph.json","fetch_events":"https://pith.science/api/pith-number/XINTD5KKLXAW3T4KUO3A6YO4JE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/action/storage_attestation","attest_author":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/action/author_attestation","sign_citation":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/action/citation_signature","submit_replication":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/action/replication_record"}},"created_at":"2026-05-18T03:26:53.342803+00:00","updated_at":"2026-05-18T03:26:53.342803+00:00"}