{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IRDEKL4FAWL2NY2BA4WOC343ZD","short_pith_number":"pith:IRDEKL4F","schema_version":"1.0","canonical_sha256":"4446452f850597a6e341072ce16f9bc8de5f102044e77762e134d62ed9087b56","source":{"kind":"arxiv","id":"2508.10664","version":1},"attestation_state":"computed","paper":{"title":"Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OA"],"primary_cat":"quant-ph","authors_text":"Andrej Vukovic, Arthur Mehta, Kiera Hutton","submitted_at":"2025-08-14T14:03:38Z","abstract_excerpt":"We prove that deciding whether a classical-quantum (C-Q) channel can exactly preserve a single classical bit is QCMA-complete. This \"bit-preservation\" problem is a special case of orthogonality-constrained optimization tasks over C-Q channels, in which one seeks orthogonal input states whose outputs have small or large Hilbert-Schmidt overlap after passing through the channel. Both problems can be cast as biquadratic optimization with orthogonality constraints. Our main technical contribution uses tools from matrix analysis to give a complete characterization of the optimal witnesses: computat"},"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":"2508.10664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-14T14:03:38Z","cross_cats_sorted":["cs.CC","math.OA"],"title_canon_sha256":"48f7cf9b601ddf521ccba1e86b836f56a092cd4ed403d336c59675784de83b01","abstract_canon_sha256":"df2a469d9df8bc8aa826933ccc982da125dbaa7ba745ce506cb5ebf69689f00d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:00.487887Z","signature_b64":"3rZjWg7Vf8Ja6q1W1kKBnJ18hdf2uoOMefOhvWz8fVyOilEU8keiJ3bYfnIijIkPf++ZdS9WnQkel1gT8LGoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4446452f850597a6e341072ce16f9bc8de5f102044e77762e134d62ed9087b56","last_reissued_at":"2026-07-05T11:54:00.487387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:00.487387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OA"],"primary_cat":"quant-ph","authors_text":"Andrej Vukovic, Arthur Mehta, Kiera Hutton","submitted_at":"2025-08-14T14:03:38Z","abstract_excerpt":"We prove that deciding whether a classical-quantum (C-Q) channel can exactly preserve a single classical bit is QCMA-complete. This \"bit-preservation\" problem is a special case of orthogonality-constrained optimization tasks over C-Q channels, in which one seeks orthogonal input states whose outputs have small or large Hilbert-Schmidt overlap after passing through the channel. Both problems can be cast as biquadratic optimization with orthogonality constraints. Our main technical contribution uses tools from matrix analysis to give a complete characterization of the optimal witnesses: computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10664","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/2508.10664/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":"2508.10664","created_at":"2026-07-05T11:54:00.487452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.10664v1","created_at":"2026-07-05T11:54:00.487452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10664","created_at":"2026-07-05T11:54:00.487452+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRDEKL4FAWL2","created_at":"2026-07-05T11:54:00.487452+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRDEKL4FAWL2NY2B","created_at":"2026-07-05T11:54:00.487452+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRDEKL4F","created_at":"2026-07-05T11:54:00.487452+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/IRDEKL4FAWL2NY2BA4WOC343ZD","json":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD.json","graph_json":"https://pith.science/api/pith-number/IRDEKL4FAWL2NY2BA4WOC343ZD/graph.json","events_json":"https://pith.science/api/pith-number/IRDEKL4FAWL2NY2BA4WOC343ZD/events.json","paper":"https://pith.science/paper/IRDEKL4F"},"agent_actions":{"view_html":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD","download_json":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD.json","view_paper":"https://pith.science/paper/IRDEKL4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.10664&json=true","fetch_graph":"https://pith.science/api/pith-number/IRDEKL4FAWL2NY2BA4WOC343ZD/graph.json","fetch_events":"https://pith.science/api/pith-number/IRDEKL4FAWL2NY2BA4WOC343ZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD/action/storage_attestation","attest_author":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD/action/author_attestation","sign_citation":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD/action/citation_signature","submit_replication":"https://pith.science/pith/IRDEKL4FAWL2NY2BA4WOC343ZD/action/replication_record"}},"created_at":"2026-07-05T11:54:00.487452+00:00","updated_at":"2026-07-05T11:54:00.487452+00:00"}