{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NHBLJ7A3MJHLYDBRVBTRK3NHH3","short_pith_number":"pith:NHBLJ7A3","schema_version":"1.0","canonical_sha256":"69c2b4fc1b624ebc0c31a867156da73ed34e06274482b4d434995c24a42e30c1","source":{"kind":"arxiv","id":"1503.06702","version":1},"attestation_state":"computed","paper":{"title":"Towards Optimal Synchronous Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Joel Rybicki, Jukka Suomela","submitted_at":"2015-03-23T16:12:32Z","abstract_excerpt":"Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behaviour, the task is to eventually have all correct nodes counting modulo $c$ in agreement. Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures. In this work, we give new algorithms for the synchronous counting problem that (1) are deterministic, (2) have linear stabilisation time in $f$, (3) use a small number of states, and (4) achieve almos"},"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":"1503.06702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-23T16:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"7c61b7debb02b9326c56a9c6545cac7f9fe9777659d8dd7ae155284fe37fe7df","abstract_canon_sha256":"c84777952e2e9c8b8f751c14d34c4fdb1140d03601355f383695298fb6eb5322"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:37.565942Z","signature_b64":"8m3UBeQiBUMk4goUZVunwZsYIKrl6ZvLydZ5Mdn7QfmoWuxsKGKRAo+dk9XeNnwBmx1Vyfo7BuOYI/kP1kXMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c2b4fc1b624ebc0c31a867156da73ed34e06274482b4d434995c24a42e30c1","last_reissued_at":"2026-05-18T02:20:37.565275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:37.565275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Synchronous Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Joel Rybicki, Jukka Suomela","submitted_at":"2015-03-23T16:12:32Z","abstract_excerpt":"Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behaviour, the task is to eventually have all correct nodes counting modulo $c$ in agreement. Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures. In this work, we give new algorithms for the synchronous counting problem that (1) are deterministic, (2) have linear stabilisation time in $f$, (3) use a small number of states, and (4) achieve almos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06702","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":"1503.06702","created_at":"2026-05-18T02:20:37.565389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06702v1","created_at":"2026-05-18T02:20:37.565389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06702","created_at":"2026-05-18T02:20:37.565389+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHBLJ7A3MJHL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHBLJ7A3MJHLYDBR","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHBLJ7A3","created_at":"2026-05-18T12:29:32.376354+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/NHBLJ7A3MJHLYDBRVBTRK3NHH3","json":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3.json","graph_json":"https://pith.science/api/pith-number/NHBLJ7A3MJHLYDBRVBTRK3NHH3/graph.json","events_json":"https://pith.science/api/pith-number/NHBLJ7A3MJHLYDBRVBTRK3NHH3/events.json","paper":"https://pith.science/paper/NHBLJ7A3"},"agent_actions":{"view_html":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3","download_json":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3.json","view_paper":"https://pith.science/paper/NHBLJ7A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06702&json=true","fetch_graph":"https://pith.science/api/pith-number/NHBLJ7A3MJHLYDBRVBTRK3NHH3/graph.json","fetch_events":"https://pith.science/api/pith-number/NHBLJ7A3MJHLYDBRVBTRK3NHH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/action/storage_attestation","attest_author":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/action/author_attestation","sign_citation":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/action/citation_signature","submit_replication":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/action/replication_record"}},"created_at":"2026-05-18T02:20:37.565389+00:00","updated_at":"2026-05-18T02:20:37.565389+00:00"}