{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KVP6RZ3OFWVKZI4S47UKMR6T5N","short_pith_number":"pith:KVP6RZ3O","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"},"canonical_sha256":"555fe8e76e2daaaca392e7e8a647d3eb723763e9c77be3903216f4704633399b","source":{"kind":"arxiv","id":"1111.0321","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0321","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0321v3","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0321","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"KVP6RZ3OFWVK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KVP6RZ3OFWVKZI4S","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KVP6RZ3O","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KVP6RZ3OFWVKZI4S47UKMR6T5N","target":"record","payload":{"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"},"canonical_sha256":"555fe8e76e2daaaca392e7e8a647d3eb723763e9c77be3903216f4704633399b","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"},"source_kind":"arxiv","source_id":"1111.0321","source_version":3,"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-18T01:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7FOmOUqCV5v41wWKbdWTJNc4rLca2e0RtQ9SOl++xBMcPFmBFu1mxXIULMAg8/6Af8M9mkJsvt91ZMm3oLEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:52:53.530013Z"},"content_sha256":"16618a809aab9252902a743532bf1543982ff376b94409e118bd28943c0ca25b","schema_version":"1.0","event_id":"sha256:16618a809aab9252902a743532bf1543982ff376b94409e118bd28943c0ca25b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KVP6RZ3OFWVKZI4S47UKMR6T5N","target":"graph","payload":{"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"},"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-18T01:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVAyJU9OVCIYJqPR+3xiYTQ5ny64TO2csG05aiNsEIAFQSglAzWU9ffsI9dcq5TtihmFQwoLILjPY2pXXJi+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:52:53.530378Z"},"content_sha256":"cec618a20853455ed76daedf26ffb05c4b1685ee3302bd731855b3f673b40cb1","schema_version":"1.0","event_id":"sha256:cec618a20853455ed76daedf26ffb05c4b1685ee3302bd731855b3f673b40cb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/bundle.json","state_url":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/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-26T14:52:53Z","links":{"resolver":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N","bundle":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/bundle.json","state":"https://pith.science/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVP6RZ3OFWVKZI4S47UKMR6T5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KVP6RZ3OFWVKZI4S47UKMR6T5N","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":"0446175c7cea19760220ef5d0af6c02467dc5c0cd14e9d056bf6e9332e53ddf4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-01T21:18:10Z","title_canon_sha256":"e5417948c670e2a0f13678b3baa7c2f57d877f4e18f57e796c61505b4ae501ca"},"schema_version":"1.0","source":{"id":"1111.0321","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0321","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0321v3","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0321","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"KVP6RZ3OFWVK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KVP6RZ3OFWVKZI4S","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KVP6RZ3O","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:cec618a20853455ed76daedf26ffb05c4b1685ee3302bd731855b3f673b40cb1","target":"graph","created_at":"2026-05-18T01:19:14Z","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":"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.,","authors_text":"Andrzej Pelc, Yoann dieudonn\\'e","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-01T21:18:10Z","title":"Anonymous Meeting in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0321","kind":"arxiv","version":3},"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:16618a809aab9252902a743532bf1543982ff376b94409e118bd28943c0ca25b","target":"record","created_at":"2026-05-18T01:19:14Z","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":"0446175c7cea19760220ef5d0af6c02467dc5c0cd14e9d056bf6e9332e53ddf4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-01T21:18:10Z","title_canon_sha256":"e5417948c670e2a0f13678b3baa7c2f57d877f4e18f57e796c61505b4ae501ca"},"schema_version":"1.0","source":{"id":"1111.0321","kind":"arxiv","version":3}},"canonical_sha256":"555fe8e76e2daaaca392e7e8a647d3eb723763e9c77be3903216f4704633399b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"555fe8e76e2daaaca392e7e8a647d3eb723763e9c77be3903216f4704633399b","first_computed_at":"2026-05-18T01:19:14.678722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:14.678722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A91p/U56YWYKp088mRi4QmPFseKuf2wpXlp64QOGg/n5f8d+JpQiK0ZkgMzlgsgHyo9cnoiyFQ6V4AJy8wtrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:14.679369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0321","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16618a809aab9252902a743532bf1543982ff376b94409e118bd28943c0ca25b","sha256:cec618a20853455ed76daedf26ffb05c4b1685ee3302bd731855b3f673b40cb1"],"state_sha256":"663c68ad205d73181b0ba126548d45cf74e276f973fa6902807d67a71b69acbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GizEo49nZYk4NJ6QFAu/xYDD2UUwLsyQW///hIcvOOJfGHpWhJDLNw5qG2qo6BthLLXXA4BToat+6Gryb+HdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:52:53.532249Z","bundle_sha256":"3b4077dd8cc62a50e73340e7841cae77860e7962ad85d8bfe9c062d9bde9a839"}}