{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q6K5QQQ4YNKNZOMCUFCSHZ6RA3","short_pith_number":"pith:Q6K5QQQ4","schema_version":"1.0","canonical_sha256":"8795d8421cc354dcb982a14523e7d106e043439f4957663ffdb072037af6c2c3","source":{"kind":"arxiv","id":"1710.05687","version":1},"attestation_state":"computed","paper":{"title":"Elliptic Curves of Fibonacci order over $\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Percival, Duc Van Huynh, Rosina Campbell, Tyler Melton","submitted_at":"2017-10-16T13:37:21Z","abstract_excerpt":"We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\\mathbb{F}_p$ such that such that $|E_{f_q}(\\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The algorithm is a variant of the efficient CM-construction by Br$\\ddot{o}$ker and Stevenhagen, which is well suited for Fibonacci primes due to their arithmetic properties. The time complexity of our algorithm is expected to be lower than $\\widetilde{O}(\\log^3({f_q}))$. The construction process is a series of algorithms, where each is a test for primality."},"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":"1710.05687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-10-16T13:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"a65a018461e23ed31453741f0e222d76c2ef18afe2b748fd9772abc4546698f2","abstract_canon_sha256":"4e5bb3ad26549231f4caee15953f1a77c42175a6b20499c9e8cfddad78994b48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:48.534608Z","signature_b64":"0XQSz8qAySGnUsusxoi+WfGc3K7EeRA9wGshG3fbpywVCOnTUOOdNN4pcItqwH1ryensfpDGIv/wVb2kjD3EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8795d8421cc354dcb982a14523e7d106e043439f4957663ffdb072037af6c2c3","last_reissued_at":"2026-05-18T00:32:48.533896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:48.533896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elliptic Curves of Fibonacci order over $\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Percival, Duc Van Huynh, Rosina Campbell, Tyler Melton","submitted_at":"2017-10-16T13:37:21Z","abstract_excerpt":"We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\\mathbb{F}_p$ such that such that $|E_{f_q}(\\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The algorithm is a variant of the efficient CM-construction by Br$\\ddot{o}$ker and Stevenhagen, which is well suited for Fibonacci primes due to their arithmetic properties. The time complexity of our algorithm is expected to be lower than $\\widetilde{O}(\\log^3({f_q}))$. The construction process is a series of algorithms, where each is a test for primality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05687","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":"1710.05687","created_at":"2026-05-18T00:32:48.534015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05687v1","created_at":"2026-05-18T00:32:48.534015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05687","created_at":"2026-05-18T00:32:48.534015+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6K5QQQ4YNKN","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6K5QQQ4YNKNZOMC","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6K5QQQ4","created_at":"2026-05-18T12:31:37.085036+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/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3","json":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3.json","graph_json":"https://pith.science/api/pith-number/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/graph.json","events_json":"https://pith.science/api/pith-number/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/events.json","paper":"https://pith.science/paper/Q6K5QQQ4"},"agent_actions":{"view_html":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3","download_json":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3.json","view_paper":"https://pith.science/paper/Q6K5QQQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05687&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/action/storage_attestation","attest_author":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/action/author_attestation","sign_citation":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/action/citation_signature","submit_replication":"https://pith.science/pith/Q6K5QQQ4YNKNZOMCUFCSHZ6RA3/action/replication_record"}},"created_at":"2026-05-18T00:32:48.534015+00:00","updated_at":"2026-05-18T00:32:48.534015+00:00"}