{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NKZ2MKCZAHHD3QJHMDR3LPOBF7","short_pith_number":"pith:NKZ2MKCZ","schema_version":"1.0","canonical_sha256":"6ab3a6285901ce3dc12760e3b5bdc12fc1fc951660eb973a0f4d443cd44b59fe","source":{"kind":"arxiv","id":"2503.22651","version":1},"attestation_state":"computed","paper":{"title":"Optimal Locality and Parameter Tradeoffs for Subsystem Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Eugene Tang, Ray Li, Samuel Dai","submitted_at":"2025-03-28T17:38:54Z","abstract_excerpt":"We study the tradeoffs between the locality and parameters of subsystem codes. We prove lower bounds on both the number and lengths of interactions in any $D$-dimensional embedding of a subsystem code. Specifically, we show that any embedding of a subsystem code with parameters $[[n,k,d]]$ into $\\mathbb{R}^D$ must have at least $M^*$ interactions of length at least $\\ell^*$, where\n  \\[ M^* = \\Omega(\\max(k,d)), \\quad\\text{and}\\quad \\ell^* = \\Omega\\bigg(\\max\\bigg(\\frac{d}{n^\\frac{D-1}{D}}, \\bigg(\\frac{kd^\\frac{1}{D-1}}{n}\\bigg)^\\frac{D-1}{D}\\bigg)\\bigg). \\] We also give tradeoffs between the loc"},"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":"2503.22651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-28T17:38:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f6cb18c8095976a7cf391de5d15a4ab600c2480c3ab7bb7bda12c1a034058bd2","abstract_canon_sha256":"ec4bc3086467cd51afb1ed36ae23551ccfa24c9334053b2ecbecc0e18dc234f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:08.368081Z","signature_b64":"MaA29gdFEWkbkJfRH121yJQ3N8cCX1NW2i1+nHN1cR0x+UUTzMW04t+GZ/dshWP6JoxNSwt8KXH0HJP29WntAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ab3a6285901ce3dc12760e3b5bdc12fc1fc951660eb973a0f4d443cd44b59fe","last_reissued_at":"2026-07-05T10:41:08.367643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:08.367643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Locality and Parameter Tradeoffs for Subsystem Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Eugene Tang, Ray Li, Samuel Dai","submitted_at":"2025-03-28T17:38:54Z","abstract_excerpt":"We study the tradeoffs between the locality and parameters of subsystem codes. We prove lower bounds on both the number and lengths of interactions in any $D$-dimensional embedding of a subsystem code. Specifically, we show that any embedding of a subsystem code with parameters $[[n,k,d]]$ into $\\mathbb{R}^D$ must have at least $M^*$ interactions of length at least $\\ell^*$, where\n  \\[ M^* = \\Omega(\\max(k,d)), \\quad\\text{and}\\quad \\ell^* = \\Omega\\bigg(\\max\\bigg(\\frac{d}{n^\\frac{D-1}{D}}, \\bigg(\\frac{kd^\\frac{1}{D-1}}{n}\\bigg)^\\frac{D-1}{D}\\bigg)\\bigg). \\] We also give tradeoffs between the loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22651","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/2503.22651/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":"2503.22651","created_at":"2026-07-05T10:41:08.367699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.22651v1","created_at":"2026-07-05T10:41:08.367699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22651","created_at":"2026-07-05T10:41:08.367699+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKZ2MKCZAHHD","created_at":"2026-07-05T10:41:08.367699+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKZ2MKCZAHHD3QJH","created_at":"2026-07-05T10:41:08.367699+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKZ2MKCZ","created_at":"2026-07-05T10:41:08.367699+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/NKZ2MKCZAHHD3QJHMDR3LPOBF7","json":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7.json","graph_json":"https://pith.science/api/pith-number/NKZ2MKCZAHHD3QJHMDR3LPOBF7/graph.json","events_json":"https://pith.science/api/pith-number/NKZ2MKCZAHHD3QJHMDR3LPOBF7/events.json","paper":"https://pith.science/paper/NKZ2MKCZ"},"agent_actions":{"view_html":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7","download_json":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7.json","view_paper":"https://pith.science/paper/NKZ2MKCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.22651&json=true","fetch_graph":"https://pith.science/api/pith-number/NKZ2MKCZAHHD3QJHMDR3LPOBF7/graph.json","fetch_events":"https://pith.science/api/pith-number/NKZ2MKCZAHHD3QJHMDR3LPOBF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7/action/storage_attestation","attest_author":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7/action/author_attestation","sign_citation":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7/action/citation_signature","submit_replication":"https://pith.science/pith/NKZ2MKCZAHHD3QJHMDR3LPOBF7/action/replication_record"}},"created_at":"2026-07-05T10:41:08.367699+00:00","updated_at":"2026-07-05T10:41:08.367699+00:00"}