{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6OK3XZSV6MUDYNAYUG6NIIWRQ7","short_pith_number":"pith:6OK3XZSV","schema_version":"1.0","canonical_sha256":"f395bbe655f3283c3418a1bcd422d187e399aa99d450dff4fb8f0d652b1e07d9","source":{"kind":"arxiv","id":"2206.09973","version":3},"attestation_state":"computed","paper":{"title":"Two-sided Robustly Testable Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2022-06-20T19:28:57Z","abstract_excerpt":"We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously robustly testable. Such two-sided robustly testable codes (with a much weaker form of robustness) were the key ingredient in the recent constructions of asymptotically good quantum LDPC codes, which ensured their linear minimum distance. We hope that the existence of such codes with a stronger form of robustness, shown here, can be used to simplify the proofs a"},"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":"2206.09973","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T19:28:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3722d5b3bfebf35a46ec5445fdc3bfe6eff092150e9aec8b49186f4a96437081","abstract_canon_sha256":"7f4d4f8e21e5470ace38e041db3342587ccf1e293a6f93868c4c5e8315ea250b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:49.106686Z","signature_b64":"U27ElWvY3W131AwtwneX2klSI5wSdLNBMaBP0S6OR4Ur7fIofsUoNRD4/GuHc7qhJm5l8XUFMrTWTt7hCDvhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f395bbe655f3283c3418a1bcd422d187e399aa99d450dff4fb8f0d652b1e07d9","last_reissued_at":"2026-07-05T06:39:49.106186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:49.106186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-sided Robustly Testable Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2022-06-20T19:28:57Z","abstract_excerpt":"We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously robustly testable. Such two-sided robustly testable codes (with a much weaker form of robustness) were the key ingredient in the recent constructions of asymptotically good quantum LDPC codes, which ensured their linear minimum distance. We hope that the existence of such codes with a stronger form of robustness, shown here, can be used to simplify the proofs a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09973","kind":"arxiv","version":3},"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/2206.09973/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":"2206.09973","created_at":"2026-07-05T06:39:49.106250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.09973v3","created_at":"2026-07-05T06:39:49.106250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09973","created_at":"2026-07-05T06:39:49.106250+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OK3XZSV6MUD","created_at":"2026-07-05T06:39:49.106250+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OK3XZSV6MUDYNAY","created_at":"2026-07-05T06:39:49.106250+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OK3XZSV","created_at":"2026-07-05T06:39:49.106250+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/6OK3XZSV6MUDYNAYUG6NIIWRQ7","json":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7.json","graph_json":"https://pith.science/api/pith-number/6OK3XZSV6MUDYNAYUG6NIIWRQ7/graph.json","events_json":"https://pith.science/api/pith-number/6OK3XZSV6MUDYNAYUG6NIIWRQ7/events.json","paper":"https://pith.science/paper/6OK3XZSV"},"agent_actions":{"view_html":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7","download_json":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7.json","view_paper":"https://pith.science/paper/6OK3XZSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.09973&json=true","fetch_graph":"https://pith.science/api/pith-number/6OK3XZSV6MUDYNAYUG6NIIWRQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/6OK3XZSV6MUDYNAYUG6NIIWRQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/action/storage_attestation","attest_author":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/action/author_attestation","sign_citation":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/action/citation_signature","submit_replication":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/action/replication_record"}},"created_at":"2026-07-05T06:39:49.106250+00:00","updated_at":"2026-07-05T06:39:49.106250+00:00"}