{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TJLJRMLYKRVE3OREYZ5JDNX4C4","short_pith_number":"pith:TJLJRMLY","schema_version":"1.0","canonical_sha256":"9a5698b178546a4dba24c67a91b6fc173f3c0b33d1687704464cc18a48bf37f1","source":{"kind":"arxiv","id":"2605.18086","version":1},"attestation_state":"computed","paper":{"title":"Distributed Renaming with Subquadratic Bits via Scalable Committee Election","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chaodong Zheng, Sirui Bai, Xinyu Fu, Yuyi Wang","submitted_at":"2026-05-18T09:01:32Z","abstract_excerpt":"In distributed computing, the renaming problem requires $n$ nodes with unique identities from a large namespace $[N]$ to acquire new, distinct identities from a smaller target namespace $[M]$. A solution is strong if $M=n$, and is order-preserving if the relative order of identities is maintained. In the synchronous message-passing model, although many fault-tolerant renaming algorithms achieve logarithmic time complexity, they universally incur a high message complexity of $\\Omega(n^2)$. Recent work breaks the quadratic barrier, but demands linear runtime and relies on shared randomness.\n  Th"},"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":"2605.18086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T09:01:32Z","cross_cats_sorted":[],"title_canon_sha256":"9572ec60f84d3d1df1ebb0a21c5f378ae35b2097373b7f8a9d9845f0dd0921c6","abstract_canon_sha256":"4dd43f05f6cf3d6c997ba198fd95d27a40f57308f27e7379e4c8075e2e7969f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:15.314800Z","signature_b64":"k18G/mErJgrEm521wsCG9LNHFu3+MQ32krvobrhbgNaDqr2PTTlEtjW/S1EAh8l/iyqkwFDvfj8kWhKbNZbDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5698b178546a4dba24c67a91b6fc173f3c0b33d1687704464cc18a48bf37f1","last_reissued_at":"2026-05-20T00:05:15.313965Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:15.313965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Renaming with Subquadratic Bits via Scalable Committee Election","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chaodong Zheng, Sirui Bai, Xinyu Fu, Yuyi Wang","submitted_at":"2026-05-18T09:01:32Z","abstract_excerpt":"In distributed computing, the renaming problem requires $n$ nodes with unique identities from a large namespace $[N]$ to acquire new, distinct identities from a smaller target namespace $[M]$. A solution is strong if $M=n$, and is order-preserving if the relative order of identities is maintained. In the synchronous message-passing model, although many fault-tolerant renaming algorithms achieve logarithmic time complexity, they universally incur a high message complexity of $\\Omega(n^2)$. Recent work breaks the quadratic barrier, but demands linear runtime and relies on shared randomness.\n  Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18086/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.217233Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.444783Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f8e81d95ed716411d95048cc4d389f9ed733e972a9ba95afbe28e24a853985c3"},"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":"2605.18086","created_at":"2026-05-20T00:05:15.314099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18086v1","created_at":"2026-05-20T00:05:15.314099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18086","created_at":"2026-05-20T00:05:15.314099+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJLJRMLYKRVE","created_at":"2026-05-20T00:05:15.314099+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJLJRMLYKRVE3ORE","created_at":"2026-05-20T00:05:15.314099+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJLJRMLY","created_at":"2026-05-20T00:05:15.314099+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/TJLJRMLYKRVE3OREYZ5JDNX4C4","json":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4.json","graph_json":"https://pith.science/api/pith-number/TJLJRMLYKRVE3OREYZ5JDNX4C4/graph.json","events_json":"https://pith.science/api/pith-number/TJLJRMLYKRVE3OREYZ5JDNX4C4/events.json","paper":"https://pith.science/paper/TJLJRMLY"},"agent_actions":{"view_html":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4","download_json":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4.json","view_paper":"https://pith.science/paper/TJLJRMLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18086&json=true","fetch_graph":"https://pith.science/api/pith-number/TJLJRMLYKRVE3OREYZ5JDNX4C4/graph.json","fetch_events":"https://pith.science/api/pith-number/TJLJRMLYKRVE3OREYZ5JDNX4C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/action/storage_attestation","attest_author":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/action/author_attestation","sign_citation":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/action/citation_signature","submit_replication":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/action/replication_record"}},"created_at":"2026-05-20T00:05:15.314099+00:00","updated_at":"2026-05-20T00:05:15.314099+00:00"}