{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VKD4UPBVUOL3GNJVLWBJFB66ZM","short_pith_number":"pith:VKD4UPBV","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"},"canonical_sha256":"aa87ca3c35a397b335355d829287decb119328a306e639ecda665bb0e56b1477","source":{"kind":"arxiv","id":"2605.22426","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VKD4UPBVUOL3GNJVLWBJFB66ZM","target":"record","payload":{"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"},"canonical_sha256":"aa87ca3c35a397b335355d829287decb119328a306e639ecda665bb0e56b1477","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"},"source_kind":"arxiv","source_id":"2605.22426","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-05-22T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMKakMHfpVm1qDe2Fl2psXHNpgnDNtDVib65oYf7HB+77qNeQPO8kumkJhVFdQlo8lLlJgS7IINj9qXAmuemDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:56.738705Z"},"content_sha256":"d860388f230839f829d46eed34ccef71edab4b0b357594c349b7656332847ad0","schema_version":"1.0","event_id":"sha256:d860388f230839f829d46eed34ccef71edab4b0b357594c349b7656332847ad0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VKD4UPBVUOL3GNJVLWBJFB66ZM","target":"graph","payload":{"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"},"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-05-22T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efwaEc73klJ+ZThZ/fWwVQB6Y3d/6hSwyhiNybvSf8rLDuSl1R6VIcYTkRuQtn2ykj+LfSrKf+Af5O4KRV7+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:56.739460Z"},"content_sha256":"458f55a5feea2499aa00dd827ffe1eb90ce34d01c9404a2f7443e50510ceb8fe","schema_version":"1.0","event_id":"sha256:458f55a5feea2499aa00dd827ffe1eb90ce34d01c9404a2f7443e50510ceb8fe"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:VKD4UPBVUOL3GNJVLWBJFB66ZM","target":"integrity","payload":{"note":"Identifier '10.1137/0108018.doi:10.1137/0108018' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"I. S. Reed and G. Solomon. “Polynomial Codes Over Certain Finite Fields”. In:Journal of the Society for Industrial and Applied Mathematics8.2 (1960), pp. 300–304. eprint:https://doi. org/10.1137/0108018.doi:10.1137/0108018","arxiv_id":"2605.22426","detector":"doi_compliance","evidence":{"doi":"10.1137/0108018.doi:10.1137/0108018","arxiv_id":null,"ref_index":31,"raw_excerpt":"I. S. Reed and G. Solomon. “Polynomial Codes Over Certain Finite Fields”. In:Journal of the Society for Industrial and Applied Mathematics8.2 (1960), pp. 300–304. eprint:https://doi. org/10.1137/0108018.doi:10.1137/0108018","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":31,"audited_at":"2026-05-22T05:00:01.860349Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/0108018.doi:10.1137/0108018","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ac028dd66caee046f1d413d5ee2694947936f15556e55b961d5b4c5ba265725d","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":6188,"payload_sha256":"f495c8778f0f4c4f4fa824f2c4314a02258009614b14b867fa4fd2646b26a195","signature_b64":"o9YUWshQ+S3ETNIRVWgv0S5hvIPf7MCyvdS+tzfIAub7ZGuaGg4IJLJIIO/oWkI9zEf9UjUgmV+OjmBew0P6DQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T05:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfXZqM/bO1M38fkxHSqIUKMI0Es+jmNHSRLI0eEcN5qfhHrzwlI9X6e9sdUhC51PT73inzQ233EQm/ajddFiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:56.741136Z"},"content_sha256":"64bf23d128c1014ab6395a540515aaf60578fa1754d1abe0bec0ae95c32bf3eb","schema_version":"1.0","event_id":"sha256:64bf23d128c1014ab6395a540515aaf60578fa1754d1abe0bec0ae95c32bf3eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/bundle.json","state_url":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/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-05-27T19:22:56Z","links":{"resolver":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM","bundle":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/bundle.json","state":"https://pith.science/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKD4UPBVUOL3GNJVLWBJFB66ZM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCPahYwKeU4edixdQqoGWvlK2e/1G7SbC0jfm9H6tKB95Rm0YbUsEYdDIjvbWKLiEw5QNH/q4+al/mxaF5EqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:22:56.745304Z","bundle_sha256":"b7767a461da8abdc3089e94d4dfbc41ca604058a4574f50d3aff6dbde5a5a026"}}