{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5PTOI6ZQLREHOE7TIZRL6N3TV5","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":"2295279554d57af831e8d4ae853d80981fde664d0cc86a3178e37b9e60963ae1","cross_cats_sorted":["math.CO","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-22T13:37:23Z","title_canon_sha256":"82da26868af0c242a673c57f880e1cf1d2ad79b592951f5f0217cfe3ce13770c"},"schema_version":"1.0","source":{"id":"1512.07081","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07081","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07081v3","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07081","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"5PTOI6ZQLREH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5PTOI6ZQLREHOE7T","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5PTOI6ZQ","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:f8a000a984caf8a42b18f1fe35901e45e85895c238613c41f2a2d8dbdaf11c06","target":"graph","created_at":"2026-05-18T00:05:00Z","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"},"paper":{"abstract_excerpt":"CSS codes are in one-to-one correspondance with length 3 chain complexes. The latter are naturally endowed with a tensor product $\\otimes$ which induces a similar operation on the former. We investigate this operation, and in particular its behavior with regard to minimum distances. Given a CSS code $\\mathcal{C}$, we give a criterion which provides a lower bound on the minimum distance of $\\mathcal{C} \\otimes \\mathcal{D}$ for every CSS code $\\mathcal D$. We apply this result to study the behaviour of iterated tensor powers of codes. Such sequences of codes are logarithmically LDPC and we prove","authors_text":"Alain Couvreur, Benjamin Audoux","cross_cats":["math.CO","math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-22T13:37:23Z","title":"On tensor products of CSS Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07081","kind":"arxiv","version":3},"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:8559e2de41ebfa8db9d7acdd72ba3e719dc4936185a7d2e35a0174f6f9e6dc3f","target":"record","created_at":"2026-05-18T00:05:00Z","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":"2295279554d57af831e8d4ae853d80981fde664d0cc86a3178e37b9e60963ae1","cross_cats_sorted":["math.CO","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-22T13:37:23Z","title_canon_sha256":"82da26868af0c242a673c57f880e1cf1d2ad79b592951f5f0217cfe3ce13770c"},"schema_version":"1.0","source":{"id":"1512.07081","kind":"arxiv","version":3}},"canonical_sha256":"ebe6e47b305c487713f34662bf3773af4001a5814923dbad53666299d3b3cfa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebe6e47b305c487713f34662bf3773af4001a5814923dbad53666299d3b3cfa8","first_computed_at":"2026-05-18T00:05:00.865955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.865955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RUfQUuZaMuZkXPpvxnrbIb5lpxGyjDzzj/FYyFoIVgoKyvg1DeR/eybGcaGUdzOlZsZIkYwyVe/qGLxXhVVhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.866372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07081","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8559e2de41ebfa8db9d7acdd72ba3e719dc4936185a7d2e35a0174f6f9e6dc3f","sha256:f8a000a984caf8a42b18f1fe35901e45e85895c238613c41f2a2d8dbdaf11c06"],"state_sha256":"519653c9a683419fb0ee470d328c8d204404881d253acc7eeb05e5cead69b5d3"}