{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RWILKYPLNQK2IVSKYFA7G2N5G6","short_pith_number":"pith:RWILKYPL","canonical_record":{"source":{"id":"1202.3695","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-16T20:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"7e431b0864e4f609ca05a050cb63bda1556015faf5be48d859f43e51e17b6984","abstract_canon_sha256":"a4b2f5fe2a58c9df9ab1bdc097c920f724b4935110ab4767d1bc263946c054cc"},"schema_version":"1.0"},"canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","source":{"kind":"arxiv","id":"1202.3695","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3695","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3695v4","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3695","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"RWILKYPLNQK2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RWILKYPLNQK2IVSK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RWILKYPL","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RWILKYPLNQK2IVSKYFA7G2N5G6","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3695","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-16T20:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"7e431b0864e4f609ca05a050cb63bda1556015faf5be48d859f43e51e17b6984","abstract_canon_sha256":"a4b2f5fe2a58c9df9ab1bdc097c920f724b4935110ab4767d1bc263946c054cc"},"schema_version":"1.0"},"canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:30.350837Z","signature_b64":"0gH0zaRLM+3PD1URtksCUyaBlop4xXBRfgoAuXgSt1cDBdtkjPWW9phwocd3KNYY10sWVoi/qggpOJMR7z6tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","last_reissued_at":"2026-05-18T02:22:30.350117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:30.350117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3695","source_version":4,"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-18T02:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpea2KmLTxGE3ilV10KoL44WAm3SEQHfscpmF8114cP9KsrXbQSkLycSdpBpzPs4iVr7242xR99koOJJFPyxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:36:00.181386Z"},"content_sha256":"d3c473a1015594bcc71b10abcd743dbe0b7070ef0334d3afcae4c2364b70a9eb","schema_version":"1.0","event_id":"sha256:d3c473a1015594bcc71b10abcd743dbe0b7070ef0334d3afcae4c2364b70a9eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RWILKYPLNQK2IVSKYFA7G2N5G6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic elliptic curve primality proving for a special sequence of numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong","submitted_at":"2012-02-16T20:57:44Z","abstract_excerpt":"We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N) arithmetic operations in the ring Z/NZ, implying a bit complexity that is quasi-quadratic in log N. Notably, neither of the classical \"N-1\" or \"N+1\" primality tests apply to the integers in our sequence. We discuss how this algorithm may be applied, in combination with sieving techniques, to efficiently search for very large primes. This has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3695","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":""},"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-18T02:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBJSZqLCetkb5BNWVJt3jrs2GYHr51hsttcpxHWaVnCSHwG1S1dyEP8jCBo+cWOE7preKpqeO3LG2WqpcmH2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:36:00.181740Z"},"content_sha256":"a48d72e53f38cc04d257a4e7b6df68e3d75373bbbe19dcd3b85a4e4ce2d2b42d","schema_version":"1.0","event_id":"sha256:a48d72e53f38cc04d257a4e7b6df68e3d75373bbbe19dcd3b85a4e4ce2d2b42d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/bundle.json","state_url":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/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-06-02T02:36:00Z","links":{"resolver":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6","bundle":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/bundle.json","state":"https://pith.science/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWILKYPLNQK2IVSKYFA7G2N5G6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RWILKYPLNQK2IVSKYFA7G2N5G6","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":"a4b2f5fe2a58c9df9ab1bdc097c920f724b4935110ab4767d1bc263946c054cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-16T20:57:44Z","title_canon_sha256":"7e431b0864e4f609ca05a050cb63bda1556015faf5be48d859f43e51e17b6984"},"schema_version":"1.0","source":{"id":"1202.3695","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3695","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3695v4","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3695","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"RWILKYPLNQK2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RWILKYPLNQK2IVSK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RWILKYPL","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:a48d72e53f38cc04d257a4e7b6df68e3d75373bbbe19dcd3b85a4e4ce2d2b42d","target":"graph","created_at":"2026-05-18T02:22:30Z","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":"We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N) arithmetic operations in the ring Z/NZ, implying a bit complexity that is quasi-quadratic in log N. Notably, neither of the classical \"N-1\" or \"N+1\" primality tests apply to the integers in our sequence. We discuss how this algorithm may be applied, in combination with sieving techniques, to efficiently search for very large primes. This has a","authors_text":"Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-16T20:57:44Z","title":"Deterministic elliptic curve primality proving for a special sequence of numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3695","kind":"arxiv","version":4},"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:d3c473a1015594bcc71b10abcd743dbe0b7070ef0334d3afcae4c2364b70a9eb","target":"record","created_at":"2026-05-18T02:22:30Z","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":"a4b2f5fe2a58c9df9ab1bdc097c920f724b4935110ab4767d1bc263946c054cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-16T20:57:44Z","title_canon_sha256":"7e431b0864e4f609ca05a050cb63bda1556015faf5be48d859f43e51e17b6984"},"schema_version":"1.0","source":{"id":"1202.3695","kind":"arxiv","version":4}},"canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d90b561eb6c15a4564ac141f369bd37a96f78527a66c6bb39be4fe93a8e72c4","first_computed_at":"2026-05-18T02:22:30.350117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:30.350117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0gH0zaRLM+3PD1URtksCUyaBlop4xXBRfgoAuXgSt1cDBdtkjPWW9phwocd3KNYY10sWVoi/qggpOJMR7z6tAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:30.350837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3695","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3c473a1015594bcc71b10abcd743dbe0b7070ef0334d3afcae4c2364b70a9eb","sha256:a48d72e53f38cc04d257a4e7b6df68e3d75373bbbe19dcd3b85a4e4ce2d2b42d"],"state_sha256":"a88f0c3e0e63fe4677390b8040f3cd167172079eb14b37f5826600fe4396ae08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ijDrTOYT6+pfwRRiqpq4Q5KQkEkbWU0mtCiUlpd5B+XYVa6Bfw6Qfq12zpkQaruFWtP7HaljB8tISRN5qbqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:36:00.183736Z","bundle_sha256":"6f4d2f0ab269df86e4e9f9c5895765af01aa468e1cc42c48d5f9725a01aa9ec3"}}