{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VQHGVP3VE6GAMXIER5PEGHXWQO","short_pith_number":"pith:VQHGVP3V","schema_version":"1.0","canonical_sha256":"ac0e6abf75278c065d048f5e431ef6838449c3a797cdb179f171f0edf480e99c","source":{"kind":"arxiv","id":"1803.02067","version":3},"attestation_state":"computed","paper":{"title":"On cycles of pairing-friendly elliptic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"Alessandro Chiesa, Lynn Chua, Matthew Weidner","submitted_at":"2018-03-06T09:04:02Z","abstract_excerpt":"A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which every curve is pairing-friendly. These have recently found notable applications in pairing-based cryptography, for instance in improving the scalability of distributed ledger technologies. We construct a new cycle of length 4 consisting of MNT curves, and characterize all the possibilities for cycles consisting of MNT curves. We rule out cycles of length 2 "},"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":"1803.02067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-06T09:04:02Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"7b76dd5016d981fa11b9e59ebb4da4a237371a6b7f6b30eba1a49f65415e8205","abstract_canon_sha256":"1868afe7ecc313cce556f0fcb54de5dcc2149fada08054110bc0521baa612dc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.598769Z","signature_b64":"lY+wxTR0MqU7DnK5g4+b9HIHsNyf6EWDgVHGEdmt4ip2PA3WFSE5Qx+4cHSFTzzUkvewL5GOEV4T7oNNlUasCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac0e6abf75278c065d048f5e431ef6838449c3a797cdb179f171f0edf480e99c","last_reissued_at":"2026-05-18T00:01:43.598380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.598380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cycles of pairing-friendly elliptic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"Alessandro Chiesa, Lynn Chua, Matthew Weidner","submitted_at":"2018-03-06T09:04:02Z","abstract_excerpt":"A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which every curve is pairing-friendly. These have recently found notable applications in pairing-based cryptography, for instance in improving the scalability of distributed ledger technologies. We construct a new cycle of length 4 consisting of MNT curves, and characterize all the possibilities for cycles consisting of MNT curves. We rule out cycles of length 2 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02067","kind":"arxiv","version":3},"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":"1803.02067","created_at":"2026-05-18T00:01:43.598441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02067v3","created_at":"2026-05-18T00:01:43.598441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02067","created_at":"2026-05-18T00:01:43.598441+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQHGVP3VE6GA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQHGVP3VE6GAMXIE","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQHGVP3V","created_at":"2026-05-18T12:32:59.047623+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/VQHGVP3VE6GAMXIER5PEGHXWQO","json":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO.json","graph_json":"https://pith.science/api/pith-number/VQHGVP3VE6GAMXIER5PEGHXWQO/graph.json","events_json":"https://pith.science/api/pith-number/VQHGVP3VE6GAMXIER5PEGHXWQO/events.json","paper":"https://pith.science/paper/VQHGVP3V"},"agent_actions":{"view_html":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO","download_json":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO.json","view_paper":"https://pith.science/paper/VQHGVP3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02067&json=true","fetch_graph":"https://pith.science/api/pith-number/VQHGVP3VE6GAMXIER5PEGHXWQO/graph.json","fetch_events":"https://pith.science/api/pith-number/VQHGVP3VE6GAMXIER5PEGHXWQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/action/storage_attestation","attest_author":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/action/author_attestation","sign_citation":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/action/citation_signature","submit_replication":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/action/replication_record"}},"created_at":"2026-05-18T00:01:43.598441+00:00","updated_at":"2026-05-18T00:01:43.598441+00:00"}