{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S24MCLZHZEX2CWTJJYYZDPSWHZ","short_pith_number":"pith:S24MCLZH","schema_version":"1.0","canonical_sha256":"96b8c12f27c92fa15a694e3191be563e48a20b861aa461733a13279ff66b6936","source":{"kind":"arxiv","id":"2502.01227","version":2},"attestation_state":"computed","paper":{"title":"Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Grzegorz Stachowiak, Leszek G\\k{a}sieniec, Tytus Grodzicki","submitted_at":"2025-02-03T10:30:01Z","abstract_excerpt":"We investigate leader election problem via ranking within self-stabilising population protocols. In this scenario, the agent's state space comprises $n$ rank states and $x$ extra states. The initial configuration of $n$ agents consists of arbitrary arrangements of rank and extra states, with the objective of self-ranking. Specifically, each agent is tasked with stabilising in a unique rank state silently, implying that after stabilisation, each agent remains in its designated state indefinitely.\n  In this paper, we present several new self-stabilising ranking protocols, greatly enriching our c"},"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":"2502.01227","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-02-03T10:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"652f8d0b1a4e3211dbc1fe031d30125db509c0bcb59dd103715586dc2409355a","abstract_canon_sha256":"40c259c73e06a1a8b71d1b0d1b523ad915512434d6b71eae2cbe21b12ea078e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:22.985579Z","signature_b64":"TWuKEzRr1nQnuJ3jeUJITbmJljcoighFYBuea4kAsUO8fCNxTFGTZBdNVhtx8INPWrPPT0wunDNsmSY6wmvTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b8c12f27c92fa15a694e3191be563e48a20b861aa461733a13279ff66b6936","last_reissued_at":"2026-07-05T10:58:22.985048Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:22.985048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Grzegorz Stachowiak, Leszek G\\k{a}sieniec, Tytus Grodzicki","submitted_at":"2025-02-03T10:30:01Z","abstract_excerpt":"We investigate leader election problem via ranking within self-stabilising population protocols. In this scenario, the agent's state space comprises $n$ rank states and $x$ extra states. The initial configuration of $n$ agents consists of arbitrary arrangements of rank and extra states, with the objective of self-ranking. Specifically, each agent is tasked with stabilising in a unique rank state silently, implying that after stabilisation, each agent remains in its designated state indefinitely.\n  In this paper, we present several new self-stabilising ranking protocols, greatly enriching our c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01227","kind":"arxiv","version":2},"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/2502.01227/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":"2502.01227","created_at":"2026-07-05T10:58:22.985128+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01227v2","created_at":"2026-07-05T10:58:22.985128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01227","created_at":"2026-07-05T10:58:22.985128+00:00"},{"alias_kind":"pith_short_12","alias_value":"S24MCLZHZEX2","created_at":"2026-07-05T10:58:22.985128+00:00"},{"alias_kind":"pith_short_16","alias_value":"S24MCLZHZEX2CWTJ","created_at":"2026-07-05T10:58:22.985128+00:00"},{"alias_kind":"pith_short_8","alias_value":"S24MCLZH","created_at":"2026-07-05T10:58:22.985128+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":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ","json":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ.json","graph_json":"https://pith.science/api/pith-number/S24MCLZHZEX2CWTJJYYZDPSWHZ/graph.json","events_json":"https://pith.science/api/pith-number/S24MCLZHZEX2CWTJJYYZDPSWHZ/events.json","paper":"https://pith.science/paper/S24MCLZH"},"agent_actions":{"view_html":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ","download_json":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ.json","view_paper":"https://pith.science/paper/S24MCLZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01227&json=true","fetch_graph":"https://pith.science/api/pith-number/S24MCLZHZEX2CWTJJYYZDPSWHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/S24MCLZHZEX2CWTJJYYZDPSWHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ/action/storage_attestation","attest_author":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ/action/author_attestation","sign_citation":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ/action/citation_signature","submit_replication":"https://pith.science/pith/S24MCLZHZEX2CWTJJYYZDPSWHZ/action/replication_record"}},"created_at":"2026-07-05T10:58:22.985128+00:00","updated_at":"2026-07-05T10:58:22.985128+00:00"}