{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VKD4UPBVUOL3GNJVLWBJFB66ZM","short_pith_number":"pith:VKD4UPBV","schema_version":"1.0","canonical_sha256":"aa87ca3c35a397b335355d829287decb119328a306e639ecda665bb0e56b1477","source":{"kind":"arxiv","id":"2605.22426","version":1},"attestation_state":"computed","paper":{"title":"Monotone Erasure Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Annalisa Cimatti, Christian Cachin, Giuliano Losa, Orestis Alpos, Vivien Bammert","submitted_at":"2026-05-21T12:48:05Z","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"},"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.22426","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T12:48:05Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"7fc1b63d49e8e47336898e2b1d0d7da7181dcd92f097d5fb7d96f65ba5df3397","abstract_canon_sha256":"f1ce02f833767f024dab3d3eb0ba71cd63acb7da4022a6fc040a704a4713a3c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:42.622411Z","signature_b64":"c+aRSmGpsiHmA6H0xqbu/g/eMMPvZz/6JClRRb/6mOiPe0fWvGpmBqdZdsBOX0jW2VqPy+fa446M4Xgp9nyhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa87ca3c35a397b335355d829287decb119328a306e639ecda665bb0e56b1477","last_reissued_at":"2026-05-22T01:04:42.621750Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:42.621750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Erasure Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Annalisa Cimatti, Christian Cachin, Giuliano Losa, Orestis Alpos, Vivien Bammert","submitted_at":"2026-05-21T12:48:05Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22426","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.22426/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.22426","created_at":"2026-05-22T01:04:42.621847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22426v1","created_at":"2026-05-22T01:04:42.621847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22426","created_at":"2026-05-22T01:04:42.621847+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKD4UPBVUOL3","created_at":"2026-05-22T01:04:42.621847+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKD4UPBVUOL3GNJV","created_at":"2026-05-22T01:04:42.621847+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKD4UPBV","created_at":"2026-05-22T01:04:42.621847+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/VKD4UPBVUOL3GNJVLWBJFB66ZM","json":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM.json","graph_json":"https://pith.science/api/pith-number/VKD4UPBVUOL3GNJVLWBJFB66ZM/graph.json","events_json":"https://pith.science/api/pith-number/VKD4UPBVUOL3GNJVLWBJFB66ZM/events.json","paper":"https://pith.science/paper/VKD4UPBV"},"agent_actions":{"view_html":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM","download_json":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM.json","view_paper":"https://pith.science/paper/VKD4UPBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22426&json=true","fetch_graph":"https://pith.science/api/pith-number/VKD4UPBVUOL3GNJVLWBJFB66ZM/graph.json","fetch_events":"https://pith.science/api/pith-number/VKD4UPBVUOL3GNJVLWBJFB66ZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/action/storage_attestation","attest_author":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/action/author_attestation","sign_citation":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/action/citation_signature","submit_replication":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/action/replication_record"}},"created_at":"2026-05-22T01:04:42.621847+00:00","updated_at":"2026-05-22T01:04:42.621847+00:00"}