{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CQZQLCOZUHA7LKEVOVMFUL7DB5","short_pith_number":"pith:CQZQLCOZ","canonical_record":{"source":{"id":"1805.03568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T14:55:57Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"279ab1981a9f29ec8696922555aa35d3f86cee8d1e1ff2ce9c43b99875d886d7","abstract_canon_sha256":"a513a8086fa54ff0bf62d760404c0d1e63fe5ed646862c930f05391f565c5a97"},"schema_version":"1.0"},"canonical_sha256":"14330589d9a1c1f5a89575585a2fe30f70dd55d11994a6858f590ccfd1ac24c5","source":{"kind":"arxiv","id":"1805.03568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03568","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03568v1","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03568","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"CQZQLCOZUHA7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CQZQLCOZUHA7LKEV","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CQZQLCOZ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CQZQLCOZUHA7LKEVOVMFUL7DB5","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T14:55:57Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"279ab1981a9f29ec8696922555aa35d3f86cee8d1e1ff2ce9c43b99875d886d7","abstract_canon_sha256":"a513a8086fa54ff0bf62d760404c0d1e63fe5ed646862c930f05391f565c5a97"},"schema_version":"1.0"},"canonical_sha256":"14330589d9a1c1f5a89575585a2fe30f70dd55d11994a6858f590ccfd1ac24c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:19.851447Z","signature_b64":"QoUJ3JIBd6iPeyE2DoabnuoZ9xGQuZqtCNpW9iHEm20CS6PN9732rhCeUbbwYSOG+6IbFcIM7VtoCZp+UejtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14330589d9a1c1f5a89575585a2fe30f70dd55d11994a6858f590ccfd1ac24c5","last_reissued_at":"2026-05-18T00:16:19.850991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:19.850991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03568","source_version":1,"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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXSiyTM6nmV03VJCC50RFvTj0Lg52UOUJ76+jybBdOD3ORVP9YB7ImUacUi8ljF5DuBJkvAQQuxu+3Ezj8SECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:39:24.561125Z"},"content_sha256":"764bd8c3d023a84e9261419e5e46bfa2d880dde4bed159adb3a017420c63d8dc","schema_version":"1.0","event_id":"sha256:764bd8c3d023a84e9261419e5e46bfa2d880dde4bed159adb3a017420c63d8dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CQZQLCOZUHA7LKEVOVMFUL7DB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Priority Evacuation from a Disk Using Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DM","authors_text":"D. Krizanc, E. Kranakis, J. Czyzowicz, J. Opatrny, K. Georgiou, L. Narayanan, R. Killick, S. Shende","submitted_at":"2018-05-09T14:55:57Z","abstract_excerpt":"We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining $n$ robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03568","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"},"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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhvJcTwSZdsFL6CFmdwxawwkacej1rR/dNemgBAogXXxwDgcIEGuTYjC3EWGcTq/6QZrdwCM0Kukmjz5Knz0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:39:24.561483Z"},"content_sha256":"d4a7da0e6b282d22b4de0790cda50c9299ce92818226151d372ca0886bf42c4f","schema_version":"1.0","event_id":"sha256:d4a7da0e6b282d22b4de0790cda50c9299ce92818226151d372ca0886bf42c4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5/bundle.json","state_url":"https://pith.science/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5/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-05T13:39:24Z","links":{"resolver":"https://pith.science/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5","bundle":"https://pith.science/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5/bundle.json","state":"https://pith.science/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQZQLCOZUHA7LKEVOVMFUL7DB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CQZQLCOZUHA7LKEVOVMFUL7DB5","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":"a513a8086fa54ff0bf62d760404c0d1e63fe5ed646862c930f05391f565c5a97","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T14:55:57Z","title_canon_sha256":"279ab1981a9f29ec8696922555aa35d3f86cee8d1e1ff2ce9c43b99875d886d7"},"schema_version":"1.0","source":{"id":"1805.03568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03568","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03568v1","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03568","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"CQZQLCOZUHA7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CQZQLCOZUHA7LKEV","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CQZQLCOZ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:d4a7da0e6b282d22b4de0790cda50c9299ce92818226151d372ca0886bf42c4f","target":"graph","created_at":"2026-05-18T00:16:19Z","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":"We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining $n$ robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an al","authors_text":"D. Krizanc, E. Kranakis, J. Czyzowicz, J. Opatrny, K. Georgiou, L. Narayanan, R. Killick, S. Shende","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T14:55:57Z","title":"Priority Evacuation from a Disk Using Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03568","kind":"arxiv","version":1},"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:764bd8c3d023a84e9261419e5e46bfa2d880dde4bed159adb3a017420c63d8dc","target":"record","created_at":"2026-05-18T00:16:19Z","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":"a513a8086fa54ff0bf62d760404c0d1e63fe5ed646862c930f05391f565c5a97","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T14:55:57Z","title_canon_sha256":"279ab1981a9f29ec8696922555aa35d3f86cee8d1e1ff2ce9c43b99875d886d7"},"schema_version":"1.0","source":{"id":"1805.03568","kind":"arxiv","version":1}},"canonical_sha256":"14330589d9a1c1f5a89575585a2fe30f70dd55d11994a6858f590ccfd1ac24c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14330589d9a1c1f5a89575585a2fe30f70dd55d11994a6858f590ccfd1ac24c5","first_computed_at":"2026-05-18T00:16:19.850991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:19.850991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QoUJ3JIBd6iPeyE2DoabnuoZ9xGQuZqtCNpW9iHEm20CS6PN9732rhCeUbbwYSOG+6IbFcIM7VtoCZp+UejtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:19.851447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:764bd8c3d023a84e9261419e5e46bfa2d880dde4bed159adb3a017420c63d8dc","sha256:d4a7da0e6b282d22b4de0790cda50c9299ce92818226151d372ca0886bf42c4f"],"state_sha256":"c2f71244329924cb681ea685f69ce03fc54a61ebd4f54c5696b0ecf56d39c41e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYVrF1dCDNzp2QB3Xl0yiSXsgvtKT4XI+lEi3ISOk0u6xc69tWHj/kD6tMdb1mF/7FuIATBL7vLWwOgJ++UUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:39:24.563438Z","bundle_sha256":"d69ce754bcc161f9bf408c86b1a4afe5c7934dec95ff1c5b2f15e19583223f26"}}