{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:D2ZMOSM5AR23WQ4BJZKDVG7OFK","short_pith_number":"pith:D2ZMOSM5","canonical_record":{"source":{"id":"2506.04919","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-05T11:53:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f5d466f94cefe538438bd461df9f5fd240c46a223f9dac672b2c3deeb6ed266e","abstract_canon_sha256":"47a029662cddfe9eded3c159c19c5333d4ee28a372833e30adb6456dfdb19ae5"},"schema_version":"1.0"},"canonical_sha256":"1eb2c7499d0475bb43814e543a9bee2a900a8ff2ec3192ee5a309896c9a11b96","source":{"kind":"arxiv","id":"2506.04919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04919","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04919v1","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04919","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"D2ZMOSM5AR23","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"pith_short_16","alias_value":"D2ZMOSM5AR23WQ4B","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"pith_short_8","alias_value":"D2ZMOSM5","created_at":"2026-07-05T11:16:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:D2ZMOSM5AR23WQ4BJZKDVG7OFK","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04919","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-05T11:53:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f5d466f94cefe538438bd461df9f5fd240c46a223f9dac672b2c3deeb6ed266e","abstract_canon_sha256":"47a029662cddfe9eded3c159c19c5333d4ee28a372833e30adb6456dfdb19ae5"},"schema_version":"1.0"},"canonical_sha256":"1eb2c7499d0475bb43814e543a9bee2a900a8ff2ec3192ee5a309896c9a11b96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:39.106223Z","signature_b64":"7bGEAy5i2+9QPTSgwpGIOITkEvhMA/nDBmwI8j6hmQVh0w35yP4cRNLzUhubXGGHbTtrUWaOROUDsyprQySACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb2c7499d0475bb43814e543a9bee2a900a8ff2ec3192ee5a309896c9a11b96","last_reissued_at":"2026-07-05T11:16:39.105727Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:39.105727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04919","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-05T11:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2xQmYxg3qArntLtc9KH+um0xcXpOAjdPFKu15CSjk8yYBT+ucYtag5wy8RI/5lfC8POY+n7fOf9Cl28eJh8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:53:26.207290Z"},"content_sha256":"27f80d94e25e4831c01498c4f46d530c445be11db47bdf4623567c802c3b3476","schema_version":"1.0","event_id":"sha256:27f80d94e25e4831c01498c4f46d530c445be11db47bdf4623567c802c3b3476"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:D2ZMOSM5AR23WQ4BJZKDVG7OFK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Byzantine Agreement under an Adaptive Adversary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Fabien Dufoulon, Gopal Pandurangan","submitted_at":"2025-06-05T11:53:00Z","abstract_excerpt":"Byzantine agreement is a fundamental problem in fault-tolerant distributed computing that has been studied intensively for the last four decades. Much of the research has focused on a static Byzantine adversary, where the adversary is constrained to choose the Byzantine nodes in advance of the protocol's execution. This work focuses on the harder case of an adaptive Byzantine adversary that can choose the Byzantine nodes \\emph{adaptively} based on the protocol's execution. While efficient $O(\\log n)$-round protocols ($n$ is the total number of nodes) are known for the static adversary (Goldwas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04919","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/2506.04919/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-05T11:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWdHyr92fd0lh3rKTmFwRrz25OOil36yN+2gTOGODaR4FxlpAbW4Vs+3jkK68tNb+4MFxWE+mxpwqTqvF0yhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:53:26.207764Z"},"content_sha256":"3d30a0e7956e6ef9e67070c3015a3100b592b94bb454edd338f86720b10d9c74","schema_version":"1.0","event_id":"sha256:3d30a0e7956e6ef9e67070c3015a3100b592b94bb454edd338f86720b10d9c74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK/bundle.json","state_url":"https://pith.science/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK/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-08T01:53:26Z","links":{"resolver":"https://pith.science/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK","bundle":"https://pith.science/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK/bundle.json","state":"https://pith.science/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2ZMOSM5AR23WQ4BJZKDVG7OFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:D2ZMOSM5AR23WQ4BJZKDVG7OFK","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":"47a029662cddfe9eded3c159c19c5333d4ee28a372833e30adb6456dfdb19ae5","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-05T11:53:00Z","title_canon_sha256":"f5d466f94cefe538438bd461df9f5fd240c46a223f9dac672b2c3deeb6ed266e"},"schema_version":"1.0","source":{"id":"2506.04919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04919","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04919v1","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04919","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"D2ZMOSM5AR23","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"pith_short_16","alias_value":"D2ZMOSM5AR23WQ4B","created_at":"2026-07-05T11:16:39Z"},{"alias_kind":"pith_short_8","alias_value":"D2ZMOSM5","created_at":"2026-07-05T11:16:39Z"}],"graph_snapshots":[{"event_id":"sha256:3d30a0e7956e6ef9e67070c3015a3100b592b94bb454edd338f86720b10d9c74","target":"graph","created_at":"2026-07-05T11:16:39Z","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/2506.04919/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Byzantine agreement is a fundamental problem in fault-tolerant distributed computing that has been studied intensively for the last four decades. Much of the research has focused on a static Byzantine adversary, where the adversary is constrained to choose the Byzantine nodes in advance of the protocol's execution. This work focuses on the harder case of an adaptive Byzantine adversary that can choose the Byzantine nodes \\emph{adaptively} based on the protocol's execution. While efficient $O(\\log n)$-round protocols ($n$ is the total number of nodes) are known for the static adversary (Goldwas","authors_text":"Fabien Dufoulon, Gopal Pandurangan","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-05T11:53:00Z","title":"Improved Byzantine Agreement under an Adaptive Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04919","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:27f80d94e25e4831c01498c4f46d530c445be11db47bdf4623567c802c3b3476","target":"record","created_at":"2026-07-05T11:16:39Z","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":"47a029662cddfe9eded3c159c19c5333d4ee28a372833e30adb6456dfdb19ae5","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-05T11:53:00Z","title_canon_sha256":"f5d466f94cefe538438bd461df9f5fd240c46a223f9dac672b2c3deeb6ed266e"},"schema_version":"1.0","source":{"id":"2506.04919","kind":"arxiv","version":1}},"canonical_sha256":"1eb2c7499d0475bb43814e543a9bee2a900a8ff2ec3192ee5a309896c9a11b96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eb2c7499d0475bb43814e543a9bee2a900a8ff2ec3192ee5a309896c9a11b96","first_computed_at":"2026-07-05T11:16:39.105727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:39.105727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bGEAy5i2+9QPTSgwpGIOITkEvhMA/nDBmwI8j6hmQVh0w35yP4cRNLzUhubXGGHbTtrUWaOROUDsyprQySACw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:39.106223Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27f80d94e25e4831c01498c4f46d530c445be11db47bdf4623567c802c3b3476","sha256:3d30a0e7956e6ef9e67070c3015a3100b592b94bb454edd338f86720b10d9c74"],"state_sha256":"0c7b0d1f7b92f0845020e00290cbfd8cbbe40db384b6d22e872ceef9db0c3806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tKqG/cqjQ+QJdASWv7f4jYol6HLbtHwicjRKln7z4McSdh6L6dVxBGLW9vIgsznf3/Rxc63pnRTu1pq6Ln+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:53:26.212027Z","bundle_sha256":"459cb2bad8231a8a904d1f3de833acf1368a24501254d20028f4ef9503d1b45b"}}