{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FJRBWYRRSLWZMGJC747PY732U4","short_pith_number":"pith:FJRBWYRR","canonical_record":{"source":{"id":"1507.02272","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-08T19:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"b2ecc592ff3292d9fb91a27ca81349647feca4c5bf3235d4c134cd164bb31ba6","abstract_canon_sha256":"2054929b3ffb22a5b00071fbfc9b8ab6e9f6683a1718d97219c6ebdeb1a928da"},"schema_version":"1.0"},"canonical_sha256":"2a621b623192ed961922ff3efc7f7aa7361d6fc15af288221f11c9336bb19b21","source":{"kind":"arxiv","id":"1507.02272","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02272","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02272v3","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02272","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"pith_short_12","alias_value":"FJRBWYRRSLWZ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FJRBWYRRSLWZMGJC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FJRBWYRR","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FJRBWYRRSLWZMGJC747PY732U4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02272","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-08T19:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"b2ecc592ff3292d9fb91a27ca81349647feca4c5bf3235d4c134cd164bb31ba6","abstract_canon_sha256":"2054929b3ffb22a5b00071fbfc9b8ab6e9f6683a1718d97219c6ebdeb1a928da"},"schema_version":"1.0"},"canonical_sha256":"2a621b623192ed961922ff3efc7f7aa7361d6fc15af288221f11c9336bb19b21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:29.214976Z","signature_b64":"Vwhyiv7Qita+1dtWoRqQ4Nk2mpn6zqq9+y8Cn0dZL2F+KBiiCN6zSbJlfNuCpNmEw2Yq69TQjNWncjL0UOzGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a621b623192ed961922ff3efc7f7aa7361d6fc15af288221f11c9336bb19b21","last_reissued_at":"2026-05-18T01:06:29.214342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:29.214342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02272","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:06:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9GmsZbN9wE+HvpytShIVFKyda071DEFZPTdtPoQSeD38M5syz64ovgKEGnefMuEPKm1y2LN5//oTa0Q1OTEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:46:53.471035Z"},"content_sha256":"51e908180254b3f4e16b1d1cafff6ae197b1a08413ef7865999f6285dc62f54c","schema_version":"1.0","event_id":"sha256:51e908180254b3f4e16b1d1cafff6ae197b1a08413ef7865999f6285dc62f54c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FJRBWYRRSLWZMGJC747PY732U4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anonymous Processors with Synchronous Shared Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo","submitted_at":"2015-07-08T19:59:35Z","abstract_excerpt":"We consider synchronous distributed systems in which anonymous processors communicate by shared read-write variables. The goal is to have all the processors assign unique names to themselves. We consider the instances of this problem determined by whether the number $n$ is known or not, and whether concurrently attempting to write distinct values into the same memory cell is allowed or not, and whether the number of shared variables is a constant independent of $n$ or it is unbounded. For known $n$, we give Las Vegas algorithms that operate in the optimum expected time, as determined by the am"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02272","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:06:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwEs2a+9evh0BjQTU6SDBjcNEsbjSzYu7DYQO2Ggzz9db6ZI4wKuSpGu7Ty3U8ApBuQZ/y1TNOEoNgs6nPVPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:46:53.471390Z"},"content_sha256":"de6d58e595537549aede0461a2d008cd8deca671f1c255367a35c10e58eb023f","schema_version":"1.0","event_id":"sha256:de6d58e595537549aede0461a2d008cd8deca671f1c255367a35c10e58eb023f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/bundle.json","state_url":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJRBWYRRSLWZMGJC747PY732U4/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-23T15:46:53Z","links":{"resolver":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4","bundle":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/bundle.json","state":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJRBWYRRSLWZMGJC747PY732U4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FJRBWYRRSLWZMGJC747PY732U4","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":"2054929b3ffb22a5b00071fbfc9b8ab6e9f6683a1718d97219c6ebdeb1a928da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-08T19:59:35Z","title_canon_sha256":"b2ecc592ff3292d9fb91a27ca81349647feca4c5bf3235d4c134cd164bb31ba6"},"schema_version":"1.0","source":{"id":"1507.02272","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02272","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02272v3","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02272","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"pith_short_12","alias_value":"FJRBWYRRSLWZ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FJRBWYRRSLWZMGJC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FJRBWYRR","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:de6d58e595537549aede0461a2d008cd8deca671f1c255367a35c10e58eb023f","target":"graph","created_at":"2026-05-18T01:06:29Z","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":"We consider synchronous distributed systems in which anonymous processors communicate by shared read-write variables. The goal is to have all the processors assign unique names to themselves. We consider the instances of this problem determined by whether the number $n$ is known or not, and whether concurrently attempting to write distinct values into the same memory cell is allowed or not, and whether the number of shared variables is a constant independent of $n$ or it is unbounded. For known $n$, we give Las Vegas algorithms that operate in the optimum expected time, as determined by the am","authors_text":"Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-08T19:59:35Z","title":"Anonymous Processors with Synchronous Shared Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02272","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:51e908180254b3f4e16b1d1cafff6ae197b1a08413ef7865999f6285dc62f54c","target":"record","created_at":"2026-05-18T01:06:29Z","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":"2054929b3ffb22a5b00071fbfc9b8ab6e9f6683a1718d97219c6ebdeb1a928da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-08T19:59:35Z","title_canon_sha256":"b2ecc592ff3292d9fb91a27ca81349647feca4c5bf3235d4c134cd164bb31ba6"},"schema_version":"1.0","source":{"id":"1507.02272","kind":"arxiv","version":3}},"canonical_sha256":"2a621b623192ed961922ff3efc7f7aa7361d6fc15af288221f11c9336bb19b21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a621b623192ed961922ff3efc7f7aa7361d6fc15af288221f11c9336bb19b21","first_computed_at":"2026-05-18T01:06:29.214342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:29.214342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vwhyiv7Qita+1dtWoRqQ4Nk2mpn6zqq9+y8Cn0dZL2F+KBiiCN6zSbJlfNuCpNmEw2Yq69TQjNWncjL0UOzGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:29.214976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02272","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51e908180254b3f4e16b1d1cafff6ae197b1a08413ef7865999f6285dc62f54c","sha256:de6d58e595537549aede0461a2d008cd8deca671f1c255367a35c10e58eb023f"],"state_sha256":"5043550994ee1c3ed70cde875bde3afc42a3460e544b352ab0cc9b7a55191b86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PS8XMOK2p7Xx/+V8dANduBbDGd4vmYU/9q6EL9dkJvDKCl6qCqJGfQO2IHGpO/HUhSzsC8jFndynoUhA/4THAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:46:53.473437Z","bundle_sha256":"fe4ae74d344c9e49875d397a91db14e6fb2ed101402b5538f3db5271892a047c"}}