{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UXCTTS6QFA6QOCIEWJIIPY3B2D","short_pith_number":"pith:UXCTTS6Q","schema_version":"1.0","canonical_sha256":"a5c539cbd0283d070904b25087e361d0d0275c27c3d11c1832b0400b455add68","source":{"kind":"arxiv","id":"2410.03358","version":3},"attestation_state":"computed","paper":{"title":"Oracle Separation Between Quantum Commitments and Quantum One-wayness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Barak Nehoran, Boyang Chen, John Bostanci","submitted_at":"2024-10-04T12:26:21Z","abstract_excerpt":"We show that there exists an oracle relative to which quantum commitments exist but no (efficiently verifiable) one-way state generators exist. Both have been widely considered candidates for replacing one-way functions as the minimal assumption for cryptography: the weakest cryptographic assumption implied by all of computational cryptography. Recent work has shown that commitments can be constructed from one-way state generators, but the other direction has remained open. Our results rule out any black-box construction, and thus settles this crucial open problem, suggesting that quantum comm"},"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":"2410.03358","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-04T12:26:21Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"2c69617dc012e24e57dcb0d9018633b96a81252a4b9082d213f8f7b5c87aa10b","abstract_canon_sha256":"4d2f4058308feecc4f5cf3e7fd1db1c0aa1b8815652741b0ee3a1dc77b01acc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:31.384700Z","signature_b64":"c4TLYXjPcLIs1GbI2XowtROv1w3fTJDKUgECH2HztCFoXe5zGTUM6H8p7rnhnWbZDqxMJaM3wYtbErlS/P7oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c539cbd0283d070904b25087e361d0d0275c27c3d11c1832b0400b455add68","last_reissued_at":"2026-07-05T10:47:31.384221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:31.384221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oracle Separation Between Quantum Commitments and Quantum One-wayness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Barak Nehoran, Boyang Chen, John Bostanci","submitted_at":"2024-10-04T12:26:21Z","abstract_excerpt":"We show that there exists an oracle relative to which quantum commitments exist but no (efficiently verifiable) one-way state generators exist. Both have been widely considered candidates for replacing one-way functions as the minimal assumption for cryptography: the weakest cryptographic assumption implied by all of computational cryptography. Recent work has shown that commitments can be constructed from one-way state generators, but the other direction has remained open. Our results rule out any black-box construction, and thus settles this crucial open problem, suggesting that quantum comm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03358","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/2410.03358/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":"2410.03358","created_at":"2026-07-05T10:47:31.384276+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03358v3","created_at":"2026-07-05T10:47:31.384276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03358","created_at":"2026-07-05T10:47:31.384276+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXCTTS6QFA6Q","created_at":"2026-07-05T10:47:31.384276+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXCTTS6QFA6QOCIE","created_at":"2026-07-05T10:47:31.384276+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXCTTS6Q","created_at":"2026-07-05T10:47:31.384276+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15343","citing_title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D","json":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D.json","graph_json":"https://pith.science/api/pith-number/UXCTTS6QFA6QOCIEWJIIPY3B2D/graph.json","events_json":"https://pith.science/api/pith-number/UXCTTS6QFA6QOCIEWJIIPY3B2D/events.json","paper":"https://pith.science/paper/UXCTTS6Q"},"agent_actions":{"view_html":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D","download_json":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D.json","view_paper":"https://pith.science/paper/UXCTTS6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03358&json=true","fetch_graph":"https://pith.science/api/pith-number/UXCTTS6QFA6QOCIEWJIIPY3B2D/graph.json","fetch_events":"https://pith.science/api/pith-number/UXCTTS6QFA6QOCIEWJIIPY3B2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D/action/storage_attestation","attest_author":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D/action/author_attestation","sign_citation":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D/action/citation_signature","submit_replication":"https://pith.science/pith/UXCTTS6QFA6QOCIEWJIIPY3B2D/action/replication_record"}},"created_at":"2026-07-05T10:47:31.384276+00:00","updated_at":"2026-07-05T10:47:31.384276+00:00"}