{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VIQ26PSE7LLJFZ7G2WETV4WIFM","short_pith_number":"pith:VIQ26PSE","schema_version":"1.0","canonical_sha256":"aa21af3e44fad692e7e6d5893af2c82b185c4db4833852f21ab7e2f7bea0d223","source":{"kind":"arxiv","id":"2605.19452","version":1},"attestation_state":"computed","paper":{"title":"Resilient Byzantine Agreement with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Darya Melnyk, Julien Dallot, Patrik Welters, Stefan Schmid, Tijana Milentijevic","submitted_at":"2026-05-19T07:06:50Z","abstract_excerpt":"This paper studies the Byzantine Agreement problem where the nodes have access to a predictor that flags nodes for suspicion of faulty (Byzantine) behavior. We focus on algorithmic resilience -- the maximum number of faulty nodes an algorithm can tolerate -- and present algorithms and impossibility results whose resilience depend on the accuracy of the predictor. As our first main result, we bring a complete characterization of the consistency--robustness trade-offs in both the non-authenticated and authenticated settings: for $n$ nodes and a parameter $\\alpha \\in [0, 1]$, we present algorithm"},"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":"2605.19452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-19T07:06:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9084f01f6c07231d8db62980569f1646e56e7a99136ea6d578abed4d77abd68a","abstract_canon_sha256":"ceef8ef76bd64cf8bcd111397b9b1d4b7a19b37389ba0a5bf270948dc340b421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:46.548751Z","signature_b64":"ZyRHBd3Ozom4w+TKU9LVIzj9dbaWR1ONVrpTljIeBBzjGHi62RtrnLg39w3sfuJ5kZBADCCVHGKEKGLOJqllBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa21af3e44fad692e7e6d5893af2c82b185c4db4833852f21ab7e2f7bea0d223","last_reissued_at":"2026-05-20T01:05:46.547966Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:46.547966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resilient Byzantine Agreement with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Darya Melnyk, Julien Dallot, Patrik Welters, Stefan Schmid, Tijana Milentijevic","submitted_at":"2026-05-19T07:06:50Z","abstract_excerpt":"This paper studies the Byzantine Agreement problem where the nodes have access to a predictor that flags nodes for suspicion of faulty (Byzantine) behavior. We focus on algorithmic resilience -- the maximum number of faulty nodes an algorithm can tolerate -- and present algorithms and impossibility results whose resilience depend on the accuracy of the predictor. As our first main result, we bring a complete characterization of the consistency--robustness trade-offs in both the non-authenticated and authenticated settings: for $n$ nodes and a parameter $\\alpha \\in [0, 1]$, we present algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19452","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/2605.19452/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":"2605.19452","created_at":"2026-05-20T01:05:46.548085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19452v1","created_at":"2026-05-20T01:05:46.548085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19452","created_at":"2026-05-20T01:05:46.548085+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIQ26PSE7LLJ","created_at":"2026-05-20T01:05:46.548085+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIQ26PSE7LLJFZ7G","created_at":"2026-05-20T01:05:46.548085+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIQ26PSE","created_at":"2026-05-20T01:05:46.548085+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/VIQ26PSE7LLJFZ7G2WETV4WIFM","json":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM.json","graph_json":"https://pith.science/api/pith-number/VIQ26PSE7LLJFZ7G2WETV4WIFM/graph.json","events_json":"https://pith.science/api/pith-number/VIQ26PSE7LLJFZ7G2WETV4WIFM/events.json","paper":"https://pith.science/paper/VIQ26PSE"},"agent_actions":{"view_html":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM","download_json":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM.json","view_paper":"https://pith.science/paper/VIQ26PSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19452&json=true","fetch_graph":"https://pith.science/api/pith-number/VIQ26PSE7LLJFZ7G2WETV4WIFM/graph.json","fetch_events":"https://pith.science/api/pith-number/VIQ26PSE7LLJFZ7G2WETV4WIFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM/action/storage_attestation","attest_author":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM/action/author_attestation","sign_citation":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM/action/citation_signature","submit_replication":"https://pith.science/pith/VIQ26PSE7LLJFZ7G2WETV4WIFM/action/replication_record"}},"created_at":"2026-05-20T01:05:46.548085+00:00","updated_at":"2026-05-20T01:05:46.548085+00:00"}