{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:6OK3XZSV6MUDYNAYUG6NIIWRQ7","short_pith_number":"pith:6OK3XZSV","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"},"canonical_sha256":"f395bbe655f3283c3418a1bcd422d187e399aa99d450dff4fb8f0d652b1e07d9","source":{"kind":"arxiv","id":"2206.09973","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.09973","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"2206.09973v3","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09973","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"6OK3XZSV6MUD","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"pith_short_16","alias_value":"6OK3XZSV6MUDYNAY","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"pith_short_8","alias_value":"6OK3XZSV","created_at":"2026-07-05T06:39:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:6OK3XZSV6MUDYNAYUG6NIIWRQ7","target":"record","payload":{"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"},"canonical_sha256":"f395bbe655f3283c3418a1bcd422d187e399aa99d450dff4fb8f0d652b1e07d9","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"},"source_kind":"arxiv","source_id":"2206.09973","source_version":3,"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-05T06:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1a93fAbSchZRp/w2KpWIW8nybwLeDXmMeAhBw1/wLRUQLLDHtlU+VkMHIHZYAW9hpZm/j2a7KR8lkb4AQffDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:00:06.007367Z"},"content_sha256":"8a7522939ec119d447ba091d273ef0796fda12858fff393ca165bda54ac77f81","schema_version":"1.0","event_id":"sha256:8a7522939ec119d447ba091d273ef0796fda12858fff393ca165bda54ac77f81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:6OK3XZSV6MUDYNAYUG6NIIWRQ7","target":"graph","payload":{"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"},"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-05T06:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKTGcOWmTUsbGvbgTe+BPPhEhKtK7oOE8Ex0FTpPnW+lR3yiikivolqYm8lLCtaaTFn4EIgXS3bGiSS6fM0WAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:00:06.008561Z"},"content_sha256":"b4688a6cc96d94b00573316e2aeb6e7e9fe079497700253e98465d9ec45d31ed","schema_version":"1.0","event_id":"sha256:b4688a6cc96d94b00573316e2aeb6e7e9fe079497700253e98465d9ec45d31ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/bundle.json","state_url":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/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-03T17:00:06Z","links":{"resolver":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7","bundle":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/bundle.json","state":"https://pith.science/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OK3XZSV6MUDYNAYUG6NIIWRQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6OK3XZSV6MUDYNAYUG6NIIWRQ7","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":"7f4d4f8e21e5470ace38e041db3342587ccf1e293a6f93868c4c5e8315ea250b","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T19:28:57Z","title_canon_sha256":"3722d5b3bfebf35a46ec5445fdc3bfe6eff092150e9aec8b49186f4a96437081"},"schema_version":"1.0","source":{"id":"2206.09973","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.09973","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"2206.09973v3","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09973","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"6OK3XZSV6MUD","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"pith_short_16","alias_value":"6OK3XZSV6MUDYNAY","created_at":"2026-07-05T06:39:49Z"},{"alias_kind":"pith_short_8","alias_value":"6OK3XZSV","created_at":"2026-07-05T06:39:49Z"}],"graph_snapshots":[{"event_id":"sha256:b4688a6cc96d94b00573316e2aeb6e7e9fe079497700253e98465d9ec45d31ed","target":"graph","created_at":"2026-07-05T06:39:49Z","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/2206.09973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gleb Kalachev, Pavel Panteleev","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T19:28:57Z","title":"Two-sided Robustly Testable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09973","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:8a7522939ec119d447ba091d273ef0796fda12858fff393ca165bda54ac77f81","target":"record","created_at":"2026-07-05T06:39:49Z","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":"7f4d4f8e21e5470ace38e041db3342587ccf1e293a6f93868c4c5e8315ea250b","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-06-20T19:28:57Z","title_canon_sha256":"3722d5b3bfebf35a46ec5445fdc3bfe6eff092150e9aec8b49186f4a96437081"},"schema_version":"1.0","source":{"id":"2206.09973","kind":"arxiv","version":3}},"canonical_sha256":"f395bbe655f3283c3418a1bcd422d187e399aa99d450dff4fb8f0d652b1e07d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f395bbe655f3283c3418a1bcd422d187e399aa99d450dff4fb8f0d652b1e07d9","first_computed_at":"2026-07-05T06:39:49.106186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:39:49.106186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U27ElWvY3W131AwtwneX2klSI5wSdLNBMaBP0S6OR4Ur7fIofsUoNRD4/GuHc7qhJm5l8XUFMrTWTt7hCDvhBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:39:49.106686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.09973","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a7522939ec119d447ba091d273ef0796fda12858fff393ca165bda54ac77f81","sha256:b4688a6cc96d94b00573316e2aeb6e7e9fe079497700253e98465d9ec45d31ed"],"state_sha256":"fb2d68509e7344bad45ce5fe0c11714e136d637251da4574f4db7f127845d12e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMNuiGu1KfbwU+q4qpkNRZFXoc9nEGqKpW6d5wATb5fTRpH5jN0/JCp0ESbKKsloQ4Zn4R2TsgBqMBABC+d0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:00:06.015331Z","bundle_sha256":"317304c5ab7bed355a7993300945c843ceabfdba8a6a11280d1a0fc89962e5f8"}}