{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XTLK625QM7HQDG5QNJQRCNW4XM","short_pith_number":"pith:XTLK625Q","schema_version":"1.0","canonical_sha256":"bcd6af6bb067cf019bb06a611136dcbb0580255b51835637ee8212a4afab8e94","source":{"kind":"arxiv","id":"1609.03754","version":1},"attestation_state":"computed","paper":{"title":"Efficiency of a Stochastic Search with Punctual and Costly Restarts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"q-bio.QM","authors_text":"Kabir Husain, Sandeep Krishna","submitted_at":"2016-09-13T10:28:26Z","abstract_excerpt":"The mean completion time of a stochastic process may be rendered finite and minimised by a judiciously chosen restart protocol, which may either be stochastic or deterministic. Here we study analytically an arbitrary stochastic search subject to an arbitrary restart protocol, each characterised by a distribution of waiting times. By a direct enumeration of paths we construct the joint distribution of completion time and restart number, in a form amenable to analytical evaluation or quadrature; thereby we optimise the search over both time and potentially costly restart events. Analysing the ef"},"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":"1609.03754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-09-13T10:28:26Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"f5f48467251e7635a8232b02c25122184f23a3bb887a46f9666f5a95e0ab8f5f","abstract_canon_sha256":"d7450ddc8d1c092beda0d77cabfbf75d37dea8b8a9004e1dc837047a83f4e3b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.537074Z","signature_b64":"B+LCjPYEAAU7K/hHNIFNb9J83q8m22ZegWklwT2ZEM60wki0q+qJmKWyvBwOhvPeUVHxVCadA6nlgJv1Q9znBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcd6af6bb067cf019bb06a611136dcbb0580255b51835637ee8212a4afab8e94","last_reissued_at":"2026-05-18T01:04:42.536557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.536557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiency of a Stochastic Search with Punctual and Costly Restarts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"q-bio.QM","authors_text":"Kabir Husain, Sandeep Krishna","submitted_at":"2016-09-13T10:28:26Z","abstract_excerpt":"The mean completion time of a stochastic process may be rendered finite and minimised by a judiciously chosen restart protocol, which may either be stochastic or deterministic. Here we study analytically an arbitrary stochastic search subject to an arbitrary restart protocol, each characterised by a distribution of waiting times. By a direct enumeration of paths we construct the joint distribution of completion time and restart number, in a form amenable to analytical evaluation or quadrature; thereby we optimise the search over both time and potentially costly restart events. Analysing the ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03754","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":"1609.03754","created_at":"2026-05-18T01:04:42.536634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03754v1","created_at":"2026-05-18T01:04:42.536634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03754","created_at":"2026-05-18T01:04:42.536634+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTLK625QM7HQ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTLK625QM7HQDG5Q","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTLK625Q","created_at":"2026-05-18T12:30:51.357362+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/XTLK625QM7HQDG5QNJQRCNW4XM","json":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM.json","graph_json":"https://pith.science/api/pith-number/XTLK625QM7HQDG5QNJQRCNW4XM/graph.json","events_json":"https://pith.science/api/pith-number/XTLK625QM7HQDG5QNJQRCNW4XM/events.json","paper":"https://pith.science/paper/XTLK625Q"},"agent_actions":{"view_html":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM","download_json":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM.json","view_paper":"https://pith.science/paper/XTLK625Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03754&json=true","fetch_graph":"https://pith.science/api/pith-number/XTLK625QM7HQDG5QNJQRCNW4XM/graph.json","fetch_events":"https://pith.science/api/pith-number/XTLK625QM7HQDG5QNJQRCNW4XM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM/action/storage_attestation","attest_author":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM/action/author_attestation","sign_citation":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM/action/citation_signature","submit_replication":"https://pith.science/pith/XTLK625QM7HQDG5QNJQRCNW4XM/action/replication_record"}},"created_at":"2026-05-18T01:04:42.536634+00:00","updated_at":"2026-05-18T01:04:42.536634+00:00"}