{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QCRDLQDLLSBHY2RQVFPUQUCOZR","short_pith_number":"pith:QCRDLQDL","schema_version":"1.0","canonical_sha256":"80a235c06b5c827c6a30a95f48504ecc5f89c4154755141fc2889045243be97b","source":{"kind":"arxiv","id":"1812.10162","version":1},"attestation_state":"computed","paper":{"title":"Evacuating Equilateral Triangles and Squares in the Face-to-Face Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Huda Chuangpishit, Jaroslav Opatrny, Lata Narayanan, Saeed Mehrabi","submitted_at":"2018-12-25T19:40:49Z","abstract_excerpt":"Consider $k$ robots initially located at a point inside a region $T$. Each robot can move anywhere in $T$ independently of other robots with maximum speed one. The goal of the robots is to \\emph{evacuate} $T$ through an exit at an unknown location on the boundary of $T$. The objective is to minimize the \\emph{evacuation time}, which is defined as the time the \\emph{last} robot reaches the exit. We consider the \\emph{face-to-face} communication model for the robots: a robot can communicate with another robot only when they meet in $T$.\n  In this paper, we give upper and lower bounds for the fac"},"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":"1812.10162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-25T19:40:49Z","cross_cats_sorted":[],"title_canon_sha256":"944ba76e6fb0e5b5a6267d03d5d9ca989f1ebcd89ee707305bc764e01bd7d88d","abstract_canon_sha256":"c216dfc3d6f4c05db16f9842f2734b1b14eb5c4729811d4a19fd552da6290e58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:24.916825Z","signature_b64":"CQMmjp8+bb/y5wIDi04zjyLOTuABsm0cBNif7k9aVaWbWiZnU5FDeQLgF6Nz4A+/bqSpXiE+sy6aurrpG2Y3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a235c06b5c827c6a30a95f48504ecc5f89c4154755141fc2889045243be97b","last_reissued_at":"2026-05-17T23:57:24.916174Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:24.916174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evacuating Equilateral Triangles and Squares in the Face-to-Face Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Huda Chuangpishit, Jaroslav Opatrny, Lata Narayanan, Saeed Mehrabi","submitted_at":"2018-12-25T19:40:49Z","abstract_excerpt":"Consider $k$ robots initially located at a point inside a region $T$. Each robot can move anywhere in $T$ independently of other robots with maximum speed one. The goal of the robots is to \\emph{evacuate} $T$ through an exit at an unknown location on the boundary of $T$. The objective is to minimize the \\emph{evacuation time}, which is defined as the time the \\emph{last} robot reaches the exit. We consider the \\emph{face-to-face} communication model for the robots: a robot can communicate with another robot only when they meet in $T$.\n  In this paper, we give upper and lower bounds for the fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10162","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":"1812.10162","created_at":"2026-05-17T23:57:24.916292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10162v1","created_at":"2026-05-17T23:57:24.916292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10162","created_at":"2026-05-17T23:57:24.916292+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCRDLQDLLSBH","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCRDLQDLLSBHY2RQ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCRDLQDL","created_at":"2026-05-18T12:32:46.962924+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/QCRDLQDLLSBHY2RQVFPUQUCOZR","json":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR.json","graph_json":"https://pith.science/api/pith-number/QCRDLQDLLSBHY2RQVFPUQUCOZR/graph.json","events_json":"https://pith.science/api/pith-number/QCRDLQDLLSBHY2RQVFPUQUCOZR/events.json","paper":"https://pith.science/paper/QCRDLQDL"},"agent_actions":{"view_html":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR","download_json":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR.json","view_paper":"https://pith.science/paper/QCRDLQDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10162&json=true","fetch_graph":"https://pith.science/api/pith-number/QCRDLQDLLSBHY2RQVFPUQUCOZR/graph.json","fetch_events":"https://pith.science/api/pith-number/QCRDLQDLLSBHY2RQVFPUQUCOZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR/action/storage_attestation","attest_author":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR/action/author_attestation","sign_citation":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR/action/citation_signature","submit_replication":"https://pith.science/pith/QCRDLQDLLSBHY2RQVFPUQUCOZR/action/replication_record"}},"created_at":"2026-05-17T23:57:24.916292+00:00","updated_at":"2026-05-17T23:57:24.916292+00:00"}