{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WTY4OJS4OY6MTQU7DBWCM5PA7D","short_pith_number":"pith:WTY4OJS4","canonical_record":{"source":{"id":"2403.03651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-03-06T12:20:49Z","cross_cats_sorted":["cs.CC","math.IT","quant-ph"],"title_canon_sha256":"cc6e2b40d0ff90bcc246e4fab4e1a7daa184736794466943e31c088c56516b12","abstract_canon_sha256":"de74a2b6664bd24beb0f93ecf73824832f77f1cf80cf103fb1b3d5ce4de186c3"},"schema_version":"1.0"},"canonical_sha256":"b4f1c7265c763cc9c29f186c2675e0f8fae200b0b925709dfa66a4ac9236be53","source":{"kind":"arxiv","id":"2403.03651","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WTY4OJS4OY6MTQU7DBWCM5PA7D","target":"record","payload":{"canonical_record":{"source":{"id":"2403.03651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-03-06T12:20:49Z","cross_cats_sorted":["cs.CC","math.IT","quant-ph"],"title_canon_sha256":"cc6e2b40d0ff90bcc246e4fab4e1a7daa184736794466943e31c088c56516b12","abstract_canon_sha256":"de74a2b6664bd24beb0f93ecf73824832f77f1cf80cf103fb1b3d5ce4de186c3"},"schema_version":"1.0"},"canonical_sha256":"b4f1c7265c763cc9c29f186c2675e0f8fae200b0b925709dfa66a4ac9236be53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:51.186916Z","signature_b64":"6LR7HEbeI3x1u81ymPt2oID56Pec1m/iRjEMZQvxeaBcZ/EuZV1nekOr/aWHOXM6HXa8ce9jZmwm9l9BjAstAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f1c7265c763cc9c29f186c2675e0f8fae200b0b925709dfa66a4ac9236be53","last_reissued_at":"2026-07-05T07:52:51.186487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:51.186487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.03651","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-07-05T07:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Fdrwg0ePY/Lgu4jcnxRxGZOfre+dH6JWqG8V2yy7LD/2dMoG8EWv5DQnAaTeh4sW0+ZT8RTloYNR6KUMb+6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:41:15.254877Z"},"content_sha256":"d52c9c2483dca8befdcf7fee6bc54b48e850185ba68046bcab0401b46e57fdf0","schema_version":"1.0","event_id":"sha256:d52c9c2483dca8befdcf7fee6bc54b48e850185ba68046bcab0401b46e57fdf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WTY4OJS4OY6MTQU7DBWCM5PA7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximally Extendable Sheaf Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2024-03-06T12:20:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03651","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/2403.03651/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-07-05T07:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIkw8Ks44hN8bQA+qgqlIw+zKUUgOykPnIZ5APl5QFk9kjo4hFqtSyRL5Rw4CKhDzIJfcz8ngJyNepGmdnKVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:41:15.255427Z"},"content_sha256":"2eeb3648369e9bbc1696ec6ab2943d3aaf5636cf0ae1b507dcef633f2ba961b2","schema_version":"1.0","event_id":"sha256:2eeb3648369e9bbc1696ec6ab2943d3aaf5636cf0ae1b507dcef633f2ba961b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D/bundle.json","state_url":"https://pith.science/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D/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-08-15T00:41:15Z","links":{"resolver":"https://pith.science/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D","bundle":"https://pith.science/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D/bundle.json","state":"https://pith.science/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTY4OJS4OY6MTQU7DBWCM5PA7D/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqfF4a0HQ1WwCvpUff9tKQpUEmJZukxzD2rjUwI/REZcNO3yST01qL8LByThXjHOy3Ix2l7RHAHmA6+K91XeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:41:15.263690Z","bundle_sha256":"548c9625b96100e9d2febb4678a0b01856f626dc50d4e5f1e2ace00ec3a24eb7"}}