{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4662TZ67JL4KBXK7X5DO5WLH4X","short_pith_number":"pith:4662TZ67","schema_version":"1.0","canonical_sha256":"e7bda9e7df4af8a0dd5fbf46eed967e5f6fb37c3d5548fd5dc1fd18bce3ac623","source":{"kind":"arxiv","id":"1311.6902","version":1},"attestation_state":"computed","paper":{"title":"Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Armando Casta\\~neda, Yannai A. Gonczarowski, Yoram Moses","submitted_at":"2013-11-27T09:13:43Z","abstract_excerpt":"While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t+1 rounds in all runs, it was soon realized that they could be strictly improved upon by early stopping protocols. These dominate the first ones, by always deciding in at most t+1 rounds, but often much faster. A protocol is unbeatable if it can't be strictly dominated. Unbeatability is often a much more suitable notion of optimality for distributed protocols than worst-case performance. Using a knowledge-based analysis, this paper studies unbeatability for"},"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":"1311.6902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-27T09:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"be9e5f7c9fffdc66b1940c663195cab87f1a661d3bc5fc49cb1b099f04ef1ee7","abstract_canon_sha256":"f34f0d982c527999957b2f56890cdbab6de9001511b4cd38afaae54d12120bfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:05.237631Z","signature_b64":"q0JlKEqaL427H23R765fWS0Wv2hZ+fK5P7hK1L1SxeK4L9xyNVt5ivU2n6Vlva9/XCjW8heopE6swx/Z4TfwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7bda9e7df4af8a0dd5fbf46eed967e5f6fb37c3d5548fd5dc1fd18bce3ac623","last_reissued_at":"2026-05-18T03:06:05.237229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:05.237229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Armando Casta\\~neda, Yannai A. Gonczarowski, Yoram Moses","submitted_at":"2013-11-27T09:13:43Z","abstract_excerpt":"While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t+1 rounds in all runs, it was soon realized that they could be strictly improved upon by early stopping protocols. These dominate the first ones, by always deciding in at most t+1 rounds, but often much faster. A protocol is unbeatable if it can't be strictly dominated. Unbeatability is often a much more suitable notion of optimality for distributed protocols than worst-case performance. Using a knowledge-based analysis, this paper studies unbeatability for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6902","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":"1311.6902","created_at":"2026-05-18T03:06:05.237284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6902v1","created_at":"2026-05-18T03:06:05.237284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6902","created_at":"2026-05-18T03:06:05.237284+00:00"},{"alias_kind":"pith_short_12","alias_value":"4662TZ67JL4K","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4662TZ67JL4KBXK7","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4662TZ67","created_at":"2026-05-18T12:27:32.513160+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/4662TZ67JL4KBXK7X5DO5WLH4X","json":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X.json","graph_json":"https://pith.science/api/pith-number/4662TZ67JL4KBXK7X5DO5WLH4X/graph.json","events_json":"https://pith.science/api/pith-number/4662TZ67JL4KBXK7X5DO5WLH4X/events.json","paper":"https://pith.science/paper/4662TZ67"},"agent_actions":{"view_html":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X","download_json":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X.json","view_paper":"https://pith.science/paper/4662TZ67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6902&json=true","fetch_graph":"https://pith.science/api/pith-number/4662TZ67JL4KBXK7X5DO5WLH4X/graph.json","fetch_events":"https://pith.science/api/pith-number/4662TZ67JL4KBXK7X5DO5WLH4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X/action/storage_attestation","attest_author":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X/action/author_attestation","sign_citation":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X/action/citation_signature","submit_replication":"https://pith.science/pith/4662TZ67JL4KBXK7X5DO5WLH4X/action/replication_record"}},"created_at":"2026-05-18T03:06:05.237284+00:00","updated_at":"2026-05-18T03:06:05.237284+00:00"}