{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MI3N7KEEQBQGIQQJQ735XWZQES","short_pith_number":"pith:MI3N7KEE","schema_version":"1.0","canonical_sha256":"6236dfa884806064420987f7dbdb302483ad374db30be12e2a4b2d1e9a0a1bf1","source":{"kind":"arxiv","id":"1904.09714","version":1},"attestation_state":"computed","paper":{"title":"Energy Consumption of Group Search on a Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Danny Krizanc, Evangelos Kranakis, Jaroslav Opatrny, Jurek Czyzowicz, Konstantinos Georgiou, Lata Narayanan, Manuel Lafond, Ryan Killick, Sunil Shende","submitted_at":"2019-04-22T03:57:17Z","abstract_excerpt":"Consider two robots that start at the origin of the infinite line in search of an exit at an unknown location on the line. The robots can only communicate if they arrive at the same location at exactly the same time, i.e. they use the so-called face-to-face communication model. The group search time is defined as the worst-case time as a function of $d$, the distance of the exit from the origin, when both robots can reach the exit. It has long been known that for a single robot traveling at unit speed, the search time is at least $9d-o(d)$. It was shown recently that $k\\geq2$ robots traveling "},"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":"1904.09714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-22T03:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"a04d11850a2e4d2d653330b11d205e40073e46fc953da77a561f73dc98d432fc","abstract_canon_sha256":"eaefd21fb991fefd01f70920c8661c19ea4151ac95002eb609c705a24642b22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:03.578495Z","signature_b64":"6I16q3FFO3s8PrgRMvjlX9Ka7QjfZvZXGfsOe+AICWt1w9ySo0PeMOu/R54JuRC0SrUxeL6AKJTOcR4E7M13CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6236dfa884806064420987f7dbdb302483ad374db30be12e2a4b2d1e9a0a1bf1","last_reissued_at":"2026-05-17T23:48:03.577940Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:03.577940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy Consumption of Group Search on a Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Danny Krizanc, Evangelos Kranakis, Jaroslav Opatrny, Jurek Czyzowicz, Konstantinos Georgiou, Lata Narayanan, Manuel Lafond, Ryan Killick, Sunil Shende","submitted_at":"2019-04-22T03:57:17Z","abstract_excerpt":"Consider two robots that start at the origin of the infinite line in search of an exit at an unknown location on the line. The robots can only communicate if they arrive at the same location at exactly the same time, i.e. they use the so-called face-to-face communication model. The group search time is defined as the worst-case time as a function of $d$, the distance of the exit from the origin, when both robots can reach the exit. It has long been known that for a single robot traveling at unit speed, the search time is at least $9d-o(d)$. It was shown recently that $k\\geq2$ robots traveling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09714","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":"1904.09714","created_at":"2026-05-17T23:48:03.578015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09714v1","created_at":"2026-05-17T23:48:03.578015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09714","created_at":"2026-05-17T23:48:03.578015+00:00"},{"alias_kind":"pith_short_12","alias_value":"MI3N7KEEQBQG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MI3N7KEEQBQGIQQJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MI3N7KEE","created_at":"2026-05-18T12:33:21.387695+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/MI3N7KEEQBQGIQQJQ735XWZQES","json":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES.json","graph_json":"https://pith.science/api/pith-number/MI3N7KEEQBQGIQQJQ735XWZQES/graph.json","events_json":"https://pith.science/api/pith-number/MI3N7KEEQBQGIQQJQ735XWZQES/events.json","paper":"https://pith.science/paper/MI3N7KEE"},"agent_actions":{"view_html":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES","download_json":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES.json","view_paper":"https://pith.science/paper/MI3N7KEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09714&json=true","fetch_graph":"https://pith.science/api/pith-number/MI3N7KEEQBQGIQQJQ735XWZQES/graph.json","fetch_events":"https://pith.science/api/pith-number/MI3N7KEEQBQGIQQJQ735XWZQES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES/action/storage_attestation","attest_author":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES/action/author_attestation","sign_citation":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES/action/citation_signature","submit_replication":"https://pith.science/pith/MI3N7KEEQBQGIQQJQ735XWZQES/action/replication_record"}},"created_at":"2026-05-17T23:48:03.578015+00:00","updated_at":"2026-05-17T23:48:03.578015+00:00"}