{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FFNPHQJURADMYGOJHD6B2U7BED","short_pith_number":"pith:FFNPHQJU","schema_version":"1.0","canonical_sha256":"295af3c1348806cc19c938fc1d53e120eb4cb5c4a20dd8f4c568d67ce201352a","source":{"kind":"arxiv","id":"2006.08444","version":2},"attestation_state":"computed","paper":{"title":"Advances in Factoring and Primality Testing: From Classical to Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Amjad Abuhassan, Anas A. Abudaqa, Farid Binbeshr, Mostefa Kara, Muhammad Imam, Nujud Alyami","submitted_at":"2020-06-15T14:40:50Z","abstract_excerpt":"Many modern asymmetric encryption methods rely on prime numbers, as they have distinctive properties. For instance, the security of RSA cryptosystem relies on the computational difficulty of factoring a large composite number in its prime factors, a problem that remains challenging for classical computers but potentially solvable using quantum algorithms. On the other hand, generating large prime numbers is also challenging due to their irregular distribution among integers, necessitating the use of primality testing algorithms to verify candidate primes. In this paper, we intensively review a"},"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":"2006.08444","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2020-06-15T14:40:50Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"9a55cc28625c52aed5a6c7ca5e51b56cc1c35e590673d738d98a6d869224f194","abstract_canon_sha256":"3eb99f261f0f98fa5ea9108317081508894ea8a4c8344dc7906d0f9ef1090e81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:00.896277Z","signature_b64":"Ajd4PYiXOB8jPgvYIhsMdQFey533UO2EVy/32C3Y8/Ji2RMKskeUys2ByCBqH55WjMpWSjMX1jqg1IvGBIcPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"295af3c1348806cc19c938fc1d53e120eb4cb5c4a20dd8f4c568d67ce201352a","last_reissued_at":"2026-05-20T00:02:00.895387Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:00.895387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances in Factoring and Primality Testing: From Classical to Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Amjad Abuhassan, Anas A. Abudaqa, Farid Binbeshr, Mostefa Kara, Muhammad Imam, Nujud Alyami","submitted_at":"2020-06-15T14:40:50Z","abstract_excerpt":"Many modern asymmetric encryption methods rely on prime numbers, as they have distinctive properties. For instance, the security of RSA cryptosystem relies on the computational difficulty of factoring a large composite number in its prime factors, a problem that remains challenging for classical computers but potentially solvable using quantum algorithms. On the other hand, generating large prime numbers is also challenging due to their irregular distribution among integers, necessitating the use of primality testing algorithms to verify candidate primes. In this paper, we intensively review a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08444","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/2006.08444/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":"2006.08444","created_at":"2026-05-20T00:02:00.895549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08444v2","created_at":"2026-05-20T00:02:00.895549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08444","created_at":"2026-05-20T00:02:00.895549+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFNPHQJURADM","created_at":"2026-05-20T00:02:00.895549+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFNPHQJURADMYGOJ","created_at":"2026-05-20T00:02:00.895549+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFNPHQJU","created_at":"2026-05-20T00:02:00.895549+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/FFNPHQJURADMYGOJHD6B2U7BED","json":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED.json","graph_json":"https://pith.science/api/pith-number/FFNPHQJURADMYGOJHD6B2U7BED/graph.json","events_json":"https://pith.science/api/pith-number/FFNPHQJURADMYGOJHD6B2U7BED/events.json","paper":"https://pith.science/paper/FFNPHQJU"},"agent_actions":{"view_html":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED","download_json":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED.json","view_paper":"https://pith.science/paper/FFNPHQJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08444&json=true","fetch_graph":"https://pith.science/api/pith-number/FFNPHQJURADMYGOJHD6B2U7BED/graph.json","fetch_events":"https://pith.science/api/pith-number/FFNPHQJURADMYGOJHD6B2U7BED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED/action/storage_attestation","attest_author":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED/action/author_attestation","sign_citation":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED/action/citation_signature","submit_replication":"https://pith.science/pith/FFNPHQJURADMYGOJHD6B2U7BED/action/replication_record"}},"created_at":"2026-05-20T00:02:00.895549+00:00","updated_at":"2026-05-20T00:02:00.895549+00:00"}