{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EN6TKYXZWNNTREUZA2OFF3VT27","short_pith_number":"pith:EN6TKYXZ","schema_version":"1.0","canonical_sha256":"237d3562f9b35b389299069c52eeb3d7e4425bab338b787278a34d03052c561d","source":{"kind":"arxiv","id":"2311.04681","version":1},"attestation_state":"computed","paper":{"title":"Efficiently stable presentations from error-correcting codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"quant-ph","authors_text":"Henry Yuen, Michael Chapman, Thomas Vidick","submitted_at":"2023-11-08T13:40:13Z","abstract_excerpt":"We introduce a notion of \\emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \\emph{stable} if any map from $S$ to unitaries that approximately satisfies the relations (in the tracial norm) is close to the restriction of a representation of $G$ to the subset $S$. This notion and variants thereof have been extensively studied in recent years, in part motivated by connections to property testing in computer science. The novelty in our work is the focus on \\emph{efficiency}, which, informally, places an onus on "},"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":"2311.04681","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-08T13:40:13Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"2976898640a5c7c507e737e7a7bfbfc24a400f987166c2f3db4ae33383660d69","abstract_canon_sha256":"860ea6fd016533ec0114d1e6cc9a5504bc3ec7dd0760f27e76805e810976dc25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:39.879399Z","signature_b64":"WWcZ0HF31nNZ8hj17Tlagos2FyXblyCxTqLcdktOjvJeqifI9LIeIBarjw0AIt8nNevZR/xCr7EyqPcaAFgtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"237d3562f9b35b389299069c52eeb3d7e4425bab338b787278a34d03052c561d","last_reissued_at":"2026-07-05T07:10:39.878928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:39.878928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently stable presentations from error-correcting codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"quant-ph","authors_text":"Henry Yuen, Michael Chapman, Thomas Vidick","submitted_at":"2023-11-08T13:40:13Z","abstract_excerpt":"We introduce a notion of \\emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \\emph{stable} if any map from $S$ to unitaries that approximately satisfies the relations (in the tracial norm) is close to the restriction of a representation of $G$ to the subset $S$. This notion and variants thereof have been extensively studied in recent years, in part motivated by connections to property testing in computer science. The novelty in our work is the focus on \\emph{efficiency}, which, informally, places an onus on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04681","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/2311.04681/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":"2311.04681","created_at":"2026-07-05T07:10:39.878987+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.04681v1","created_at":"2026-07-05T07:10:39.878987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04681","created_at":"2026-07-05T07:10:39.878987+00:00"},{"alias_kind":"pith_short_12","alias_value":"EN6TKYXZWNNT","created_at":"2026-07-05T07:10:39.878987+00:00"},{"alias_kind":"pith_short_16","alias_value":"EN6TKYXZWNNTREUZ","created_at":"2026-07-05T07:10:39.878987+00:00"},{"alias_kind":"pith_short_8","alias_value":"EN6TKYXZ","created_at":"2026-07-05T07:10:39.878987+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.09588","citing_title":"Probabilistically Checking Quantum Proofs, with Interaction","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02242","citing_title":"Characters of surface groups","ref_index":200,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27","json":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27.json","graph_json":"https://pith.science/api/pith-number/EN6TKYXZWNNTREUZA2OFF3VT27/graph.json","events_json":"https://pith.science/api/pith-number/EN6TKYXZWNNTREUZA2OFF3VT27/events.json","paper":"https://pith.science/paper/EN6TKYXZ"},"agent_actions":{"view_html":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27","download_json":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27.json","view_paper":"https://pith.science/paper/EN6TKYXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.04681&json=true","fetch_graph":"https://pith.science/api/pith-number/EN6TKYXZWNNTREUZA2OFF3VT27/graph.json","fetch_events":"https://pith.science/api/pith-number/EN6TKYXZWNNTREUZA2OFF3VT27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27/action/storage_attestation","attest_author":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27/action/author_attestation","sign_citation":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27/action/citation_signature","submit_replication":"https://pith.science/pith/EN6TKYXZWNNTREUZA2OFF3VT27/action/replication_record"}},"created_at":"2026-07-05T07:10:39.878987+00:00","updated_at":"2026-07-05T07:10:39.878987+00:00"}