{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NIL2ZJ5BEN6FSE3J5SR3RTYMNG","short_pith_number":"pith:NIL2ZJ5B","schema_version":"1.0","canonical_sha256":"6a17aca7a1237c591369eca3b8cf0c699b2c60210bcc73c4e55ab3d6ab54a648","source":{"kind":"arxiv","id":"2505.01793","version":1},"attestation_state":"computed","paper":{"title":"Byzantine Agreement with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Faith Ellen, Muhammad Ayaz Dzulfikar, Naama Ben-David, Seth Gilbert","submitted_at":"2025-05-03T11:41:55Z","abstract_excerpt":"In this paper, we study the problem of \\emph{Byzantine Agreement with predictions}. Along with a proposal, each process is also given a prediction, i.e., extra information which is not guaranteed to be true. For example, one might imagine that the prediction is produced by a network security monitoring service that looks for patterns of malicious behavior.\n  Our goal is to design an algorithm that is more efficient when the predictions are accurate, degrades in performance as predictions decrease in accuracy, and still in the worst case performs as well as any algorithm without predictions eve"},"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":"2505.01793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-03T11:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"0d4c344b3b601713bf65aa360f70705fe418bd8c24a113b32ea6e088dffcbdf2","abstract_canon_sha256":"e296270c9420fe9cdf7630c7e2d8153640d80840e8490f001630548f20726edc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:04.235145Z","signature_b64":"RP8J5wwtjfT9jvfVDTbanR6LWpjTncsIgXftySA2IGJb0Ro28Ge20afnMikO4cqR68BMEhIMaUwoE+N9OQmFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a17aca7a1237c591369eca3b8cf0c699b2c60210bcc73c4e55ab3d6ab54a648","last_reissued_at":"2026-07-05T10:58:04.234737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:04.234737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Agreement with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Faith Ellen, Muhammad Ayaz Dzulfikar, Naama Ben-David, Seth Gilbert","submitted_at":"2025-05-03T11:41:55Z","abstract_excerpt":"In this paper, we study the problem of \\emph{Byzantine Agreement with predictions}. Along with a proposal, each process is also given a prediction, i.e., extra information which is not guaranteed to be true. For example, one might imagine that the prediction is produced by a network security monitoring service that looks for patterns of malicious behavior.\n  Our goal is to design an algorithm that is more efficient when the predictions are accurate, degrades in performance as predictions decrease in accuracy, and still in the worst case performs as well as any algorithm without predictions eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01793","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/2505.01793/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":"2505.01793","created_at":"2026-07-05T10:58:04.234785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01793v1","created_at":"2026-07-05T10:58:04.234785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01793","created_at":"2026-07-05T10:58:04.234785+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIL2ZJ5BEN6F","created_at":"2026-07-05T10:58:04.234785+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIL2ZJ5BEN6FSE3J","created_at":"2026-07-05T10:58:04.234785+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIL2ZJ5B","created_at":"2026-07-05T10:58:04.234785+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/NIL2ZJ5BEN6FSE3J5SR3RTYMNG","json":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG.json","graph_json":"https://pith.science/api/pith-number/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/graph.json","events_json":"https://pith.science/api/pith-number/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/events.json","paper":"https://pith.science/paper/NIL2ZJ5B"},"agent_actions":{"view_html":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG","download_json":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG.json","view_paper":"https://pith.science/paper/NIL2ZJ5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01793&json=true","fetch_graph":"https://pith.science/api/pith-number/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/graph.json","fetch_events":"https://pith.science/api/pith-number/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/action/storage_attestation","attest_author":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/action/author_attestation","sign_citation":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/action/citation_signature","submit_replication":"https://pith.science/pith/NIL2ZJ5BEN6FSE3J5SR3RTYMNG/action/replication_record"}},"created_at":"2026-07-05T10:58:04.234785+00:00","updated_at":"2026-07-05T10:58:04.234785+00:00"}