{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XO3O4FQEVRMVTMK654NYAKF7LI","short_pith_number":"pith:XO3O4FQE","canonical_record":{"source":{"id":"1908.02675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T15:14:09Z","cross_cats_sorted":[],"title_canon_sha256":"df84b7bbf2346c2dae2ba29d24a36746babdd8e81c8aad4f59f8ec8a88b6c688","abstract_canon_sha256":"6046d6e5798f18d1e4c821bbaea7b6dcd6fe48d12b142ff271d698e7cd898577"},"schema_version":"1.0"},"canonical_sha256":"bbb6ee1604ac5959b15eef1b8028bf5a08a19f7e27006d7fac1b693e675a29a3","source":{"kind":"arxiv","id":"1908.02675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02675","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02675v1","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02675","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_12","alias_value":"XO3O4FQEVRMV","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_16","alias_value":"XO3O4FQEVRMVTMK6","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_8","alias_value":"XO3O4FQE","created_at":"2026-07-04T23:52:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XO3O4FQEVRMVTMK654NYAKF7LI","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T15:14:09Z","cross_cats_sorted":[],"title_canon_sha256":"df84b7bbf2346c2dae2ba29d24a36746babdd8e81c8aad4f59f8ec8a88b6c688","abstract_canon_sha256":"6046d6e5798f18d1e4c821bbaea7b6dcd6fe48d12b142ff271d698e7cd898577"},"schema_version":"1.0"},"canonical_sha256":"bbb6ee1604ac5959b15eef1b8028bf5a08a19f7e27006d7fac1b693e675a29a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:11.286312Z","signature_b64":"sm9uP/q8+SJ+b7lJeQ3hMtai9n6oeb2XYWqVXVuSnLtpP29ZxsbQMtOxSDNSIZZKET7KX6uQigIXTUsSI/+/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbb6ee1604ac5959b15eef1b8028bf5a08a19f7e27006d7fac1b693e675a29a3","last_reissued_at":"2026-07-04T23:52:11.285952Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:11.285952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02675","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-07-04T23:52:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1Qrp3d47O7TWd7WKxI+OnzIrX/9ctD0WouqTIAFmbjsDYpYxDiEgpRMYSmwnWKYpx8VmmuTBUYXeKbwnx8LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:44:52.335579Z"},"content_sha256":"23e4aa114c8274a47e01adf489db895fe3e5a5f43b89d85ddaa08dddd1904868","schema_version":"1.0","event_id":"sha256:23e4aa114c8274a47e01adf489db895fe3e5a5f43b89d85ddaa08dddd1904868"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XO3O4FQEVRMVTMK654NYAKF7LI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generic Efficient Biased Optimizer for Consensus Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Roy Friedman, Yehonatan Buchnik","submitted_at":"2019-08-07T15:14:09Z","abstract_excerpt":"Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires multiple communication rounds. Yet, there are known optimistic protocols that guarantee termination in a single communication round under favorable conditions.\n  In this paper we present a generic optimizer than can turn any consensus protocol into an optimized protocol that ter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02675","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/1908.02675/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"},"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-07-04T23:52:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Qjis/17hl9fVYBiYhD6JKiOEqXfrHJmceQLhDGe6AJUl5K7Ytr1EkjEJXhQ57iujMQn00T4M4eRKHMri+dWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:44:52.336368Z"},"content_sha256":"c54903261c17ee2243494f8f8721a3e2a1af24ae8ada12243dab8b4b0d0361eb","schema_version":"1.0","event_id":"sha256:c54903261c17ee2243494f8f8721a3e2a1af24ae8ada12243dab8b4b0d0361eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XO3O4FQEVRMVTMK654NYAKF7LI/bundle.json","state_url":"https://pith.science/pith/XO3O4FQEVRMVTMK654NYAKF7LI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XO3O4FQEVRMVTMK654NYAKF7LI/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-08-16T22:44:52Z","links":{"resolver":"https://pith.science/pith/XO3O4FQEVRMVTMK654NYAKF7LI","bundle":"https://pith.science/pith/XO3O4FQEVRMVTMK654NYAKF7LI/bundle.json","state":"https://pith.science/pith/XO3O4FQEVRMVTMK654NYAKF7LI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XO3O4FQEVRMVTMK654NYAKF7LI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XO3O4FQEVRMVTMK654NYAKF7LI","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":"6046d6e5798f18d1e4c821bbaea7b6dcd6fe48d12b142ff271d698e7cd898577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T15:14:09Z","title_canon_sha256":"df84b7bbf2346c2dae2ba29d24a36746babdd8e81c8aad4f59f8ec8a88b6c688"},"schema_version":"1.0","source":{"id":"1908.02675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02675","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02675v1","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02675","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_12","alias_value":"XO3O4FQEVRMV","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_16","alias_value":"XO3O4FQEVRMVTMK6","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_8","alias_value":"XO3O4FQE","created_at":"2026-07-04T23:52:11Z"}],"graph_snapshots":[{"event_id":"sha256:c54903261c17ee2243494f8f8721a3e2a1af24ae8ada12243dab8b4b0d0361eb","target":"graph","created_at":"2026-07-04T23:52:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires multiple communication rounds. Yet, there are known optimistic protocols that guarantee termination in a single communication round under favorable conditions.\n  In this paper we present a generic optimizer than can turn any consensus protocol into an optimized protocol that ter","authors_text":"Roy Friedman, Yehonatan Buchnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T15:14:09Z","title":"A Generic Efficient Biased Optimizer for Consensus Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02675","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:23e4aa114c8274a47e01adf489db895fe3e5a5f43b89d85ddaa08dddd1904868","target":"record","created_at":"2026-07-04T23:52:11Z","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":"6046d6e5798f18d1e4c821bbaea7b6dcd6fe48d12b142ff271d698e7cd898577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T15:14:09Z","title_canon_sha256":"df84b7bbf2346c2dae2ba29d24a36746babdd8e81c8aad4f59f8ec8a88b6c688"},"schema_version":"1.0","source":{"id":"1908.02675","kind":"arxiv","version":1}},"canonical_sha256":"bbb6ee1604ac5959b15eef1b8028bf5a08a19f7e27006d7fac1b693e675a29a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbb6ee1604ac5959b15eef1b8028bf5a08a19f7e27006d7fac1b693e675a29a3","first_computed_at":"2026-07-04T23:52:11.285952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:11.285952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sm9uP/q8+SJ+b7lJeQ3hMtai9n6oeb2XYWqVXVuSnLtpP29ZxsbQMtOxSDNSIZZKET7KX6uQigIXTUsSI/+/Bw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:11.286312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23e4aa114c8274a47e01adf489db895fe3e5a5f43b89d85ddaa08dddd1904868","sha256:c54903261c17ee2243494f8f8721a3e2a1af24ae8ada12243dab8b4b0d0361eb"],"state_sha256":"ce92f8f23f87505518a52e95b16b9b560e847ffc40cc3864a29b09949488e832"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLmK/S5GYoEu7BIP4EwdXgNnP5mO8ObG9GMLDXmoZENlvKl2IjlwEpm2WQ9Pm2+u0XLI0LuocfA2dgB0+z+DDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:44:52.341854Z","bundle_sha256":"ae688900c7a56925eae45be64e9879fc41a913d47923a7323475c0bb98284db0"}}