{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:SJMTJNXMYDSUMFS2DIM4ZED5NB","short_pith_number":"pith:SJMTJNXM","canonical_record":{"source":{"id":"2203.04262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-08T18:33:43Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7a5e2e0d771f1a612a2a3e54f5d5c425403f4b4132e695adc4bade74f7328ec0","abstract_canon_sha256":"896cf410676cb3155c5e0a05af64c2580ccfb710da052740af2b2321dec50a4a"},"schema_version":"1.0"},"canonical_sha256":"925934b6ecc0e546165a1a19cc907d6876c35853d6e304e03898cd8e23126300","source":{"kind":"arxiv","id":"2203.04262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04262","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04262v2","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04262","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"SJMTJNXMYDSU","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"SJMTJNXMYDSUMFS2","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"SJMTJNXM","created_at":"2026-07-05T07:09:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:SJMTJNXMYDSUMFS2DIM4ZED5NB","target":"record","payload":{"canonical_record":{"source":{"id":"2203.04262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-08T18:33:43Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7a5e2e0d771f1a612a2a3e54f5d5c425403f4b4132e695adc4bade74f7328ec0","abstract_canon_sha256":"896cf410676cb3155c5e0a05af64c2580ccfb710da052740af2b2321dec50a4a"},"schema_version":"1.0"},"canonical_sha256":"925934b6ecc0e546165a1a19cc907d6876c35853d6e304e03898cd8e23126300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:25.635532Z","signature_b64":"Q6K5zDOvy4v0FDZ6Zm9TwX4beQgXoMRNt0x/G040eceHvKB6zUWu7M0Wuan/ObS0v3gLwqrWOG5cJiBd5tS0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"925934b6ecc0e546165a1a19cc907d6876c35853d6e304e03898cd8e23126300","last_reissued_at":"2026-07-05T07:09:25.634987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:25.634987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.04262","source_version":2,"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-05T07:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G272XaDn2hdCZxL0z6UyoW/VI3QArLpnJS6Sp6dfb8bOPlXiKjggp4UV1kGgulcP0pBPARpcFFmZ1A/p8jYYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:30:44.788326Z"},"content_sha256":"3e4cba134223224743f7a531068a8218262c0e86f553ae8f4eef9869bef6e937","schema_version":"1.0","event_id":"sha256:3e4cba134223224743f7a531068a8218262c0e86f553ae8f4eef9869bef6e937"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:SJMTJNXMYDSUMFS2DIM4ZED5NB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of the Minimum Distance Problem of Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"quant-ph","authors_text":"Srijita Kundu, Upendra Kapshikar","submitted_at":"2022-03-08T18:33:43Z","abstract_excerpt":"We study the hardness of the problem of finding the distance of quantum error-correcting codes. The analogous problem for classical codes is known to be NP-hard, even in approximate form. For quantum codes, various problems related to decoding are known to be NP-hard, but the hardness of the distance problem has not been studied before. In this work, we show that finding the minimum distance of stabilizer quantum codes exactly or approximately is NP-hard. This result is obtained by reducing the classical minimum distance problem to the quantum problem, using the CWS framework for quantum codes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04262","kind":"arxiv","version":2},"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/2203.04262/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-05T07:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3bLmlPD8u0rkxb2EJiHtCcO8rofGCNIF2K9jRFQYHAEXQyOc+2KpGJft5phFXUvep0VzUrzJOUMv10Emsq0pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:30:44.789349Z"},"content_sha256":"0c65b93be9c70e1aa313c690d95b78b7dc7c44ffa9636eae21cc895e040f7c13","schema_version":"1.0","event_id":"sha256:0c65b93be9c70e1aa313c690d95b78b7dc7c44ffa9636eae21cc895e040f7c13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB/bundle.json","state_url":"https://pith.science/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB/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-13T20:30:44Z","links":{"resolver":"https://pith.science/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB","bundle":"https://pith.science/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB/bundle.json","state":"https://pith.science/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJMTJNXMYDSUMFS2DIM4ZED5NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SJMTJNXMYDSUMFS2DIM4ZED5NB","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":"896cf410676cb3155c5e0a05af64c2580ccfb710da052740af2b2321dec50a4a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-08T18:33:43Z","title_canon_sha256":"7a5e2e0d771f1a612a2a3e54f5d5c425403f4b4132e695adc4bade74f7328ec0"},"schema_version":"1.0","source":{"id":"2203.04262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04262","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04262v2","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04262","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"SJMTJNXMYDSU","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"SJMTJNXMYDSUMFS2","created_at":"2026-07-05T07:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"SJMTJNXM","created_at":"2026-07-05T07:09:25Z"}],"graph_snapshots":[{"event_id":"sha256:0c65b93be9c70e1aa313c690d95b78b7dc7c44ffa9636eae21cc895e040f7c13","target":"graph","created_at":"2026-07-05T07:09:25Z","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/2203.04262/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the hardness of the problem of finding the distance of quantum error-correcting codes. The analogous problem for classical codes is known to be NP-hard, even in approximate form. For quantum codes, various problems related to decoding are known to be NP-hard, but the hardness of the distance problem has not been studied before. In this work, we show that finding the minimum distance of stabilizer quantum codes exactly or approximately is NP-hard. This result is obtained by reducing the classical minimum distance problem to the quantum problem, using the CWS framework for quantum codes","authors_text":"Srijita Kundu, Upendra Kapshikar","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-08T18:33:43Z","title":"On the Hardness of the Minimum Distance Problem of Quantum Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04262","kind":"arxiv","version":2},"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:3e4cba134223224743f7a531068a8218262c0e86f553ae8f4eef9869bef6e937","target":"record","created_at":"2026-07-05T07:09:25Z","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":"896cf410676cb3155c5e0a05af64c2580ccfb710da052740af2b2321dec50a4a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-08T18:33:43Z","title_canon_sha256":"7a5e2e0d771f1a612a2a3e54f5d5c425403f4b4132e695adc4bade74f7328ec0"},"schema_version":"1.0","source":{"id":"2203.04262","kind":"arxiv","version":2}},"canonical_sha256":"925934b6ecc0e546165a1a19cc907d6876c35853d6e304e03898cd8e23126300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"925934b6ecc0e546165a1a19cc907d6876c35853d6e304e03898cd8e23126300","first_computed_at":"2026-07-05T07:09:25.634987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:09:25.634987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q6K5zDOvy4v0FDZ6Zm9TwX4beQgXoMRNt0x/G040eceHvKB6zUWu7M0Wuan/ObS0v3gLwqrWOG5cJiBd5tS0Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:09:25.635532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.04262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e4cba134223224743f7a531068a8218262c0e86f553ae8f4eef9869bef6e937","sha256:0c65b93be9c70e1aa313c690d95b78b7dc7c44ffa9636eae21cc895e040f7c13"],"state_sha256":"4dbbe2d9a12f82fe583d90ed1032473dc6eb1104c5c20fc2011c2f4383773577"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N310Mq8cnbKN6LB4mHP/M55CuosNDgdMZuwmydLr64vGLw7KRlRruUjIugpADFXvKyQOFOxchZLoKa0S+IpCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:30:44.823294Z","bundle_sha256":"a3e4f5412442c0b8cec0a58a8bd3034a3ca87e09c8289a4f8f14025a44bccd61"}}