{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GVWVZNTIZEMPCCBIZVMYSCQGRS","short_pith_number":"pith:GVWVZNTI","canonical_record":{"source":{"id":"1311.3785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-15T09:41:54Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"3426be68513d9454f818cdf3a54d5d9964be1b84948674e3fcc9b3bbcdbed901","abstract_canon_sha256":"cf8ee362656610042362fd5a41875f7e19e9a4fde36860d9409cb35fc76e2533"},"schema_version":"1.0"},"canonical_sha256":"356d5cb668c918f10828cd59890a068ca12add09908c398e2e1c1153dc411792","source":{"kind":"arxiv","id":"1311.3785","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3785","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3785v1","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3785","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"GVWVZNTIZEMP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVWVZNTIZEMPCCBI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVWVZNTI","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GVWVZNTIZEMPCCBIZVMYSCQGRS","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-15T09:41:54Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"3426be68513d9454f818cdf3a54d5d9964be1b84948674e3fcc9b3bbcdbed901","abstract_canon_sha256":"cf8ee362656610042362fd5a41875f7e19e9a4fde36860d9409cb35fc76e2533"},"schema_version":"1.0"},"canonical_sha256":"356d5cb668c918f10828cd59890a068ca12add09908c398e2e1c1153dc411792","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:03.022699Z","signature_b64":"fXCSG76n9ah/LNG3IZnpRetNPkCE+4HUll0V71TFIQFTok3+taVdSermgWpP3C9WLx6BcNaWgoPePEsqHYkpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"356d5cb668c918f10828cd59890a068ca12add09908c398e2e1c1153dc411792","last_reissued_at":"2026-05-18T03:07:03.022324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:03.022324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3785","source_version":1,"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-05-18T03:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0t2ez5QqVJUGO7pI4zOrtPwGLTqjRRSiLdOCeiE38jv21qkRcRBBPDgz9KuGE609naeWg1P35Bsk6fPWsYUzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:23:46.058227Z"},"content_sha256":"9f06550ed749c7c1dd0a21e906c9414d76975b06b1813b19a6f320fd021c135c","schema_version":"1.0","event_id":"sha256:9f06550ed749c7c1dd0a21e906c9414d76975b06b1813b19a6f320fd021c135c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GVWVZNTIZEMPCCBIZVMYSCQGRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Primality Testing - understanding the AKS algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.CC","authors_text":"Vijay Menon","submitted_at":"2013-11-15T09:41:54Z","abstract_excerpt":"Prime numbers play a very vital role in modern cryptography and especially the difficulties involved in factoring numbers composed of product of two large prime numbers have been put to use in many modern cryptographic designs. Thus, the problem of distinguishing prime numbers from the rest is vital and therefore there is a need to have efficient primality testing algorithms. Although there had been many probabilistic algorithms for primality testing, there wasn't a deterministic polynomial time algorithm until 2002 when Agrawal, Kayal and Saxena came with an algorithm, popularly known as the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3785","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"madcX9NPfMKX/8GhEVQcVisdA2/bmAMt6uDwI4U3r8RqrDNScBCFO8mwGmYZ/aynChwLMsGwkYtDnPMNYq/YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:23:46.058917Z"},"content_sha256":"f1195ab594c553c2fdd8ea43222e36ad4b8d8e9256789f9055470745733f9a45","schema_version":"1.0","event_id":"sha256:f1195ab594c553c2fdd8ea43222e36ad4b8d8e9256789f9055470745733f9a45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS/bundle.json","state_url":"https://pith.science/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS/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-05-24T02:23:46Z","links":{"resolver":"https://pith.science/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS","bundle":"https://pith.science/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS/bundle.json","state":"https://pith.science/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVWVZNTIZEMPCCBIZVMYSCQGRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GVWVZNTIZEMPCCBIZVMYSCQGRS","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":"cf8ee362656610042362fd5a41875f7e19e9a4fde36860d9409cb35fc76e2533","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-15T09:41:54Z","title_canon_sha256":"3426be68513d9454f818cdf3a54d5d9964be1b84948674e3fcc9b3bbcdbed901"},"schema_version":"1.0","source":{"id":"1311.3785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3785","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3785v1","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3785","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"GVWVZNTIZEMP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVWVZNTIZEMPCCBI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVWVZNTI","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:f1195ab594c553c2fdd8ea43222e36ad4b8d8e9256789f9055470745733f9a45","target":"graph","created_at":"2026-05-18T03:07:03Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Prime numbers play a very vital role in modern cryptography and especially the difficulties involved in factoring numbers composed of product of two large prime numbers have been put to use in many modern cryptographic designs. Thus, the problem of distinguishing prime numbers from the rest is vital and therefore there is a need to have efficient primality testing algorithms. Although there had been many probabilistic algorithms for primality testing, there wasn't a deterministic polynomial time algorithm until 2002 when Agrawal, Kayal and Saxena came with an algorithm, popularly known as the ","authors_text":"Vijay Menon","cross_cats":["cs.CR","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-15T09:41:54Z","title":"Deterministic Primality Testing - understanding the AKS algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3785","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f06550ed749c7c1dd0a21e906c9414d76975b06b1813b19a6f320fd021c135c","target":"record","created_at":"2026-05-18T03:07:03Z","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":"cf8ee362656610042362fd5a41875f7e19e9a4fde36860d9409cb35fc76e2533","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-15T09:41:54Z","title_canon_sha256":"3426be68513d9454f818cdf3a54d5d9964be1b84948674e3fcc9b3bbcdbed901"},"schema_version":"1.0","source":{"id":"1311.3785","kind":"arxiv","version":1}},"canonical_sha256":"356d5cb668c918f10828cd59890a068ca12add09908c398e2e1c1153dc411792","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"356d5cb668c918f10828cd59890a068ca12add09908c398e2e1c1153dc411792","first_computed_at":"2026-05-18T03:07:03.022324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:03.022324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fXCSG76n9ah/LNG3IZnpRetNPkCE+4HUll0V71TFIQFTok3+taVdSermgWpP3C9WLx6BcNaWgoPePEsqHYkpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:03.022699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f06550ed749c7c1dd0a21e906c9414d76975b06b1813b19a6f320fd021c135c","sha256:f1195ab594c553c2fdd8ea43222e36ad4b8d8e9256789f9055470745733f9a45"],"state_sha256":"f226bd37dc350dd4cb1b2a914775c06dcde01f7b2da9dbbdeaeb9b8d3b6249bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3vy6DxiH1ciAuc6n5RKwW3xKhCZySBL27l0J4b11jnumUdADiX9oNlOEfoUe3YA1QLVZ1nWVdzR5Ns7jywaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:23:46.062118Z","bundle_sha256":"2fbd52b0e99d5c5516fdaba72a7869cd381accf53c4862cbbf5d8a148fcb606c"}}