{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KVP6RZ3OFWVKZI4S47UKMR6T5N","short_pith_number":"pith:KVP6RZ3O","schema_version":"1.0","canonical_sha256":"555fe8e76e2daaaca392e7e8a647d3eb723763e9c77be3903216f4704633399b","source":{"kind":"arxiv","id":"1111.0321","version":3},"attestation_state":"computed","paper":{"title":"Anonymous Meeting in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrzej Pelc, Yoann dieudonn\\'e","submitted_at":"2011-11-01T21:18:10Z","abstract_excerpt":"A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic algorithm and move in synchronous rounds along links of the network. Which configurations are gatherable and how to gather all of them deterministically by the same algorithm?\n  We give a complete solution of this gathering problem in arbitrary networks. We characterize all gatherable configurations and give two universal deterministic gathering algorithms, i.e.,"},"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":"1111.0321","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-01T21:18:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e5417948c670e2a0f13678b3baa7c2f57d877f4e18f57e796c61505b4ae501ca","abstract_canon_sha256":"0446175c7cea19760220ef5d0af6c02467dc5c0cd14e9d056bf6e9332e53ddf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:14.679369Z","signature_b64":"A91p/U56YWYKp088mRi4QmPFseKuf2wpXlp64QOGg/n5f8d+JpQiK0ZkgMzlgsgHyo9cnoiyFQ6V4AJy8wtrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"555fe8e76e2daaaca392e7e8a647d3eb723763e9c77be3903216f4704633399b","last_reissued_at":"2026-05-18T01:19:14.678722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:14.678722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous Meeting in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrzej Pelc, Yoann dieudonn\\'e","submitted_at":"2011-11-01T21:18:10Z","abstract_excerpt":"A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic algorithm and move in synchronous rounds along links of the network. Which configurations are gatherable and how to gather all of them deterministically by the same algorithm?\n  We give a complete solution of this gathering problem in arbitrary networks. We characterize all gatherable configurations and give two universal deterministic gathering algorithms, i.e.,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0321","kind":"arxiv","version":3},"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":"1111.0321","created_at":"2026-05-18T01:19:14.678810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0321v3","created_at":"2026-05-18T01:19:14.678810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0321","created_at":"2026-05-18T01:19:14.678810+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVP6RZ3OFWVK","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVP6RZ3OFWVKZI4S","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVP6RZ3O","created_at":"2026-05-18T12:26:34.985390+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/KVP6RZ3OFWVKZI4S47UKMR6T5N","json":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N.json","graph_json":"https://pith.science/api/pith-number/KVP6RZ3OFWVKZI4S47UKMR6T5N/graph.json","events_json":"https://pith.science/api/pith-number/KVP6RZ3OFWVKZI4S47UKMR6T5N/events.json","paper":"https://pith.science/paper/KVP6RZ3O"},"agent_actions":{"view_html":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N","download_json":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N.json","view_paper":"https://pith.science/paper/KVP6RZ3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0321&json=true","fetch_graph":"https://pith.science/api/pith-number/KVP6RZ3OFWVKZI4S47UKMR6T5N/graph.json","fetch_events":"https://pith.science/api/pith-number/KVP6RZ3OFWVKZI4S47UKMR6T5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/action/storage_attestation","attest_author":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/action/author_attestation","sign_citation":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/action/citation_signature","submit_replication":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/action/replication_record"}},"created_at":"2026-05-18T01:19:14.678810+00:00","updated_at":"2026-05-18T01:19:14.678810+00:00"}