{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XINTD5KKLXAW3T4KUO3A6YO4JE","short_pith_number":"pith:XINTD5KK","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"},"canonical_sha256":"ba1b31f54a5dc16dcf8aa3b60f61dc4901b1e454c99fdc1ca998ba2ab47c43ed","source":{"kind":"arxiv","id":"1304.7693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7693","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7693v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7693","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"XINTD5KKLXAW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XINTD5KKLXAW3T4K","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XINTD5KK","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XINTD5KKLXAW3T4KUO3A6YO4JE","target":"record","payload":{"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"},"canonical_sha256":"ba1b31f54a5dc16dcf8aa3b60f61dc4901b1e454c99fdc1ca998ba2ab47c43ed","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"},"source_kind":"arxiv","source_id":"1304.7693","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFj/JzFUuWH/e1g2Jv7WTj7X8ZZ9EfUG+4U4j8Euxvio6hrtFnJ+zZGlzJDuiweoeT9OLZJ/CnvGxxIziNfYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:58:16.449947Z"},"content_sha256":"214d008701a43ab21d273a1590b4d3cb7a4e1b6486673ee40c76c7e0d5f1de98","schema_version":"1.0","event_id":"sha256:214d008701a43ab21d273a1590b4d3cb7a4e1b6486673ee40c76c7e0d5f1de98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XINTD5KKLXAW3T4KUO3A6YO4JE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzYDjZ1o0YKDoz6itfZzqEVTGNJgwzL9FvHCmzBYeXqMO4xBANAKt21y7NnvpqANDfKrB9mbhWiMpm0X003rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:58:16.450296Z"},"content_sha256":"afe75f1bbed14c69f8885c16ecbe663d67b21b0cce7561855643eba2757cc7f1","schema_version":"1.0","event_id":"sha256:afe75f1bbed14c69f8885c16ecbe663d67b21b0cce7561855643eba2757cc7f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/bundle.json","state_url":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T18:58:16Z","links":{"resolver":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE","bundle":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/bundle.json","state":"https://pith.science/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XINTD5KKLXAW3T4KUO3A6YO4JE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XINTD5KKLXAW3T4KUO3A6YO4JE","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":"bc65da70939ed4cdf81c897a8ad4eaf6c92e28cc4089953fd25ed5d52668b5cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T15:48:52Z","title_canon_sha256":"497fa667dfeb53f4c42751da24114ac2ba7e8c255fc33135aa00442fa329f82e"},"schema_version":"1.0","source":{"id":"1304.7693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7693","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7693v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7693","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"XINTD5KKLXAW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XINTD5KKLXAW3T4K","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XINTD5KK","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:afe75f1bbed14c69f8885c16ecbe663d67b21b0cce7561855643eba2757cc7f1","target":"graph","created_at":"2026-05-18T03:26:53Z","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":"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","authors_text":"Evangelos Kranakis, Fraser MacQuarrie, Jurek Czyzowicz, Konstantinos Georgiou, Leszek Gasieniec","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T15:48:52Z","title":"The Beachcombers' Problem: Walking and Searching with Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7693","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:214d008701a43ab21d273a1590b4d3cb7a4e1b6486673ee40c76c7e0d5f1de98","target":"record","created_at":"2026-05-18T03:26:53Z","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":"bc65da70939ed4cdf81c897a8ad4eaf6c92e28cc4089953fd25ed5d52668b5cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T15:48:52Z","title_canon_sha256":"497fa667dfeb53f4c42751da24114ac2ba7e8c255fc33135aa00442fa329f82e"},"schema_version":"1.0","source":{"id":"1304.7693","kind":"arxiv","version":1}},"canonical_sha256":"ba1b31f54a5dc16dcf8aa3b60f61dc4901b1e454c99fdc1ca998ba2ab47c43ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba1b31f54a5dc16dcf8aa3b60f61dc4901b1e454c99fdc1ca998ba2ab47c43ed","first_computed_at":"2026-05-18T03:26:53.342669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.342669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2dgzBMkZZn8g/FDPBOa1YnirAQrHAw9fkFfYy6e9asLW+73iTYgiP/xaf0ezdlz71yq6fqOgLFGMZnQOAgQADA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.343483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:214d008701a43ab21d273a1590b4d3cb7a4e1b6486673ee40c76c7e0d5f1de98","sha256:afe75f1bbed14c69f8885c16ecbe663d67b21b0cce7561855643eba2757cc7f1"],"state_sha256":"650cdbfd7617850d037d2be920a8aed66817185611f94298c738c975d86b77d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1ZLVew4VGH7skuNXbkdermopIW89IXzYCI3JhiuxFq32YCTEKdL9cb3FbiH6xUaa18Fa0Q1ETsvYrShaDy7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:58:16.452241Z","bundle_sha256":"9965896830d763f706344951447d087214321d2520a949c6db8511ebe2668cbd"}}