{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VKD4UPBVUOL3GNJVLWBJFB66ZM","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f1ce02f833767f024dab3d3eb0ba71cd63acb7da4022a6fc040a704a4713a3c8","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T12:48:05Z","title_canon_sha256":"7fc1b63d49e8e47336898e2b1d0d7da7181dcd92f097d5fb7d96f65ba5df3397"},"schema_version":"1.0","source":{"id":"2605.22426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22426","created_at":"2026-05-22T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22426v1","created_at":"2026-05-22T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22426","created_at":"2026-05-22T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"VKD4UPBVUOL3","created_at":"2026-05-22T01:04:42Z"},{"alias_kind":"pith_short_16","alias_value":"VKD4UPBVUOL3GNJV","created_at":"2026-05-22T01:04:42Z"},{"alias_kind":"pith_short_8","alias_value":"VKD4UPBV","created_at":"2026-05-22T01:04:42Z"}],"graph_snapshots":[{"event_id":"sha256:458f55a5feea2499aa00dd827ffe1eb90ce34d01c9404a2f7443e50510ceb8fe","target":"graph","created_at":"2026-05-22T01:04:42Z","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/2605.22426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Erasure codes are a critical component in reliable storage systems today, and many blockchain systems use consensus protocols that involve erasure codes to reduce their communication cost. Existing erasure codes rely on a threshold failure assumption, but recent blockchain systems have departed from this simple model and use generalized failure assumptions.\n  This paper introduces monotone erasure codes that respect arbitrary trust assumptions on a set of nodes. The paper first describes a method for constructing a monotone erasure code from any access structure given by a monotone Boolean for","authors_text":"Annalisa Cimatti, Christian Cachin, Giuliano Losa, Orestis Alpos, Vivien Bammert","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T12:48:05Z","title":"Monotone Erasure Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22426","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:d860388f230839f829d46eed34ccef71edab4b0b357594c349b7656332847ad0","target":"record","created_at":"2026-05-22T01:04:42Z","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":"f1ce02f833767f024dab3d3eb0ba71cd63acb7da4022a6fc040a704a4713a3c8","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T12:48:05Z","title_canon_sha256":"7fc1b63d49e8e47336898e2b1d0d7da7181dcd92f097d5fb7d96f65ba5df3397"},"schema_version":"1.0","source":{"id":"2605.22426","kind":"arxiv","version":1}},"canonical_sha256":"aa87ca3c35a397b335355d829287decb119328a306e639ecda665bb0e56b1477","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa87ca3c35a397b335355d829287decb119328a306e639ecda665bb0e56b1477","first_computed_at":"2026-05-22T01:04:42.621750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:42.621750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c+aRSmGpsiHmA6H0xqbu/g/eMMPvZz/6JClRRb/6mOiPe0fWvGpmBqdZdsBOX0jW2VqPy+fa446M4Xgp9nyhAg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:42.622411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d860388f230839f829d46eed34ccef71edab4b0b357594c349b7656332847ad0","sha256:458f55a5feea2499aa00dd827ffe1eb90ce34d01c9404a2f7443e50510ceb8fe","sha256:64bf23d128c1014ab6395a540515aaf60578fa1754d1abe0bec0ae95c32bf3eb"],"state_sha256":"4f6264a1d475d7c609e7823f84b42f5704c1e896ea0384ac0eb8da28b76c9540"}