{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V57JTWE42GNCO2J6UKPNLGQP4T","short_pith_number":"pith:V57JTWE4","schema_version":"1.0","canonical_sha256":"af7e99d89cd19a27693ea29ed59a0fe4c26769d31f7643f631939feadbfbed5a","source":{"kind":"arxiv","id":"1704.02380","version":2},"attestation_state":"computed","paper":{"title":"Exploring an Infinite Space with Finite Memory Scouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Jara Uitto, Lihi Cohen, Oren Louidor, Yuval Emek","submitted_at":"2017-04-07T21:43:30Z","abstract_excerpt":"Consider a small number of scouts exploring the infinite $d$-dimensional grid with the aim of hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that determines its movement (to a neighboring grid point) based on its current state. The scouts, that operate under a fully synchronous schedule, communicate with each other (in a way that affects their respective states) when they share the same grid point and operate independently otherwise. Our main research question is: How many scouts are required to guarantee that the target admits a finite mean hitting"},"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":"1704.02380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-07T21:43:30Z","cross_cats_sorted":["cs.DC","cs.DS","math.CO"],"title_canon_sha256":"fdfd6737316dbc889dd3c512a2e52d543b0e68a4ab1e49c0ce5a8ea5f3a41314","abstract_canon_sha256":"87b5b9b5c68daf44fc29ea30669a4ab87e7c07fdb9481af6339e782a8c8711b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:34.165348Z","signature_b64":"x9n2PNKoXhd1B79zc4lV/pdLko8RKwPsEpCpySiREQcDCfZs/XbBU0C12wcvKZsFzTd/G6jYxC7/bR6KUtDADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7e99d89cd19a27693ea29ed59a0fe4c26769d31f7643f631939feadbfbed5a","last_reissued_at":"2026-05-18T00:46:34.164619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:34.164619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring an Infinite Space with Finite Memory Scouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Jara Uitto, Lihi Cohen, Oren Louidor, Yuval Emek","submitted_at":"2017-04-07T21:43:30Z","abstract_excerpt":"Consider a small number of scouts exploring the infinite $d$-dimensional grid with the aim of hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that determines its movement (to a neighboring grid point) based on its current state. The scouts, that operate under a fully synchronous schedule, communicate with each other (in a way that affects their respective states) when they share the same grid point and operate independently otherwise. Our main research question is: How many scouts are required to guarantee that the target admits a finite mean hitting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02380","kind":"arxiv","version":2},"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":"1704.02380","created_at":"2026-05-18T00:46:34.164752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02380v2","created_at":"2026-05-18T00:46:34.164752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02380","created_at":"2026-05-18T00:46:34.164752+00:00"},{"alias_kind":"pith_short_12","alias_value":"V57JTWE42GNC","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V57JTWE42GNCO2J6","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V57JTWE4","created_at":"2026-05-18T12:31:49.984773+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/V57JTWE42GNCO2J6UKPNLGQP4T","json":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T.json","graph_json":"https://pith.science/api/pith-number/V57JTWE42GNCO2J6UKPNLGQP4T/graph.json","events_json":"https://pith.science/api/pith-number/V57JTWE42GNCO2J6UKPNLGQP4T/events.json","paper":"https://pith.science/paper/V57JTWE4"},"agent_actions":{"view_html":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T","download_json":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T.json","view_paper":"https://pith.science/paper/V57JTWE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02380&json=true","fetch_graph":"https://pith.science/api/pith-number/V57JTWE42GNCO2J6UKPNLGQP4T/graph.json","fetch_events":"https://pith.science/api/pith-number/V57JTWE42GNCO2J6UKPNLGQP4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/action/storage_attestation","attest_author":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/action/author_attestation","sign_citation":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/action/citation_signature","submit_replication":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/action/replication_record"}},"created_at":"2026-05-18T00:46:34.164752+00:00","updated_at":"2026-05-18T00:46:34.164752+00:00"}