{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WTY4OJS4OY6MTQU7DBWCM5PA7D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"de74a2b6664bd24beb0f93ecf73824832f77f1cf80cf103fb1b3d5ce4de186c3","cross_cats_sorted":["cs.CC","math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-03-06T12:20:49Z","title_canon_sha256":"cc6e2b40d0ff90bcc246e4fab4e1a7daa184736794466943e31c088c56516b12"},"schema_version":"1.0","source":{"id":"2403.03651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.03651","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"2403.03651v1","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03651","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"WTY4OJS4OY6M","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"pith_short_16","alias_value":"WTY4OJS4OY6MTQU7","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"pith_short_8","alias_value":"WTY4OJS4","created_at":"2026-07-05T07:52:51Z"}],"graph_snapshots":[{"event_id":"sha256:2eeb3648369e9bbc1696ec6ab2943d3aaf5636cf0ae1b507dcef633f2ba961b2","target":"graph","created_at":"2026-07-05T07:52:51Z","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/2403.03651/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes, Sipser-Spielman codes, and their more recent high-dimensional analogs, can be naturally represented as sheaf codes on simplicial and cubical complexes, considered as coded spaces. We introduce a new property of a sheaf code, called maximal extendibility, which ensures that within a class of codes on the same coded space, we encounter as few obstructions as possib","authors_text":"Gleb Kalachev, Pavel Panteleev","cross_cats":["cs.CC","math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-03-06T12:20:49Z","title":"Maximally Extendable Sheaf Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03651","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:d52c9c2483dca8befdcf7fee6bc54b48e850185ba68046bcab0401b46e57fdf0","target":"record","created_at":"2026-07-05T07:52:51Z","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":"de74a2b6664bd24beb0f93ecf73824832f77f1cf80cf103fb1b3d5ce4de186c3","cross_cats_sorted":["cs.CC","math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-03-06T12:20:49Z","title_canon_sha256":"cc6e2b40d0ff90bcc246e4fab4e1a7daa184736794466943e31c088c56516b12"},"schema_version":"1.0","source":{"id":"2403.03651","kind":"arxiv","version":1}},"canonical_sha256":"b4f1c7265c763cc9c29f186c2675e0f8fae200b0b925709dfa66a4ac9236be53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4f1c7265c763cc9c29f186c2675e0f8fae200b0b925709dfa66a4ac9236be53","first_computed_at":"2026-07-05T07:52:51.186487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:51.186487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LR7HEbeI3x1u81ymPt2oID56Pec1m/iRjEMZQvxeaBcZ/EuZV1nekOr/aWHOXM6HXa8ce9jZmwm9l9BjAstAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:51.186916Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.03651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d52c9c2483dca8befdcf7fee6bc54b48e850185ba68046bcab0401b46e57fdf0","sha256:2eeb3648369e9bbc1696ec6ab2943d3aaf5636cf0ae1b507dcef633f2ba961b2"],"state_sha256":"00bf2322f8ced5942c9aebad29a260e4e73c3038a4d4403c45bef5a7b2d876bc"}