{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:UBEABXFH6QRSV75UC46CCY5LNR","short_pith_number":"pith:UBEABXFH","schema_version":"1.0","canonical_sha256":"a04800dca7f4232affb4173c2163ab6c43c89493026d1d787101533feb907ab6","source":{"kind":"arxiv","id":"0909.1048","version":1},"attestation_state":"computed","paper":{"title":"Efficient search by optimized intermittent random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"cond-mat.stat-mech","authors_text":"2), (2) LPTMC, (3) Department of Chemistry, (4) Instituto de Fisica de Cantabria, (5) United Technologies Research Center, Biochemistry, East Hartford, France, Gleb Oshanin (1, Horacio S Wio (4), Independent University of Moscow, Katja Lindenberg (3), Paris, Russia, Santander, Sergei Burlatsky (5) ((1)Laboratory J.-V. Poncelet, Spain, University of California at San Diego, University Pierre & Marie Curie/CNRS, USA, USA)","submitted_at":"2009-09-05T18:42:32Z","abstract_excerpt":"We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability \"alpha\", or go off lattice with probability \"1 - \\alpha\" to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering \"alpha\" and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P_N that the targ"},"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":"0909.1048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-09-05T18:42:32Z","cross_cats_sorted":["math.PR","q-bio.PE"],"title_canon_sha256":"8ba712560b9b89237bcd7692f90f5a239bc175711fff48d21eb5f0ae44819e91","abstract_canon_sha256":"6beedfd47c615dc8f1afb3aad2236df2521dd0cac3735db7aca247027e03d547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:59.429361Z","signature_b64":"0jHxpycnUsFZMvMiy3JYvZS0zfmO3uMYaJLANAJS/iBhURf6KENZNbcxsRFIIxoa2pRhND8//hfIcITRGiYkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a04800dca7f4232affb4173c2163ab6c43c89493026d1d787101533feb907ab6","last_reissued_at":"2026-05-18T02:11:59.428775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:59.428775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient search by optimized intermittent random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"cond-mat.stat-mech","authors_text":"2), (2) LPTMC, (3) Department of Chemistry, (4) Instituto de Fisica de Cantabria, (5) United Technologies Research Center, Biochemistry, East Hartford, France, Gleb Oshanin (1, Horacio S Wio (4), Independent University of Moscow, Katja Lindenberg (3), Paris, Russia, Santander, Sergei Burlatsky (5) ((1)Laboratory J.-V. Poncelet, Spain, University of California at San Diego, University Pierre & Marie Curie/CNRS, USA, USA)","submitted_at":"2009-09-05T18:42:32Z","abstract_excerpt":"We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability \"alpha\", or go off lattice with probability \"1 - \\alpha\" to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering \"alpha\" and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P_N that the targ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1048","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":"0909.1048","created_at":"2026-05-18T02:11:59.428875+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.1048v1","created_at":"2026-05-18T02:11:59.428875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1048","created_at":"2026-05-18T02:11:59.428875+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBEABXFH6QRS","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBEABXFH6QRSV75U","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBEABXFH","created_at":"2026-05-18T12:26:02.257875+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/UBEABXFH6QRSV75UC46CCY5LNR","json":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR.json","graph_json":"https://pith.science/api/pith-number/UBEABXFH6QRSV75UC46CCY5LNR/graph.json","events_json":"https://pith.science/api/pith-number/UBEABXFH6QRSV75UC46CCY5LNR/events.json","paper":"https://pith.science/paper/UBEABXFH"},"agent_actions":{"view_html":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR","download_json":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR.json","view_paper":"https://pith.science/paper/UBEABXFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.1048&json=true","fetch_graph":"https://pith.science/api/pith-number/UBEABXFH6QRSV75UC46CCY5LNR/graph.json","fetch_events":"https://pith.science/api/pith-number/UBEABXFH6QRSV75UC46CCY5LNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR/action/storage_attestation","attest_author":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR/action/author_attestation","sign_citation":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR/action/citation_signature","submit_replication":"https://pith.science/pith/UBEABXFH6QRSV75UC46CCY5LNR/action/replication_record"}},"created_at":"2026-05-18T02:11:59.428875+00:00","updated_at":"2026-05-18T02:11:59.428875+00:00"}