{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D3SZ422BZWCOWA42VGWAMXTOV6","short_pith_number":"pith:D3SZ422B","canonical_record":{"source":{"id":"1812.04825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-12T06:37:32Z","cross_cats_sorted":[],"title_canon_sha256":"40c3d5e3c5f47c00ec25d7e7e296a3f1a2fb5a4101058e1800ee83675a9a8b26","abstract_canon_sha256":"35688908f5cbb1d81e6043cb9199f967d4e03d58337f8020d4d3f2fcec9b67c1"},"schema_version":"1.0"},"canonical_sha256":"1ee59e6b41cd84eb039aa9ac065e6eaf8b37b3f9b0d718fe6bae64291b6596c4","source":{"kind":"arxiv","id":"1812.04825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04825","created_at":"2026-05-17T23:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04825v1","created_at":"2026-05-17T23:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04825","created_at":"2026-05-17T23:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"D3SZ422BZWCO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D3SZ422BZWCOWA42","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D3SZ422B","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D3SZ422BZWCOWA42VGWAMXTOV6","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-12T06:37:32Z","cross_cats_sorted":[],"title_canon_sha256":"40c3d5e3c5f47c00ec25d7e7e296a3f1a2fb5a4101058e1800ee83675a9a8b26","abstract_canon_sha256":"35688908f5cbb1d81e6043cb9199f967d4e03d58337f8020d4d3f2fcec9b67c1"},"schema_version":"1.0"},"canonical_sha256":"1ee59e6b41cd84eb039aa9ac065e6eaf8b37b3f9b0d718fe6bae64291b6596c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:27.249303Z","signature_b64":"Ej1bFX23AOMeD1JndCYSVmvk9VwIx7lILwsl2cYUYKPplt48KdNp16G5sSpmjKHS8rHz9elCMWHZpAjUnvCcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee59e6b41cd84eb039aa9ac065e6eaf8b37b3f9b0d718fe6bae64291b6596c4","last_reissued_at":"2026-05-17T23:58:27.248609Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:27.248609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04825","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-17T23:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4Rps3PnUO1Eu56IpZmrITtYeWiOibaG4twVKKBnIBduaWv3QAdYFlaaCc9NiBxraixF+XYMxL8fqkzQqgfqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:17:49.346380Z"},"content_sha256":"9d89596deaf34eca8edbbc4c51ba300e123a164fb4d9de41dbab67ab2405c007","schema_version":"1.0","event_id":"sha256:9d89596deaf34eca8edbbc4c51ba300e123a164fb4d9de41dbab67ab2405c007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D3SZ422BZWCOWA42VGWAMXTOV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"L\\'evy Flight Foraging Hypothesis-based Autonomous Memoryless Search Under Sparse Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christos Papachristos, Kostas Alexis","submitted_at":"2018-12-12T06:37:32Z","abstract_excerpt":"Autonomous robots are commonly tasked with the problem of area exploration and search for certain targets or artifacts of interest to be tracked. Traditionally, the problem formulation considered is that of complete search and thus - ideally - identification of all targets of interest. An important problem however which is not often addressed is that of time-efficient memoryless search under sparse rewards that may be worth visited any number of items. In this paper we specifically address the largely understudied problem of optimizing the \"time-of-arrival\" or \"time-of-detection\" to roboticall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04825","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-17T23:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W88BlRA9aCg0++sFqptXVmBxDISkjpApFYaLA3vfE+qOGBHUeXXjzour/Y/gnkeAT3F3GhdD8XI6nNzjVAP8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:17:49.346725Z"},"content_sha256":"0b4a01ebfc163c73ae62eb8d6fb9058e991c4fb6981a24f1fe4724692bd47049","schema_version":"1.0","event_id":"sha256:0b4a01ebfc163c73ae62eb8d6fb9058e991c4fb6981a24f1fe4724692bd47049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3SZ422BZWCOWA42VGWAMXTOV6/bundle.json","state_url":"https://pith.science/pith/D3SZ422BZWCOWA42VGWAMXTOV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3SZ422BZWCOWA42VGWAMXTOV6/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-03T23:17:49Z","links":{"resolver":"https://pith.science/pith/D3SZ422BZWCOWA42VGWAMXTOV6","bundle":"https://pith.science/pith/D3SZ422BZWCOWA42VGWAMXTOV6/bundle.json","state":"https://pith.science/pith/D3SZ422BZWCOWA42VGWAMXTOV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3SZ422BZWCOWA42VGWAMXTOV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D3SZ422BZWCOWA42VGWAMXTOV6","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":"35688908f5cbb1d81e6043cb9199f967d4e03d58337f8020d4d3f2fcec9b67c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-12T06:37:32Z","title_canon_sha256":"40c3d5e3c5f47c00ec25d7e7e296a3f1a2fb5a4101058e1800ee83675a9a8b26"},"schema_version":"1.0","source":{"id":"1812.04825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04825","created_at":"2026-05-17T23:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04825v1","created_at":"2026-05-17T23:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04825","created_at":"2026-05-17T23:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"D3SZ422BZWCO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D3SZ422BZWCOWA42","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D3SZ422B","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:0b4a01ebfc163c73ae62eb8d6fb9058e991c4fb6981a24f1fe4724692bd47049","target":"graph","created_at":"2026-05-17T23:58:27Z","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":"Autonomous robots are commonly tasked with the problem of area exploration and search for certain targets or artifacts of interest to be tracked. Traditionally, the problem formulation considered is that of complete search and thus - ideally - identification of all targets of interest. An important problem however which is not often addressed is that of time-efficient memoryless search under sparse rewards that may be worth visited any number of items. In this paper we specifically address the largely understudied problem of optimizing the \"time-of-arrival\" or \"time-of-detection\" to roboticall","authors_text":"Christos Papachristos, Kostas Alexis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-12T06:37:32Z","title":"L\\'evy Flight Foraging Hypothesis-based Autonomous Memoryless Search Under Sparse Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04825","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:9d89596deaf34eca8edbbc4c51ba300e123a164fb4d9de41dbab67ab2405c007","target":"record","created_at":"2026-05-17T23:58:27Z","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":"35688908f5cbb1d81e6043cb9199f967d4e03d58337f8020d4d3f2fcec9b67c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-12T06:37:32Z","title_canon_sha256":"40c3d5e3c5f47c00ec25d7e7e296a3f1a2fb5a4101058e1800ee83675a9a8b26"},"schema_version":"1.0","source":{"id":"1812.04825","kind":"arxiv","version":1}},"canonical_sha256":"1ee59e6b41cd84eb039aa9ac065e6eaf8b37b3f9b0d718fe6bae64291b6596c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee59e6b41cd84eb039aa9ac065e6eaf8b37b3f9b0d718fe6bae64291b6596c4","first_computed_at":"2026-05-17T23:58:27.248609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:27.248609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ej1bFX23AOMeD1JndCYSVmvk9VwIx7lILwsl2cYUYKPplt48KdNp16G5sSpmjKHS8rHz9elCMWHZpAjUnvCcDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:27.249303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d89596deaf34eca8edbbc4c51ba300e123a164fb4d9de41dbab67ab2405c007","sha256:0b4a01ebfc163c73ae62eb8d6fb9058e991c4fb6981a24f1fe4724692bd47049"],"state_sha256":"b6726a17c9aae2b8a9b1321ee9d6bd4d978eb1f539cf7644f351d5e2e1d49083"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExbmdtOEp9jHxNXxmAg8WXre8FctOrPzuW/40jQo+HIfdMbg5RQJkybZpxt6U2Mfui/cvE4yErzG+aUwoK4FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:17:49.348632Z","bundle_sha256":"70887c76303f1107aa7edb757aff352cb47c565545ca67df6a9abd05b2ac17ed"}}