{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:34IGDG5GCP6TCO2MYKPO2Y5NWB","short_pith_number":"pith:34IGDG5G","schema_version":"1.0","canonical_sha256":"df10619ba613fd313b4cc29eed63adb057d5b95b3575154e39f57fe69cf84481","source":{"kind":"arxiv","id":"quant-ph/0112055","version":4},"attestation_state":"computed","paper":{"title":"A Refinement of Shor's Algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David McAnally","submitted_at":"2001-12-09T22:53:28Z","abstract_excerpt":"A refinement of Shor's Algorithm for determining order is introduced, which determines a divisor of the order after any one run of a quantum computer with almost absolute certainty. The information garnered from each run is accumulated to determine the order, and for any k greater than 1, there is a guaranteed minimum positive probability that the order will be determined after at most k runs. The probability of determination of the order after at most k runs exponentially approaches a value negligibly less than one, so that the accumulated information determines the order with almost absolute"},"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":"quant-ph/0112055","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-12-09T22:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"5e7343c3010067788b17369b8f70a5ad3a5c74d63bc6c1629062a2982375b3cf","abstract_canon_sha256":"2f7ce00b1650fbb507c0170c790e9e20ce1771fd9fd2434fe81d7446c0df096b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:51.373239Z","signature_b64":"7YxSmg4woCB1Q2VbyDQkcxOJRETEwkN1IAnSPIqzqiULgTHaRsn8grtzyvLW8b2H7HcpM08+b51DF/wPIYQZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df10619ba613fd313b4cc29eed63adb057d5b95b3575154e39f57fe69cf84481","last_reissued_at":"2026-07-04T14:45:51.372873Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:51.372873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Refinement of Shor's Algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David McAnally","submitted_at":"2001-12-09T22:53:28Z","abstract_excerpt":"A refinement of Shor's Algorithm for determining order is introduced, which determines a divisor of the order after any one run of a quantum computer with almost absolute certainty. The information garnered from each run is accumulated to determine the order, and for any k greater than 1, there is a guaranteed minimum positive probability that the order will be determined after at most k runs. The probability of determination of the order after at most k runs exponentially approaches a value negligibly less than one, so that the accumulated information determines the order with almost absolute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0112055","kind":"arxiv","version":4},"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/quant-ph/0112055/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":"quant-ph/0112055","created_at":"2026-07-04T14:45:51.372929+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0112055v4","created_at":"2026-07-04T14:45:51.372929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0112055","created_at":"2026-07-04T14:45:51.372929+00:00"},{"alias_kind":"pith_short_12","alias_value":"34IGDG5GCP6T","created_at":"2026-07-04T14:45:51.372929+00:00"},{"alias_kind":"pith_short_16","alias_value":"34IGDG5GCP6TCO2M","created_at":"2026-07-04T14:45:51.372929+00:00"},{"alias_kind":"pith_short_8","alias_value":"34IGDG5G","created_at":"2026-07-04T14:45:51.372929+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/34IGDG5GCP6TCO2MYKPO2Y5NWB","json":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB.json","graph_json":"https://pith.science/api/pith-number/34IGDG5GCP6TCO2MYKPO2Y5NWB/graph.json","events_json":"https://pith.science/api/pith-number/34IGDG5GCP6TCO2MYKPO2Y5NWB/events.json","paper":"https://pith.science/paper/34IGDG5G"},"agent_actions":{"view_html":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB","download_json":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB.json","view_paper":"https://pith.science/paper/34IGDG5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0112055&json=true","fetch_graph":"https://pith.science/api/pith-number/34IGDG5GCP6TCO2MYKPO2Y5NWB/graph.json","fetch_events":"https://pith.science/api/pith-number/34IGDG5GCP6TCO2MYKPO2Y5NWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB/action/storage_attestation","attest_author":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB/action/author_attestation","sign_citation":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB/action/citation_signature","submit_replication":"https://pith.science/pith/34IGDG5GCP6TCO2MYKPO2Y5NWB/action/replication_record"}},"created_at":"2026-07-04T14:45:51.372929+00:00","updated_at":"2026-07-04T14:45:51.372929+00:00"}