{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V57JTWE42GNCO2J6UKPNLGQP4T","short_pith_number":"pith:V57JTWE4","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"},"canonical_sha256":"af7e99d89cd19a27693ea29ed59a0fe4c26769d31f7643f631939feadbfbed5a","source":{"kind":"arxiv","id":"1704.02380","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02380","created_at":"2026-05-18T00:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02380v2","created_at":"2026-05-18T00:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02380","created_at":"2026-05-18T00:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"V57JTWE42GNC","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V57JTWE42GNCO2J6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V57JTWE4","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V57JTWE42GNCO2J6UKPNLGQP4T","target":"record","payload":{"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"},"canonical_sha256":"af7e99d89cd19a27693ea29ed59a0fe4c26769d31f7643f631939feadbfbed5a","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"},"source_kind":"arxiv","source_id":"1704.02380","source_version":2,"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-18T00:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2NfKVyfrA4KLSrow46UYnLq0y0HAbEte8GMumpshBe5R3fYBFYTM+iTEKlsqn0gN6tOPmLMMB+kWANs5H5YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:56:25.121656Z"},"content_sha256":"060f6c60f0c256b4418bd2816a96955e7bd3e4a26c1359325f3b4cb5846bb51b","schema_version":"1.0","event_id":"sha256:060f6c60f0c256b4418bd2816a96955e7bd3e4a26c1359325f3b4cb5846bb51b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V57JTWE42GNCO2J6UKPNLGQP4T","target":"graph","payload":{"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"},"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-18T00:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgeNlFX6ji/SLpwkjd6E14JTwa2vNH+VHnMSAL+nYMch7x8epb6p+wCNTBuox7KQGcHIhhlIUcnIT8CpT2kQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:56:25.122342Z"},"content_sha256":"1322588d401bfe017424f7edfb1033ab5f71c3bd750f0ccc5f95a686eb428a92","schema_version":"1.0","event_id":"sha256:1322588d401bfe017424f7edfb1033ab5f71c3bd750f0ccc5f95a686eb428a92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/bundle.json","state_url":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V57JTWE42GNCO2J6UKPNLGQP4T/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-09T21:56:25Z","links":{"resolver":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T","bundle":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/bundle.json","state":"https://pith.science/pith/V57JTWE42GNCO2J6UKPNLGQP4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V57JTWE42GNCO2J6UKPNLGQP4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V57JTWE42GNCO2J6UKPNLGQP4T","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":"87b5b9b5c68daf44fc29ea30669a4ab87e7c07fdb9481af6339e782a8c8711b7","cross_cats_sorted":["cs.DC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-07T21:43:30Z","title_canon_sha256":"fdfd6737316dbc889dd3c512a2e52d543b0e68a4ab1e49c0ce5a8ea5f3a41314"},"schema_version":"1.0","source":{"id":"1704.02380","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02380","created_at":"2026-05-18T00:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02380v2","created_at":"2026-05-18T00:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02380","created_at":"2026-05-18T00:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"V57JTWE42GNC","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V57JTWE42GNCO2J6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V57JTWE4","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:1322588d401bfe017424f7edfb1033ab5f71c3bd750f0ccc5f95a686eb428a92","target":"graph","created_at":"2026-05-18T00:46:34Z","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":"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","authors_text":"Jara Uitto, Lihi Cohen, Oren Louidor, Yuval Emek","cross_cats":["cs.DC","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-07T21:43:30Z","title":"Exploring an Infinite Space with Finite Memory Scouts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02380","kind":"arxiv","version":2},"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:060f6c60f0c256b4418bd2816a96955e7bd3e4a26c1359325f3b4cb5846bb51b","target":"record","created_at":"2026-05-18T00:46:34Z","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":"87b5b9b5c68daf44fc29ea30669a4ab87e7c07fdb9481af6339e782a8c8711b7","cross_cats_sorted":["cs.DC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-07T21:43:30Z","title_canon_sha256":"fdfd6737316dbc889dd3c512a2e52d543b0e68a4ab1e49c0ce5a8ea5f3a41314"},"schema_version":"1.0","source":{"id":"1704.02380","kind":"arxiv","version":2}},"canonical_sha256":"af7e99d89cd19a27693ea29ed59a0fe4c26769d31f7643f631939feadbfbed5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af7e99d89cd19a27693ea29ed59a0fe4c26769d31f7643f631939feadbfbed5a","first_computed_at":"2026-05-18T00:46:34.164619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:34.164619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x9n2PNKoXhd1B79zc4lV/pdLko8RKwPsEpCpySiREQcDCfZs/XbBU0C12wcvKZsFzTd/G6jYxC7/bR6KUtDADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:34.165348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02380","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:060f6c60f0c256b4418bd2816a96955e7bd3e4a26c1359325f3b4cb5846bb51b","sha256:1322588d401bfe017424f7edfb1033ab5f71c3bd750f0ccc5f95a686eb428a92"],"state_sha256":"9db31a8bc1b8a1a866546ddf1a78070073418b9f042588d2a9c592a17f99942a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tfmj8xTgMh0vG8EDKvbWgQu+sJwVm7nB03sX9fuR3z/kLZ6oudiYC8B/ljFq4uEfBk0Ho5T2ylb6EC9JpVoOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:56:25.126259Z","bundle_sha256":"67a0111a313168c687a184dd16767eb4c143917a3dc13af238810cc8f94cada2"}}