{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QBVDVCL66QRERZC4OSLZREVQZK","short_pith_number":"pith:QBVDVCL6","schema_version":"1.0","canonical_sha256":"806a3a897ef42248e45c74979892b0ca91e5ee3b687deab850a6553b010fa8f5","source":{"kind":"arxiv","id":"2505.01210","version":1},"attestation_state":"computed","paper":{"title":"A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Henry Austin, Lukas Hintze, Petra Berenbrink, Thorsten G\\\"otte, Tom Friedetzky","submitted_at":"2025-05-02T11:54:31Z","abstract_excerpt":"We consider the problem of self-stabilizing leader election in the population model by Angluin, Aspnes, Diamadi, Fischer, and Peralta (JDistComp '06). The population model is a well-established and powerful model for asynchronous, distributed computation with a large number of applications. For self-stabilizing leader election, the population of $n$ anonymous agents, interacting in uniformly random pairs, must stabilize with a single leader from any possible initial configuration.\n  The focus of this paper is to develop time-efficient self-stabilizing protocols whilst minimizing the number of "},"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":"2505.01210","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-02T11:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"cb9272c0a20736ceb7a32f6651b5446df7fac342a2d9c2ac0e39810e3e2b1123","abstract_canon_sha256":"b9c1ba1d720979b22a3a4da47675d494c51d2435ec19916f95cb775d416f569e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:47.631353Z","signature_b64":"7AvCuzorFWd+E+5Z8k2REthT1ELQ4ZVv1CEKA8IuIhPF4XTp7XKWoJkMlUVo9o5c2J/DyM/Z9qXtRMk58iL8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"806a3a897ef42248e45c74979892b0ca91e5ee3b687deab850a6553b010fa8f5","last_reissued_at":"2026-07-05T10:57:47.630746Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:47.630746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Henry Austin, Lukas Hintze, Petra Berenbrink, Thorsten G\\\"otte, Tom Friedetzky","submitted_at":"2025-05-02T11:54:31Z","abstract_excerpt":"We consider the problem of self-stabilizing leader election in the population model by Angluin, Aspnes, Diamadi, Fischer, and Peralta (JDistComp '06). The population model is a well-established and powerful model for asynchronous, distributed computation with a large number of applications. For self-stabilizing leader election, the population of $n$ anonymous agents, interacting in uniformly random pairs, must stabilize with a single leader from any possible initial configuration.\n  The focus of this paper is to develop time-efficient self-stabilizing protocols whilst minimizing the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01210","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/2505.01210/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.01210","created_at":"2026-07-05T10:57:47.630811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01210v1","created_at":"2026-07-05T10:57:47.630811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01210","created_at":"2026-07-05T10:57:47.630811+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBVDVCL66QRE","created_at":"2026-07-05T10:57:47.630811+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBVDVCL66QRERZC4","created_at":"2026-07-05T10:57:47.630811+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBVDVCL6","created_at":"2026-07-05T10:57:47.630811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23649","citing_title":"Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK","json":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK.json","graph_json":"https://pith.science/api/pith-number/QBVDVCL66QRERZC4OSLZREVQZK/graph.json","events_json":"https://pith.science/api/pith-number/QBVDVCL66QRERZC4OSLZREVQZK/events.json","paper":"https://pith.science/paper/QBVDVCL6"},"agent_actions":{"view_html":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK","download_json":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK.json","view_paper":"https://pith.science/paper/QBVDVCL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01210&json=true","fetch_graph":"https://pith.science/api/pith-number/QBVDVCL66QRERZC4OSLZREVQZK/graph.json","fetch_events":"https://pith.science/api/pith-number/QBVDVCL66QRERZC4OSLZREVQZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK/action/storage_attestation","attest_author":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK/action/author_attestation","sign_citation":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK/action/citation_signature","submit_replication":"https://pith.science/pith/QBVDVCL66QRERZC4OSLZREVQZK/action/replication_record"}},"created_at":"2026-07-05T10:57:47.630811+00:00","updated_at":"2026-07-05T10:57:47.630811+00:00"}