{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JN7MDRTA6Z3B4JBHCA74FB5DMI","short_pith_number":"pith:JN7MDRTA","schema_version":"1.0","canonical_sha256":"4b7ec1c660f6761e2427103fc287a362195f872e14ce50bdf7daf988751f3d00","source":{"kind":"arxiv","id":"1705.00324","version":4},"attestation_state":"computed","paper":{"title":"Meeting in a Polygon by Anonymous Oblivious Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Giuseppe A. Di Luna, Masafumi Yamashita, Nicola Santoro, Paola Flocchini","submitted_at":"2017-04-30T15:25:31Z","abstract_excerpt":"The Meeting problem for $k\\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape of $P$, we minimize the number of searchers $k$ for which the Meeting problem is solvable. Specifically, if $P$ has a rotational symmetry of order $\\sigma$ (where $\\sigma=1$ corresponds to no "},"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":"1705.00324","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-30T15:25:31Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"bf5628ae669269a2cd43df2f1ef41b6d5219779004465459108ebd49bcf76d4d","abstract_canon_sha256":"138be8fcfba2eed99717c43fb4a71fa9abd55168c3c9f58e8d3c2c92cdba379b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.331311Z","signature_b64":"voIifKDSLe4dklvp85PgcTv/oeA9siPwaq3VT88A81mUYmxupR3Mw8wKP6BHNDMF9JZb8R3Tan/W3H9TwaeWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b7ec1c660f6761e2427103fc287a362195f872e14ce50bdf7daf988751f3d00","last_reissued_at":"2026-05-17T23:41:22.330735Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.330735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meeting in a Polygon by Anonymous Oblivious Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Giuseppe A. Di Luna, Masafumi Yamashita, Nicola Santoro, Paola Flocchini","submitted_at":"2017-04-30T15:25:31Z","abstract_excerpt":"The Meeting problem for $k\\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape of $P$, we minimize the number of searchers $k$ for which the Meeting problem is solvable. Specifically, if $P$ has a rotational symmetry of order $\\sigma$ (where $\\sigma=1$ corresponds to no "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00324","kind":"arxiv","version":4},"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":"1705.00324","created_at":"2026-05-17T23:41:22.330818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00324v4","created_at":"2026-05-17T23:41:22.330818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00324","created_at":"2026-05-17T23:41:22.330818+00:00"},{"alias_kind":"pith_short_12","alias_value":"JN7MDRTA6Z3B","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JN7MDRTA6Z3B4JBH","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JN7MDRTA","created_at":"2026-05-18T12:31:24.725408+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/JN7MDRTA6Z3B4JBHCA74FB5DMI","json":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI.json","graph_json":"https://pith.science/api/pith-number/JN7MDRTA6Z3B4JBHCA74FB5DMI/graph.json","events_json":"https://pith.science/api/pith-number/JN7MDRTA6Z3B4JBHCA74FB5DMI/events.json","paper":"https://pith.science/paper/JN7MDRTA"},"agent_actions":{"view_html":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI","download_json":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI.json","view_paper":"https://pith.science/paper/JN7MDRTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00324&json=true","fetch_graph":"https://pith.science/api/pith-number/JN7MDRTA6Z3B4JBHCA74FB5DMI/graph.json","fetch_events":"https://pith.science/api/pith-number/JN7MDRTA6Z3B4JBHCA74FB5DMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI/action/storage_attestation","attest_author":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI/action/author_attestation","sign_citation":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI/action/citation_signature","submit_replication":"https://pith.science/pith/JN7MDRTA6Z3B4JBHCA74FB5DMI/action/replication_record"}},"created_at":"2026-05-17T23:41:22.330818+00:00","updated_at":"2026-05-17T23:41:22.330818+00:00"}