{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VPS4OD6P7CLV3EKZYK5HZOGCCI","short_pith_number":"pith:VPS4OD6P","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"},"canonical_sha256":"abe5c70fcff8975d9159c2ba7cb8c2123cd508f6e0d3ecddeffd1cf8e8916cee","source":{"kind":"arxiv","id":"1707.05077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05077","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05077v2","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05077","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"VPS4OD6P7CLV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPS4OD6P7CLV3EKZ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPS4OD6P","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VPS4OD6P7CLV3EKZYK5HZOGCCI","target":"record","payload":{"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"},"canonical_sha256":"abe5c70fcff8975d9159c2ba7cb8c2123cd508f6e0d3ecddeffd1cf8e8916cee","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"},"source_kind":"arxiv","source_id":"1707.05077","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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqoWbRO/tW26C+Zn87Yu8Z3yZfPNVCXZa1L8tpBJe4ZHHu0uqTD9JFYe1GsHKdj1yMVyuHWS1QsaLaIM6nPgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:14:48.827306Z"},"content_sha256":"931c2f3c5286a13460efe0b92c7c9988ad88d1c749bb0e2799b44bb9103c53fd","schema_version":"1.0","event_id":"sha256:931c2f3c5286a13460efe0b92c7c9988ad88d1c749bb0e2799b44bb9103c53fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VPS4OD6P7CLV3EKZYK5HZOGCCI","target":"graph","payload":{"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"},"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RoXWXCOiUpTm+tjyHac2Qu06ESambyKzwiCpjzWszxyb34USL2m8DRJ7sq3drpDOKUZtjABIlDt17gPtvwuZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:14:48.827674Z"},"content_sha256":"4ee6f9accb50cce38815308c6710f3d5fd05231c8fa9414ce58c4a4911299a60","schema_version":"1.0","event_id":"sha256:4ee6f9accb50cce38815308c6710f3d5fd05231c8fa9414ce58c4a4911299a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/bundle.json","state_url":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/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-10T21:14:48Z","links":{"resolver":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI","bundle":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/bundle.json","state":"https://pith.science/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPS4OD6P7CLV3EKZYK5HZOGCCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VPS4OD6P7CLV3EKZYK5HZOGCCI","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":"eb5c553232a8c2a40b4c187ab9fd11e52bab0f7f390bfcb5d94a9e34958f2b28","cross_cats_sorted":["cs.DC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-17T10:23:20Z","title_canon_sha256":"4fc661f337f3b31285d27f34834079280e17c78e44db170c84925a3a70176500"},"schema_version":"1.0","source":{"id":"1707.05077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05077","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05077v2","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05077","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"VPS4OD6P7CLV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPS4OD6P7CLV3EKZ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPS4OD6P","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:4ee6f9accb50cce38815308c6710f3d5fd05231c8fa9414ce58c4a4911299a60","target":"graph","created_at":"2026-05-18T00:15:37Z","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":"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","authors_text":"Andrey Kupavskii, Emo Welzl","cross_cats":["cs.DC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-17T10:23:20Z","title":"Lower Bounds for Searching Robots, some Faulty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05077","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:931c2f3c5286a13460efe0b92c7c9988ad88d1c749bb0e2799b44bb9103c53fd","target":"record","created_at":"2026-05-18T00:15:37Z","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":"eb5c553232a8c2a40b4c187ab9fd11e52bab0f7f390bfcb5d94a9e34958f2b28","cross_cats_sorted":["cs.DC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-17T10:23:20Z","title_canon_sha256":"4fc661f337f3b31285d27f34834079280e17c78e44db170c84925a3a70176500"},"schema_version":"1.0","source":{"id":"1707.05077","kind":"arxiv","version":2}},"canonical_sha256":"abe5c70fcff8975d9159c2ba7cb8c2123cd508f6e0d3ecddeffd1cf8e8916cee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abe5c70fcff8975d9159c2ba7cb8c2123cd508f6e0d3ecddeffd1cf8e8916cee","first_computed_at":"2026-05-18T00:15:37.541801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:37.541801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mu488rySjKo2NZF1HAG4/utsnf/AkihEbubqStSpil6S94rH/HGxINvoyKXlDXtWeZUHcBJGMZblCcL53fMVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:37.542328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:931c2f3c5286a13460efe0b92c7c9988ad88d1c749bb0e2799b44bb9103c53fd","sha256:4ee6f9accb50cce38815308c6710f3d5fd05231c8fa9414ce58c4a4911299a60"],"state_sha256":"52a52e6f97e56558a3de30039a80942bc74cfff178b8ce8c9f51654010dff3d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8l3Cs3GY4PgEExNezMikD+eGWAJGGc60vy7K3TPDwtH3vFhQ3+Mcx8daqSz+0nUEyXtO8oaba0/g3iOcs9TuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:14:48.829645Z","bundle_sha256":"6f25845804648b03ae3c0a60ba0b65bb3c8c0f746754c75bfb1f79d44cf49da1"}}