{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VPS4OD6P7CLV3EKZYK5HZOGCCI","short_pith_number":"pith:VPS4OD6P","schema_version":"1.0","canonical_sha256":"abe5c70fcff8975d9159c2ba7cb8c2123cd508f6e0d3ecddeffd1cf8e8916cee","source":{"kind":"arxiv","id":"1707.05077","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for Searching Robots, some Faulty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","math.CO"],"primary_cat":"cs.RO","authors_text":"Andrey Kupavskii, Emo Welzl","submitted_at":"2017-07-17T10:23:20Z","abstract_excerpt":"Suppose we are sending out $k$ robots from $0$ to search the real line at constant speed (with turns) to find a target at an unknown location; $f$ of the robots are faulty, meaning that they fail to report the target although visiting its location (called crash type). The goal is to find the target in time at most $\\lambda |d|$, if the target is located at $d$, $|d| \\ge 1$, for $\\lambda$ as small as possible. We show that this cannot be achieved for $$\\lambda < 2\\frac{\\rho^\\rho}{(\\rho-1)^{\\rho-1}}+1,~~ \\rho := \\frac{2(f+1)}{k}~, $$ which is tight due to earlier work (see J. Czyzowitz, E. Krana"},"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":"1707.05077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-17T10:23:20Z","cross_cats_sorted":["cs.DC","cs.DM","math.CO"],"title_canon_sha256":"4fc661f337f3b31285d27f34834079280e17c78e44db170c84925a3a70176500","abstract_canon_sha256":"eb5c553232a8c2a40b4c187ab9fd11e52bab0f7f390bfcb5d94a9e34958f2b28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.542328Z","signature_b64":"mu488rySjKo2NZF1HAG4/utsnf/AkihEbubqStSpil6S94rH/HGxINvoyKXlDXtWeZUHcBJGMZblCcL53fMVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe5c70fcff8975d9159c2ba7cb8c2123cd508f6e0d3ecddeffd1cf8e8916cee","last_reissued_at":"2026-05-18T00:15:37.541801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.541801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Searching Robots, some Faulty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","math.CO"],"primary_cat":"cs.RO","authors_text":"Andrey Kupavskii, Emo Welzl","submitted_at":"2017-07-17T10:23:20Z","abstract_excerpt":"Suppose we are sending out $k$ robots from $0$ to search the real line at constant speed (with turns) to find a target at an unknown location; $f$ of the robots are faulty, meaning that they fail to report the target although visiting its location (called crash type). The goal is to find the target in time at most $\\lambda |d|$, if the target is located at $d$, $|d| \\ge 1$, for $\\lambda$ as small as possible. We show that this cannot be achieved for $$\\lambda < 2\\frac{\\rho^\\rho}{(\\rho-1)^{\\rho-1}}+1,~~ \\rho := \\frac{2(f+1)}{k}~, $$ which is tight due to earlier work (see J. Czyzowitz, E. Krana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05077","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":"1707.05077","created_at":"2026-05-18T00:15:37.541886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05077v2","created_at":"2026-05-18T00:15:37.541886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05077","created_at":"2026-05-18T00:15:37.541886+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPS4OD6P7CLV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPS4OD6P7CLV3EKZ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPS4OD6P","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/VPS4OD6P7CLV3EKZYK5HZOGCCI","json":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI.json","graph_json":"https://pith.science/api/pith-number/VPS4OD6P7CLV3EKZYK5HZOGCCI/graph.json","events_json":"https://pith.science/api/pith-number/VPS4OD6P7CLV3EKZYK5HZOGCCI/events.json","paper":"https://pith.science/paper/VPS4OD6P"},"agent_actions":{"view_html":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI","download_json":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI.json","view_paper":"https://pith.science/paper/VPS4OD6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05077&json=true","fetch_graph":"https://pith.science/api/pith-number/VPS4OD6P7CLV3EKZYK5HZOGCCI/graph.json","fetch_events":"https://pith.science/api/pith-number/VPS4OD6P7CLV3EKZYK5HZOGCCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/action/storage_attestation","attest_author":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/action/author_attestation","sign_citation":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/action/citation_signature","submit_replication":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/action/replication_record"}},"created_at":"2026-05-18T00:15:37.541886+00:00","updated_at":"2026-05-18T00:15:37.541886+00:00"}