{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WGPHLEESFQNBTSN2FRA2FFWEBX","short_pith_number":"pith:WGPHLEES","canonical_record":{"source":{"id":"2311.08060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-14T10:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"4c4abd46172b8661781cf75263a0bd5beb032ba45b6ce76170a998bc327532e0","abstract_canon_sha256":"5147fa9daaaa70c92fdb4abea68fda9b8edd9403830557d920c0b52b86c5c0a0"},"schema_version":"1.0"},"canonical_sha256":"b19e7590922c1a19c9ba2c41a296c40dcb44bd3e8b084b0365c440ad41f4d092","source":{"kind":"arxiv","id":"2311.08060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08060","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08060v2","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08060","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"WGPHLEESFQNB","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"pith_short_16","alias_value":"WGPHLEESFQNBTSN2","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"pith_short_8","alias_value":"WGPHLEES","created_at":"2026-07-05T07:12:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WGPHLEESFQNBTSN2FRA2FFWEBX","target":"record","payload":{"canonical_record":{"source":{"id":"2311.08060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-14T10:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"4c4abd46172b8661781cf75263a0bd5beb032ba45b6ce76170a998bc327532e0","abstract_canon_sha256":"5147fa9daaaa70c92fdb4abea68fda9b8edd9403830557d920c0b52b86c5c0a0"},"schema_version":"1.0"},"canonical_sha256":"b19e7590922c1a19c9ba2c41a296c40dcb44bd3e8b084b0365c440ad41f4d092","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:56.120549Z","signature_b64":"chutgw7LeNqSF/6KCL15Ov+glvd2gZqlfVQDENBSIjnt8LnrpzVwyfIx5pfFdrMe8Cr/AgYdI0wUPlgW3Ix1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19e7590922c1a19c9ba2c41a296c40dcb44bd3e8b084b0365c440ad41f4d092","last_reissued_at":"2026-07-05T07:12:56.119990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:56.119990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.08060","source_version":2,"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-05T07:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkA5GcVcdTyw7quc5d0q9pSCyHOpngDidq92ap+nngcfdk4wXUatSn0zJQvH6e73cz5LKLCimyEnZV7ucCPKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:38:38.270637Z"},"content_sha256":"3cbfc78f5e6aa8707e9290a09d5e741eea4f579d78de641a955ac21e76dc0b3d","schema_version":"1.0","event_id":"sha256:3cbfc78f5e6aa8707e9290a09d5e741eea4f579d78de641a955ac21e76dc0b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WGPHLEESFQNBTSN2FRA2FFWEBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"All Byzantine Agreement Problems are Expensive","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anton Paramonov, Jovan Komatovic, Manuel Vidigueira, Pierre Civit, Rachid Guerraoui, Seth Gilbert","submitted_at":"2023-11-14T10:33:46Z","abstract_excerpt":"Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem states that all correct (non-faulty) processes must eventually decide (termination) the same value (agreement) from a set of admissible values defined by the proposals of the processes (validity). Depending on the exact version of the validity property, Byzantine agreement comes in different forms, from Byzantine broadcast to strong and weak consensus, to modern variants of the problem introduced in today's blockchain sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08060","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/2311.08060/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-05T07:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rukhNwqOl/tp9RUkm0ifSUIAZPq0Am6w4RiXke0xxvRInQhYAZHs57UaInXkiI7atCMHD4WIMlf3An9HUW5vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:38:38.271264Z"},"content_sha256":"2742620a2a5536a3e8c0e4a84d75361ba9864ee1abef4bfd2edddd758c03bb34","schema_version":"1.0","event_id":"sha256:2742620a2a5536a3e8c0e4a84d75361ba9864ee1abef4bfd2edddd758c03bb34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGPHLEESFQNBTSN2FRA2FFWEBX/bundle.json","state_url":"https://pith.science/pith/WGPHLEESFQNBTSN2FRA2FFWEBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGPHLEESFQNBTSN2FRA2FFWEBX/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-07-05T14:38:38Z","links":{"resolver":"https://pith.science/pith/WGPHLEESFQNBTSN2FRA2FFWEBX","bundle":"https://pith.science/pith/WGPHLEESFQNBTSN2FRA2FFWEBX/bundle.json","state":"https://pith.science/pith/WGPHLEESFQNBTSN2FRA2FFWEBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGPHLEESFQNBTSN2FRA2FFWEBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WGPHLEESFQNBTSN2FRA2FFWEBX","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":"5147fa9daaaa70c92fdb4abea68fda9b8edd9403830557d920c0b52b86c5c0a0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-14T10:33:46Z","title_canon_sha256":"4c4abd46172b8661781cf75263a0bd5beb032ba45b6ce76170a998bc327532e0"},"schema_version":"1.0","source":{"id":"2311.08060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08060","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08060v2","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08060","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"WGPHLEESFQNB","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"pith_short_16","alias_value":"WGPHLEESFQNBTSN2","created_at":"2026-07-05T07:12:56Z"},{"alias_kind":"pith_short_8","alias_value":"WGPHLEES","created_at":"2026-07-05T07:12:56Z"}],"graph_snapshots":[{"event_id":"sha256:2742620a2a5536a3e8c0e4a84d75361ba9864ee1abef4bfd2edddd758c03bb34","target":"graph","created_at":"2026-07-05T07:12:56Z","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/2311.08060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem states that all correct (non-faulty) processes must eventually decide (termination) the same value (agreement) from a set of admissible values defined by the proposals of the processes (validity). Depending on the exact version of the validity property, Byzantine agreement comes in different forms, from Byzantine broadcast to strong and weak consensus, to modern variants of the problem introduced in today's blockchain sy","authors_text":"Anton Paramonov, Jovan Komatovic, Manuel Vidigueira, Pierre Civit, Rachid Guerraoui, Seth Gilbert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-14T10:33:46Z","title":"All Byzantine Agreement Problems are Expensive"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08060","kind":"arxiv","version":2},"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:3cbfc78f5e6aa8707e9290a09d5e741eea4f579d78de641a955ac21e76dc0b3d","target":"record","created_at":"2026-07-05T07:12:56Z","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":"5147fa9daaaa70c92fdb4abea68fda9b8edd9403830557d920c0b52b86c5c0a0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-14T10:33:46Z","title_canon_sha256":"4c4abd46172b8661781cf75263a0bd5beb032ba45b6ce76170a998bc327532e0"},"schema_version":"1.0","source":{"id":"2311.08060","kind":"arxiv","version":2}},"canonical_sha256":"b19e7590922c1a19c9ba2c41a296c40dcb44bd3e8b084b0365c440ad41f4d092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b19e7590922c1a19c9ba2c41a296c40dcb44bd3e8b084b0365c440ad41f4d092","first_computed_at":"2026-07-05T07:12:56.119990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:56.119990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"chutgw7LeNqSF/6KCL15Ov+glvd2gZqlfVQDENBSIjnt8LnrpzVwyfIx5pfFdrMe8Cr/AgYdI0wUPlgW3Ix1Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:56.120549Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.08060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cbfc78f5e6aa8707e9290a09d5e741eea4f579d78de641a955ac21e76dc0b3d","sha256:2742620a2a5536a3e8c0e4a84d75361ba9864ee1abef4bfd2edddd758c03bb34"],"state_sha256":"7e5e7d4a401e0ff412a12f7283865a881e1309f7c3c3a5f46dbc6783a8711ea2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMUctISeG3NnoVPBIXYgWxaFSOcu9FjfI68KP+f+rddzIWScuQZjQ6a/p1eLjJO4pzjoHH0fnGYSfwSlF2KNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:38:38.274550Z","bundle_sha256":"47d34e2fa888ed252a74df4701b7336fe9c5f66add137f0de068d00a8f95bf50"}}