{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FJRBWYRRSLWZMGJC747PY732U4","short_pith_number":"pith:FJRBWYRR","schema_version":"1.0","canonical_sha256":"2a621b623192ed961922ff3efc7f7aa7361d6fc15af288221f11c9336bb19b21","source":{"kind":"arxiv","id":"1507.02272","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.02272","created_at":"2026-05-18T01:06:29.214429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02272v3","created_at":"2026-05-18T01:06:29.214429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02272","created_at":"2026-05-18T01:06:29.214429+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJRBWYRRSLWZ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJRBWYRRSLWZMGJC","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJRBWYRR","created_at":"2026-05-18T12:29:19.899920+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/FJRBWYRRSLWZMGJC747PY732U4","json":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4.json","graph_json":"https://pith.science/api/pith-number/FJRBWYRRSLWZMGJC747PY732U4/graph.json","events_json":"https://pith.science/api/pith-number/FJRBWYRRSLWZMGJC747PY732U4/events.json","paper":"https://pith.science/paper/FJRBWYRR"},"agent_actions":{"view_html":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4","download_json":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4.json","view_paper":"https://pith.science/paper/FJRBWYRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02272&json=true","fetch_graph":"https://pith.science/api/pith-number/FJRBWYRRSLWZMGJC747PY732U4/graph.json","fetch_events":"https://pith.science/api/pith-number/FJRBWYRRSLWZMGJC747PY732U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/action/storage_attestation","attest_author":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/action/author_attestation","sign_citation":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/action/citation_signature","submit_replication":"https://pith.science/pith/FJRBWYRRSLWZMGJC747PY732U4/action/replication_record"}},"created_at":"2026-05-18T01:06:29.214429+00:00","updated_at":"2026-05-18T01:06:29.214429+00:00"}