{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MP6KZUIYWQP7EIWFJX33SKUHVV","short_pith_number":"pith:MP6KZUIY","schema_version":"1.0","canonical_sha256":"63fcacd118b41ff222c54df7b92a87ad4ef52f784773676edcae94cfc229cc1f","source":{"kind":"arxiv","id":"2605.18171","version":1},"attestation_state":"computed","paper":{"title":"Early-Stabilizing Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Julian Loss","submitted_at":"2026-05-18T10:13:01Z","abstract_excerpt":"Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily corrupted the system state and ceased, the at least $n-t$ non-faulty nodes need to (re-)establish that (i) their local outputs are identical and (ii) increase by $1$ modulo $C$ in each round. An overhead-free reduction from consensus shows that all known lower bounds and impossibilities for consensus carry over to the counting problem. In the other direction, prior"},"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.18171","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T10:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"52a535757174ec5f06310727123b265210faa16bcecbba8292ee6aed242d5d01","abstract_canon_sha256":"c09bc07e24a8c88860604e4f2f1f1e113c18f8a8afd0a0f6132351a7f04877cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:49.211529Z","signature_b64":"v+scMm/YNtaZAZUfvupjNlPDyjVxjnlucKDRLBvhNSHRciCVPbDG4fO0WermV2jPByfSmeC44eIN0lmxPnVBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63fcacd118b41ff222c54df7b92a87ad4ef52f784773676edcae94cfc229cc1f","last_reissued_at":"2026-05-20T00:05:49.210804Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:49.210804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Early-Stabilizing Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Julian Loss","submitted_at":"2026-05-18T10:13:01Z","abstract_excerpt":"Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily corrupted the system state and ceased, the at least $n-t$ non-faulty nodes need to (re-)establish that (i) their local outputs are identical and (ii) increase by $1$ modulo $C$ in each round. An overhead-free reduction from consensus shows that all known lower bounds and impossibilities for consensus carry over to the counting problem. In the other direction, prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18171","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.18171/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.046730Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.352039Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"33f3f36063f8e50f67e1320e8af8701598d7107ddd6585924a985aa99a088bb6"},"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.18171","created_at":"2026-05-20T00:05:49.210925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18171v1","created_at":"2026-05-20T00:05:49.210925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18171","created_at":"2026-05-20T00:05:49.210925+00:00"},{"alias_kind":"pith_short_12","alias_value":"MP6KZUIYWQP7","created_at":"2026-05-20T00:05:49.210925+00:00"},{"alias_kind":"pith_short_16","alias_value":"MP6KZUIYWQP7EIWF","created_at":"2026-05-20T00:05:49.210925+00:00"},{"alias_kind":"pith_short_8","alias_value":"MP6KZUIY","created_at":"2026-05-20T00:05:49.210925+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/MP6KZUIYWQP7EIWFJX33SKUHVV","json":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV.json","graph_json":"https://pith.science/api/pith-number/MP6KZUIYWQP7EIWFJX33SKUHVV/graph.json","events_json":"https://pith.science/api/pith-number/MP6KZUIYWQP7EIWFJX33SKUHVV/events.json","paper":"https://pith.science/paper/MP6KZUIY"},"agent_actions":{"view_html":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV","download_json":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV.json","view_paper":"https://pith.science/paper/MP6KZUIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18171&json=true","fetch_graph":"https://pith.science/api/pith-number/MP6KZUIYWQP7EIWFJX33SKUHVV/graph.json","fetch_events":"https://pith.science/api/pith-number/MP6KZUIYWQP7EIWFJX33SKUHVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV/action/storage_attestation","attest_author":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV/action/author_attestation","sign_citation":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV/action/citation_signature","submit_replication":"https://pith.science/pith/MP6KZUIYWQP7EIWFJX33SKUHVV/action/replication_record"}},"created_at":"2026-05-20T00:05:49.210925+00:00","updated_at":"2026-05-20T00:05:49.210925+00:00"}