{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:M6DUERIPDXU7QJ3OYUS2CDCP3R","short_pith_number":"pith:M6DUERIP","canonical_record":{"source":{"id":"2411.14434","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-02T11:00:58Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"4d925a70573100a1b40dff4590f5180b5eb2bbb1a2893fff55d2432bc066b923","abstract_canon_sha256":"e712baa816396313870fa287e216d63f43b4a4d8c857bc7c65f749d213e21cb5"},"schema_version":"1.0"},"canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","source":{"kind":"arxiv","id":"2411.14434","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14434","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14434v3","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14434","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"M6DUERIPDXU7","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"pith_short_16","alias_value":"M6DUERIPDXU7QJ3O","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"pith_short_8","alias_value":"M6DUERIP","created_at":"2026-08-05T01:36:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:M6DUERIPDXU7QJ3OYUS2CDCP3R","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14434","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-02T11:00:58Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"4d925a70573100a1b40dff4590f5180b5eb2bbb1a2893fff55d2432bc066b923","abstract_canon_sha256":"e712baa816396313870fa287e216d63f43b4a4d8c857bc7c65f749d213e21cb5"},"schema_version":"1.0"},"canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:36:12.128602Z","signature_b64":"oJnBesIShW3gLVwh1rqiwwoGcuzZYLqZp3IeAPTxFQpGNVoVy6ozlXFwBBINLx9vLjJomWbHUeapIjcwZYOGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","last_reissued_at":"2026-08-05T01:36:12.127069Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:36:12.127069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14434","source_version":3,"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-08-05T01:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eToM6fPftYsD+ttrgCu7h6I1oVRy15gvSFVTLqwcV8glsPlCjS4yzS/++kx64P0mIkKTooAr+f+mM8UkmF9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:08:08.035176Z"},"content_sha256":"62182b20a1d0a3a2c07a19b0261c8afd70742ab82e4145a4b108b2e49f09aba2","schema_version":"1.0","event_id":"sha256:62182b20a1d0a3a2c07a19b0261c8afd70742ab82e4145a4b108b2e49f09aba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:M6DUERIPDXU7QJ3OYUS2CDCP3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum CORDIC -- Arcsine on a Budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Iain Burge, Joaquin Garcia-Alfaro, Michel Barbeau","submitted_at":"2024-11-02T11:00:58Z","abstract_excerpt":"This work introduces a quantum algorithm for computing the function arcsine, with arbitrary accuracy. We leverage a technique from embedded computing and field-programmable gate arrays, called COordinate Rotation DIgital Computer (CORDIC). CORDIC is a family of iterative algorithms that, in a classical context, can approximate various trigonometric, hyperbolic, and elementary functions using only bit shifts and additions. Adapting CORDIC to the quantum context is non-trivial, as the algorithm traditionally uses several non-reversible operations. We detail a method for CORDIC that avoids such n"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The non-reversible operations traditionally present in classical CORDIC can be replaced by fully reversible quantum equivalents while preserving the stated asymptotic resource counts (abstract, paragraph on adapting CORDIC to quantum context).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A reversible quantum CORDIC algorithm computes arcsine using O(n) qubits, O(n log n) layers, and O(n²) CNOT gates for n-bit precision.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ca1994f79167cc5600a291d413d979db457ae4a2aa41a0311a41be9543a53a81"},"source":{"id":"2411.14434","kind":"arxiv","version":3},"verdict":{"id":"35b7bbc6-de90-4fb4-b3a9-b68a273a52e2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T17:57:50.057195Z","strongest_claim":"For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared.","one_line_summary":"A reversible quantum CORDIC algorithm computes arcsine using O(n) qubits, O(n log n) layers, and O(n²) CNOT gates for n-bit precision.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The non-reversible operations traditionally present in classical CORDIC can be replaced by fully reversible quantum equivalents while preserving the stated asymptotic resource counts (abstract, paragraph on adapting CORDIC to quantum context).","pith_extraction_headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14434/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":2,"snapshot_sha256":"39233bf33d6983b4ca96c3dd27bc4277454dd6b7f9292f427ff0dedb0e5b568e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"35b7bbc6-de90-4fb4-b3a9-b68a273a52e2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T01:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAGPjxuo2IfRbsjJRDIqO7tSspYc5LoeFJ49O1fwURi/ikP3wPukS9fiNGZHuNs+BsPSmomQIbHjs3hxHjobBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:08:08.036004Z"},"content_sha256":"1158224a5a16fbf256d01a8c6c3e98505af80cc0575aaca3162b4d273a6494ac","schema_version":"1.0","event_id":"sha256:1158224a5a16fbf256d01a8c6c3e98505af80cc0575aaca3162b4d273a6494ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/bundle.json","state_url":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/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-18T05:08:08Z","links":{"resolver":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R","bundle":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/bundle.json","state":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:M6DUERIPDXU7QJ3OYUS2CDCP3R","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":"e712baa816396313870fa287e216d63f43b4a4d8c857bc7c65f749d213e21cb5","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-02T11:00:58Z","title_canon_sha256":"4d925a70573100a1b40dff4590f5180b5eb2bbb1a2893fff55d2432bc066b923"},"schema_version":"1.0","source":{"id":"2411.14434","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14434","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14434v3","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14434","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"M6DUERIPDXU7","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"pith_short_16","alias_value":"M6DUERIPDXU7QJ3O","created_at":"2026-08-05T01:36:12Z"},{"alias_kind":"pith_short_8","alias_value":"M6DUERIP","created_at":"2026-08-05T01:36:12Z"}],"graph_snapshots":[{"event_id":"sha256:1158224a5a16fbf256d01a8c6c3e98505af80cc0575aaca3162b4d273a6494ac","target":"graph","created_at":"2026-08-05T01:36:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The non-reversible operations traditionally present in classical CORDIC can be replaced by fully reversible quantum equivalents while preserving the stated asymptotic resource counts (abstract, paragraph on adapting CORDIC to quantum context)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A reversible quantum CORDIC algorithm computes arcsine using O(n) qubits, O(n log n) layers, and O(n²) CNOT gates for n-bit precision."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision."}],"snapshot_sha256":"ca1994f79167cc5600a291d413d979db457ae4a2aa41a0311a41be9543a53a81"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"39233bf33d6983b4ca96c3dd27bc4277454dd6b7f9292f427ff0dedb0e5b568e"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.14434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work introduces a quantum algorithm for computing the function arcsine, with arbitrary accuracy. We leverage a technique from embedded computing and field-programmable gate arrays, called COordinate Rotation DIgital Computer (CORDIC). CORDIC is a family of iterative algorithms that, in a classical context, can approximate various trigonometric, hyperbolic, and elementary functions using only bit shifts and additions. Adapting CORDIC to the quantum context is non-trivial, as the algorithm traditionally uses several non-reversible operations. We detail a method for CORDIC that avoids such n","authors_text":"Iain Burge, Joaquin Garcia-Alfaro, Michel Barbeau","cross_cats":["cs.CR"],"headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-02T11:00:58Z","title":"Quantum CORDIC -- Arcsine on a Budget"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14434","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-23T17:57:50.057195Z","id":"35b7bbc6-de90-4fb4-b3a9-b68a273a52e2","model_set":{"reader":"grok-4.3"},"one_line_summary":"A reversible quantum CORDIC algorithm computes arcsine using O(n) qubits, O(n log n) layers, and O(n²) CNOT gates for n-bit precision.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","strongest_claim":"For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared.","weakest_assumption":"The non-reversible operations traditionally present in classical CORDIC can be replaced by fully reversible quantum equivalents while preserving the stated asymptotic resource counts (abstract, paragraph on adapting CORDIC to quantum context)."}},"verdict_id":"35b7bbc6-de90-4fb4-b3a9-b68a273a52e2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:62182b20a1d0a3a2c07a19b0261c8afd70742ab82e4145a4b108b2e49f09aba2","target":"record","created_at":"2026-08-05T01:36:12Z","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":"e712baa816396313870fa287e216d63f43b4a4d8c857bc7c65f749d213e21cb5","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-02T11:00:58Z","title_canon_sha256":"4d925a70573100a1b40dff4590f5180b5eb2bbb1a2893fff55d2432bc066b923"},"schema_version":"1.0","source":{"id":"2411.14434","kind":"arxiv","version":3}},"canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","first_computed_at":"2026-08-05T01:36:12.127069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T01:36:12.127069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oJnBesIShW3gLVwh1rqiwwoGcuzZYLqZp3IeAPTxFQpGNVoVy6ozlXFwBBINLx9vLjJomWbHUeapIjcwZYOGAQ==","signature_status":"signed_v1","signed_at":"2026-08-05T01:36:12.128602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14434","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62182b20a1d0a3a2c07a19b0261c8afd70742ab82e4145a4b108b2e49f09aba2","sha256:1158224a5a16fbf256d01a8c6c3e98505af80cc0575aaca3162b4d273a6494ac"],"state_sha256":"a9e9a61eac82d78d5718c994867bdd669eded3494c92aefde86b883a9622eb8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpR3M82OPpONLyjksqJstRBI+v4LJzQOaPPpfTN0U+I9aTlvTW1UPRnEHlUrSzyx5sY1UCJ78IRbK5bwJRrvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T05:08:08.043539Z","bundle_sha256":"2dc283a7e04aa2b764ae8a0f15f7de87f0357943a8955488c3b83720617a3fe6"}}