{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VSUDMAZOS5PJA72SWDC4PWNBYY","short_pith_number":"pith:VSUDMAZO","schema_version":"1.0","canonical_sha256":"aca836032e975e907f52b0c5c7d9a1c63c8d13f3e26f103c06c4613ccaa0fb30","source":{"kind":"arxiv","id":"1001.0890","version":1},"attestation_state":"computed","paper":{"title":"How to meet asynchronously (almost) everywhere","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrzej Pelc, Arnaud Labourel (LaBRI), Jurek Czyzowicz","submitted_at":"2010-01-06T13:27:31Z","abstract_excerpt":"Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents are modeled as points, and the route of each of them only depends on its label and on the unknown environment. The actual walk of each agent also depends on an asynchronous adversary that may arbitrarily vary the speed of the agent, stop it, or even move it back and forth, as long as the walk of the agent in each segment of its route is continuous, does not leave it and covers all of it. Meeting in a graph means that bo"},"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":"1001.0890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-06T13:27:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0427377a75a88a3c83210714f774d628a32cd0869ed08c5e29d18bb9f54d3e13","abstract_canon_sha256":"19704f2df4a591f188b623abd5ba08089730e59ed28883684c2655482ce4f38f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:58.504508Z","signature_b64":"U0jAAPEr6hw/Zr/QLq2f1kv68LW33F/99PcvCZ1YzHtWYYVF8CVwAS/5GKVWziclBsmawOc9dK5oAoDi4KC8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca836032e975e907f52b0c5c7d9a1c63c8d13f3e26f103c06c4613ccaa0fb30","last_reissued_at":"2026-05-18T00:56:58.503927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:58.503927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to meet asynchronously (almost) everywhere","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrzej Pelc, Arnaud Labourel (LaBRI), Jurek Czyzowicz","submitted_at":"2010-01-06T13:27:31Z","abstract_excerpt":"Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents are modeled as points, and the route of each of them only depends on its label and on the unknown environment. The actual walk of each agent also depends on an asynchronous adversary that may arbitrarily vary the speed of the agent, stop it, or even move it back and forth, as long as the walk of the agent in each segment of its route is continuous, does not leave it and covers all of it. Meeting in a graph means that bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0890","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":"1001.0890","created_at":"2026-05-18T00:56:58.504023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0890v1","created_at":"2026-05-18T00:56:58.504023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0890","created_at":"2026-05-18T00:56:58.504023+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSUDMAZOS5PJ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSUDMAZOS5PJA72S","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSUDMAZO","created_at":"2026-05-18T12:26:15.391820+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/VSUDMAZOS5PJA72SWDC4PWNBYY","json":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY.json","graph_json":"https://pith.science/api/pith-number/VSUDMAZOS5PJA72SWDC4PWNBYY/graph.json","events_json":"https://pith.science/api/pith-number/VSUDMAZOS5PJA72SWDC4PWNBYY/events.json","paper":"https://pith.science/paper/VSUDMAZO"},"agent_actions":{"view_html":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY","download_json":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY.json","view_paper":"https://pith.science/paper/VSUDMAZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0890&json=true","fetch_graph":"https://pith.science/api/pith-number/VSUDMAZOS5PJA72SWDC4PWNBYY/graph.json","fetch_events":"https://pith.science/api/pith-number/VSUDMAZOS5PJA72SWDC4PWNBYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY/action/storage_attestation","attest_author":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY/action/author_attestation","sign_citation":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY/action/citation_signature","submit_replication":"https://pith.science/pith/VSUDMAZOS5PJA72SWDC4PWNBYY/action/replication_record"}},"created_at":"2026-05-18T00:56:58.504023+00:00","updated_at":"2026-05-18T00:56:58.504023+00:00"}