{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FD7KJC4HDACHAWPZGBUDZDFRXA","short_pith_number":"pith:FD7KJC4H","schema_version":"1.0","canonical_sha256":"28fea48b8718047059f930683c8cb1b801312a07070104bc26b35f8131633cbf","source":{"kind":"arxiv","id":"2504.12218","version":2},"attestation_state":"computed","paper":{"title":"Accountable Liveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew Lewis-Pye, Joachim Neu, Luca Zanolini, Tim Roughgarden","submitted_at":"2025-04-16T16:13:09Z","abstract_excerpt":"Safety and liveness are the two classical security properties of consensus protocols. Recent works have strengthened safety with accountability: should any safety violation occur, a sizable fraction of adversary nodes can be proven to be protocol violators. This paper studies to what extent analogous accountability guarantees are achievable for liveness. To reveal the full complexity of this question, we introduce an interpolation between the classical synchronous and partially-synchronous models that we call the $x$-partially-synchronous network model in which, intuitively, at most an $x$ fra"},"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":"2504.12218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-04-16T16:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"6a46e4a75d505aed7c4ddb98ba3d41d83499d2556ae44e7ba590ae4d69f80628","abstract_canon_sha256":"8ac6d856a3475afd354a573ce3263c0a6328fbdf6f81f640bf26e14ded82eac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:16.621186Z","signature_b64":"NxvD7HKc1rAIHf4z7+Inf7GdwY6Le3dnS/nXC78IEdzOjO7vnMmsxit9vI88YyIz0cnfAeElB0Buvzl38eefAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28fea48b8718047059f930683c8cb1b801312a07070104bc26b35f8131633cbf","last_reissued_at":"2026-07-05T12:09:16.620643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:16.620643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accountable Liveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew Lewis-Pye, Joachim Neu, Luca Zanolini, Tim Roughgarden","submitted_at":"2025-04-16T16:13:09Z","abstract_excerpt":"Safety and liveness are the two classical security properties of consensus protocols. Recent works have strengthened safety with accountability: should any safety violation occur, a sizable fraction of adversary nodes can be proven to be protocol violators. This paper studies to what extent analogous accountability guarantees are achievable for liveness. To reveal the full complexity of this question, we introduce an interpolation between the classical synchronous and partially-synchronous models that we call the $x$-partially-synchronous network model in which, intuitively, at most an $x$ fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.12218","kind":"arxiv","version":2},"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/2504.12218/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.12218","created_at":"2026-07-05T12:09:16.620701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.12218v2","created_at":"2026-07-05T12:09:16.620701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.12218","created_at":"2026-07-05T12:09:16.620701+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD7KJC4HDACH","created_at":"2026-07-05T12:09:16.620701+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD7KJC4HDACHAWPZ","created_at":"2026-07-05T12:09:16.620701+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD7KJC4H","created_at":"2026-07-05T12:09:16.620701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.16783","citing_title":"CoBRA: A Universal Strategyproof Confirmation Protocol for Quorum-based Proof-of-Stake Blockchains","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA","json":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA.json","graph_json":"https://pith.science/api/pith-number/FD7KJC4HDACHAWPZGBUDZDFRXA/graph.json","events_json":"https://pith.science/api/pith-number/FD7KJC4HDACHAWPZGBUDZDFRXA/events.json","paper":"https://pith.science/paper/FD7KJC4H"},"agent_actions":{"view_html":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA","download_json":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA.json","view_paper":"https://pith.science/paper/FD7KJC4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.12218&json=true","fetch_graph":"https://pith.science/api/pith-number/FD7KJC4HDACHAWPZGBUDZDFRXA/graph.json","fetch_events":"https://pith.science/api/pith-number/FD7KJC4HDACHAWPZGBUDZDFRXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA/action/storage_attestation","attest_author":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA/action/author_attestation","sign_citation":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA/action/citation_signature","submit_replication":"https://pith.science/pith/FD7KJC4HDACHAWPZGBUDZDFRXA/action/replication_record"}},"created_at":"2026-07-05T12:09:16.620701+00:00","updated_at":"2026-07-05T12:09:16.620701+00:00"}