{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NHBLJ7A3MJHLYDBRVBTRK3NHH3","short_pith_number":"pith:NHBLJ7A3","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"},"canonical_sha256":"69c2b4fc1b624ebc0c31a867156da73ed34e06274482b4d434995c24a42e30c1","source":{"kind":"arxiv","id":"1503.06702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06702","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06702v1","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06702","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"NHBLJ7A3MJHL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHBLJ7A3MJHLYDBR","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHBLJ7A3","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NHBLJ7A3MJHLYDBRVBTRK3NHH3","target":"record","payload":{"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"},"canonical_sha256":"69c2b4fc1b624ebc0c31a867156da73ed34e06274482b4d434995c24a42e30c1","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"},"source_kind":"arxiv","source_id":"1503.06702","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-18T02:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iURTppHLCXQYsAw4tTkd0e+atSIe204IiqiiIuU+tlYEVemmCTf+jiS9TdHmDL9HzEx81RPmjgebskpRfXeIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:08.499936Z"},"content_sha256":"f8a8d3e87aeb6d860f59b3585a48ed1f21530baad6328da6aa730c37c7396131","schema_version":"1.0","event_id":"sha256:f8a8d3e87aeb6d860f59b3585a48ed1f21530baad6328da6aa730c37c7396131"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NHBLJ7A3MJHLYDBRVBTRK3NHH3","target":"graph","payload":{"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"},"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-18T02:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWd+tW5LPazRa1TKvBGqXJZh4Lr4Y52ycBV5u6+4o7TvyJIOjvL+kOCagft9uR9SVN9PF/7hFNoH6M/KimJ9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:08.500533Z"},"content_sha256":"13586310cdc5e75543125cefcdecf69451e10d4abfb3b8c8a017a2df0ea94346","schema_version":"1.0","event_id":"sha256:13586310cdc5e75543125cefcdecf69451e10d4abfb3b8c8a017a2df0ea94346"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/bundle.json","state_url":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/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-28T23:36:08Z","links":{"resolver":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3","bundle":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/bundle.json","state":"https://pith.science/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHBLJ7A3MJHLYDBRVBTRK3NHH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NHBLJ7A3MJHLYDBRVBTRK3NHH3","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":"c84777952e2e9c8b8f751c14d34c4fdb1140d03601355f383695298fb6eb5322","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-23T16:12:32Z","title_canon_sha256":"7c61b7debb02b9326c56a9c6545cac7f9fe9777659d8dd7ae155284fe37fe7df"},"schema_version":"1.0","source":{"id":"1503.06702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06702","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06702v1","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06702","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"NHBLJ7A3MJHL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHBLJ7A3MJHLYDBR","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHBLJ7A3","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:13586310cdc5e75543125cefcdecf69451e10d4abfb3b8c8a017a2df0ea94346","target":"graph","created_at":"2026-05-18T02:20:37Z","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"},"paper":{"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","authors_text":"Christoph Lenzen, Joel Rybicki, Jukka Suomela","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-23T16:12:32Z","title":"Towards Optimal Synchronous Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06702","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:f8a8d3e87aeb6d860f59b3585a48ed1f21530baad6328da6aa730c37c7396131","target":"record","created_at":"2026-05-18T02:20:37Z","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":"c84777952e2e9c8b8f751c14d34c4fdb1140d03601355f383695298fb6eb5322","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-23T16:12:32Z","title_canon_sha256":"7c61b7debb02b9326c56a9c6545cac7f9fe9777659d8dd7ae155284fe37fe7df"},"schema_version":"1.0","source":{"id":"1503.06702","kind":"arxiv","version":1}},"canonical_sha256":"69c2b4fc1b624ebc0c31a867156da73ed34e06274482b4d434995c24a42e30c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c2b4fc1b624ebc0c31a867156da73ed34e06274482b4d434995c24a42e30c1","first_computed_at":"2026-05-18T02:20:37.565275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:37.565275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8m3UBeQiBUMk4goUZVunwZsYIKrl6ZvLydZ5Mdn7QfmoWuxsKGKRAo+dk9XeNnwBmx1Vyfo7BuOYI/kP1kXMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:37.565942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8a8d3e87aeb6d860f59b3585a48ed1f21530baad6328da6aa730c37c7396131","sha256:13586310cdc5e75543125cefcdecf69451e10d4abfb3b8c8a017a2df0ea94346"],"state_sha256":"5f05a74c5b4029de5856b5d60accd0187041002cc946a0c73caeeb90424be0fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vB2DNpiIMuNTCKw2UuAYpOTkUcONuYpTXbMS41oOJpOILOoH9VbpOhQO1NUDJ2QkaDyc4iJwhIO4cDny752HCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:36:08.503768Z","bundle_sha256":"ef8e3bdc8b3ac5bd5a000ce2800d6355cf8d87b8f7fa8a9792fbc0204cecd70d"}}