{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5HPN2ZOGRM2ELQUKJDNF6RPYJK","short_pith_number":"pith:5HPN2ZOG","schema_version":"1.0","canonical_sha256":"e9dedd65c68b3445c28a48da5f45f84aaa636814111f6af400a6e65057f22d6c","source":{"kind":"arxiv","id":"1102.4946","version":1},"attestation_state":"computed","paper":{"title":"An Equivariance Theorem with Applications to Renaming (Preliminary Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Armando Casta\\~neda, Maurice Herlihy, Sergio Rajsbaum","submitted_at":"2011-02-24T10:24:43Z","abstract_excerpt":"In the renaming problem, each process in a distributed system is issued a unique name from a large name space, and the processes must coordinate with one another to choose unique names from a much smaller name space. We show that lower bounds on the solvability of renaming in an asynchronous distributed system can be formulated as a purely topological question about the existence of an equivariant chain map from a topological disk to a topological annulus. Proving the non-existence of such a map implies the non-existence of a distributed renaming algorithm in several related models of computat"},"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":"1102.4946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-02-24T10:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"e45c7aa8f9acc4e2e0faf486ae1ba36759f763613f3c4f931943e4ecb90682bd","abstract_canon_sha256":"e49a1ec682844738adf225b22e3f5f6f5d8d3eb0482301a6f33b551bdfda221c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:57.714919Z","signature_b64":"wTsAs/QSR+j1U9Yb+THSiq4ZHtDsvnflBXubP4p8Kz7zQOiuip7KXu6SQbHQuwCNX7kJCVjQUjwHevpSb8c+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9dedd65c68b3445c28a48da5f45f84aaa636814111f6af400a6e65057f22d6c","last_reissued_at":"2026-05-18T04:27:57.714194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:57.714194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Equivariance Theorem with Applications to Renaming (Preliminary Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Armando Casta\\~neda, Maurice Herlihy, Sergio Rajsbaum","submitted_at":"2011-02-24T10:24:43Z","abstract_excerpt":"In the renaming problem, each process in a distributed system is issued a unique name from a large name space, and the processes must coordinate with one another to choose unique names from a much smaller name space. We show that lower bounds on the solvability of renaming in an asynchronous distributed system can be formulated as a purely topological question about the existence of an equivariant chain map from a topological disk to a topological annulus. Proving the non-existence of such a map implies the non-existence of a distributed renaming algorithm in several related models of computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4946","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":"1102.4946","created_at":"2026-05-18T04:27:57.714300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4946v1","created_at":"2026-05-18T04:27:57.714300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4946","created_at":"2026-05-18T04:27:57.714300+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HPN2ZOGRM2E","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HPN2ZOGRM2ELQUK","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HPN2ZOG","created_at":"2026-05-18T12:26:20.644004+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/5HPN2ZOGRM2ELQUKJDNF6RPYJK","json":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK.json","graph_json":"https://pith.science/api/pith-number/5HPN2ZOGRM2ELQUKJDNF6RPYJK/graph.json","events_json":"https://pith.science/api/pith-number/5HPN2ZOGRM2ELQUKJDNF6RPYJK/events.json","paper":"https://pith.science/paper/5HPN2ZOG"},"agent_actions":{"view_html":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK","download_json":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK.json","view_paper":"https://pith.science/paper/5HPN2ZOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4946&json=true","fetch_graph":"https://pith.science/api/pith-number/5HPN2ZOGRM2ELQUKJDNF6RPYJK/graph.json","fetch_events":"https://pith.science/api/pith-number/5HPN2ZOGRM2ELQUKJDNF6RPYJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK/action/storage_attestation","attest_author":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK/action/author_attestation","sign_citation":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK/action/citation_signature","submit_replication":"https://pith.science/pith/5HPN2ZOGRM2ELQUKJDNF6RPYJK/action/replication_record"}},"created_at":"2026-05-18T04:27:57.714300+00:00","updated_at":"2026-05-18T04:27:57.714300+00:00"}