{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GL67GRGJEG2YAJDSHZ4YGRMGEW","short_pith_number":"pith:GL67GRGJ","schema_version":"1.0","canonical_sha256":"32fdf344c921b58024723e7983458625b17f530fa33cbbd2d9003b45a9f3e443","source":{"kind":"arxiv","id":"1306.4562","version":1},"attestation_state":"computed","paper":{"title":"Primality Test for Numbers of the Form Ap^n+w","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chang Lv, Yingpu Deng","submitted_at":"2013-06-19T14:16:00Z","abstract_excerpt":"We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\\equiv1\\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\\log_2(M)$ for fixed $p$ and $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":"1306.4562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-06-19T14:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"3b23c9541970795f39b80211333c574aeb8a582f30855a8cecb68a157efa7268","abstract_canon_sha256":"072aed51a19a713219419158b028563e17057de67e810332e225cc2ef591602d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.852590Z","signature_b64":"E7GvcpiCsOxkklojbmspPL4FJLxRGqGq1ROLHQgyRuCs9Y8sgxNd3D6EPOBq2XtYjCh4LBaCQh8N7OOPKQIuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32fdf344c921b58024723e7983458625b17f530fa33cbbd2d9003b45a9f3e443","last_reissued_at":"2026-05-18T00:55:58.851946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.851946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primality Test for Numbers of the Form Ap^n+w","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chang Lv, Yingpu Deng","submitted_at":"2013-06-19T14:16:00Z","abstract_excerpt":"We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\\equiv1\\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\\log_2(M)$ for fixed $p$ and $A$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4562","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.4562","created_at":"2026-05-18T00:55:58.852039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4562v1","created_at":"2026-05-18T00:55:58.852039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4562","created_at":"2026-05-18T00:55:58.852039+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL67GRGJEG2Y","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL67GRGJEG2YAJDS","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL67GRGJ","created_at":"2026-05-18T12:27:45.050594+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/GL67GRGJEG2YAJDSHZ4YGRMGEW","json":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW.json","graph_json":"https://pith.science/api/pith-number/GL67GRGJEG2YAJDSHZ4YGRMGEW/graph.json","events_json":"https://pith.science/api/pith-number/GL67GRGJEG2YAJDSHZ4YGRMGEW/events.json","paper":"https://pith.science/paper/GL67GRGJ"},"agent_actions":{"view_html":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW","download_json":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW.json","view_paper":"https://pith.science/paper/GL67GRGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4562&json=true","fetch_graph":"https://pith.science/api/pith-number/GL67GRGJEG2YAJDSHZ4YGRMGEW/graph.json","fetch_events":"https://pith.science/api/pith-number/GL67GRGJEG2YAJDSHZ4YGRMGEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW/action/storage_attestation","attest_author":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW/action/author_attestation","sign_citation":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW/action/citation_signature","submit_replication":"https://pith.science/pith/GL67GRGJEG2YAJDSHZ4YGRMGEW/action/replication_record"}},"created_at":"2026-05-18T00:55:58.852039+00:00","updated_at":"2026-05-18T00:55:58.852039+00:00"}