{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TJLJRMLYKRVE3OREYZ5JDNX4C4","short_pith_number":"pith:TJLJRMLY","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"},"canonical_sha256":"9a5698b178546a4dba24c67a91b6fc173f3c0b33d1687704464cc18a48bf37f1","source":{"kind":"arxiv","id":"2605.18086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18086","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18086v1","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18086","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"TJLJRMLYKRVE","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"TJLJRMLYKRVE3ORE","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"TJLJRMLY","created_at":"2026-05-20T00:05:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TJLJRMLYKRVE3OREYZ5JDNX4C4","target":"record","payload":{"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"},"canonical_sha256":"9a5698b178546a4dba24c67a91b6fc173f3c0b33d1687704464cc18a48bf37f1","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"},"source_kind":"arxiv","source_id":"2605.18086","source_version":1,"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-20T00:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zql/IFx5PJMwMQtSLkRLod+rgvHTcpcd+afq25HYi6doqwlgiuViyCAvUOIQPbCGQ0I10UuqqOIFttMo7QUYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:17:33.746336Z"},"content_sha256":"0dc7ac1e5db7e1ccd30f59e459c3f8e3a0f53666e104c2c707f61f0b3675a575","schema_version":"1.0","event_id":"sha256:0dc7ac1e5db7e1ccd30f59e459c3f8e3a0f53666e104c2c707f61f0b3675a575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TJLJRMLYKRVE3OREYZ5JDNX4C4","target":"graph","payload":{"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"},"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-20T00:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GNSPqGlu9PXKcsQTamFqZLnS0JDEtrsOAKXlFgfgaBLiYASkMujBLjn40L1iSz5Cv+hg3fVuNfewOWWEbK8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:17:33.746764Z"},"content_sha256":"69cf017692c7b6bcca546dfe3d07532d65051ff8c94013bd830df60cef9147fb","schema_version":"1.0","event_id":"sha256:69cf017692c7b6bcca546dfe3d07532d65051ff8c94013bd830df60cef9147fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/bundle.json","state_url":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/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-05-30T13:17:33Z","links":{"resolver":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4","bundle":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/bundle.json","state":"https://pith.science/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJLJRMLYKRVE3OREYZ5JDNX4C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TJLJRMLYKRVE3OREYZ5JDNX4C4","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":"4dd43f05f6cf3d6c997ba198fd95d27a40f57308f27e7379e4c8075e2e7969f3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T09:01:32Z","title_canon_sha256":"9572ec60f84d3d1df1ebb0a21c5f378ae35b2097373b7f8a9d9845f0dd0921c6"},"schema_version":"1.0","source":{"id":"2605.18086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18086","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18086v1","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18086","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"TJLJRMLYKRVE","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"TJLJRMLYKRVE3ORE","created_at":"2026-05-20T00:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"TJLJRMLY","created_at":"2026-05-20T00:05:15Z"}],"graph_snapshots":[{"event_id":"sha256:69cf017692c7b6bcca546dfe3d07532d65051ff8c94013bd830df60cef9147fb","target":"graph","created_at":"2026-05-20T00:05:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.18086/integrity.json","findings":[],"snapshot_sha256":"f8e81d95ed716411d95048cc4d389f9ed733e972a9ba95afbe28e24a853985c3","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chaodong Zheng, Sirui Bai, Xinyu Fu, Yuyi Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T09:01:32Z","title":"Distributed Renaming with Subquadratic Bits via Scalable Committee Election"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18086","kind":"arxiv","version":1},"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:0dc7ac1e5db7e1ccd30f59e459c3f8e3a0f53666e104c2c707f61f0b3675a575","target":"record","created_at":"2026-05-20T00:05:15Z","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":"4dd43f05f6cf3d6c997ba198fd95d27a40f57308f27e7379e4c8075e2e7969f3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T09:01:32Z","title_canon_sha256":"9572ec60f84d3d1df1ebb0a21c5f378ae35b2097373b7f8a9d9845f0dd0921c6"},"schema_version":"1.0","source":{"id":"2605.18086","kind":"arxiv","version":1}},"canonical_sha256":"9a5698b178546a4dba24c67a91b6fc173f3c0b33d1687704464cc18a48bf37f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a5698b178546a4dba24c67a91b6fc173f3c0b33d1687704464cc18a48bf37f1","first_computed_at":"2026-05-20T00:05:15.313965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:15.313965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k18G/mErJgrEm521wsCG9LNHFu3+MQ32krvobrhbgNaDqr2PTTlEtjW/S1EAh8l/iyqkwFDvfj8kWhKbNZbDCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:15.314800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dc7ac1e5db7e1ccd30f59e459c3f8e3a0f53666e104c2c707f61f0b3675a575","sha256:69cf017692c7b6bcca546dfe3d07532d65051ff8c94013bd830df60cef9147fb"],"state_sha256":"b1303402319cf19310dd911cdb58274c5ece47140bd5ae62f561f960a8fb9169"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjX6s9pti6DbAgYJ37dKlDlgD9eYzXW2yPbv09TDu96px6mqe/U/YgbnfqCqUT/YiqUpim6Kgjm4KldsuL2MAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:17:33.748976Z","bundle_sha256":"619cb3e75838af411e9a7b59ac921fbfd7b82f7641ab3ffab93e9145ad63bfec"}}