{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VQHGVP3VE6GAMXIER5PEGHXWQO","short_pith_number":"pith:VQHGVP3V","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"},"canonical_sha256":"ac0e6abf75278c065d048f5e431ef6838449c3a797cdb179f171f0edf480e99c","source":{"kind":"arxiv","id":"1803.02067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02067","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02067v3","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02067","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"VQHGVP3VE6GA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VQHGVP3VE6GAMXIE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VQHGVP3V","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VQHGVP3VE6GAMXIER5PEGHXWQO","target":"record","payload":{"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"},"canonical_sha256":"ac0e6abf75278c065d048f5e431ef6838449c3a797cdb179f171f0edf480e99c","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"},"source_kind":"arxiv","source_id":"1803.02067","source_version":3,"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-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltw3KkP9X5WYu+3i7In1Vm+2vfn9EfMGdTWYri782eh7xmWntAZP8jFMBumlCe5xwm/ZbhGXWiqijiBYvuaOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:06:55.628761Z"},"content_sha256":"38f839c27ecf268f88e284a15b4e1d5d3c14f9760b1877d2fb8b35bfdfa4932d","schema_version":"1.0","event_id":"sha256:38f839c27ecf268f88e284a15b4e1d5d3c14f9760b1877d2fb8b35bfdfa4932d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VQHGVP3VE6GAMXIER5PEGHXWQO","target":"graph","payload":{"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"},"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-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rfSQNIQJ6YusiFgkys7nbiPen8Cmr5jiVypTBj23RA6MS2/+QifhsWv7aTskY4/oAI2RpUo3MLHallHidcWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:06:55.629052Z"},"content_sha256":"e72755000eb89a951e2f109ebea40d2142a0cebb711daffa187f1740397914f3","schema_version":"1.0","event_id":"sha256:e72755000eb89a951e2f109ebea40d2142a0cebb711daffa187f1740397914f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/bundle.json","state_url":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/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-08-23T22:06:55Z","links":{"resolver":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO","bundle":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/bundle.json","state":"https://pith.science/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQHGVP3VE6GAMXIER5PEGHXWQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VQHGVP3VE6GAMXIER5PEGHXWQO","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":"1868afe7ecc313cce556f0fcb54de5dcc2149fada08054110bc0521baa612dc4","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-06T09:04:02Z","title_canon_sha256":"7b76dd5016d981fa11b9e59ebb4da4a237371a6b7f6b30eba1a49f65415e8205"},"schema_version":"1.0","source":{"id":"1803.02067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02067","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02067v3","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02067","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"VQHGVP3VE6GA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VQHGVP3VE6GAMXIE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VQHGVP3V","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:e72755000eb89a951e2f109ebea40d2142a0cebb711daffa187f1740397914f3","target":"graph","created_at":"2026-05-18T00:01:43Z","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":"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 ","authors_text":"Alessandro Chiesa, Lynn Chua, Matthew Weidner","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-06T09:04:02Z","title":"On cycles of pairing-friendly elliptic curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02067","kind":"arxiv","version":3},"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:38f839c27ecf268f88e284a15b4e1d5d3c14f9760b1877d2fb8b35bfdfa4932d","target":"record","created_at":"2026-05-18T00:01:43Z","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":"1868afe7ecc313cce556f0fcb54de5dcc2149fada08054110bc0521baa612dc4","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-06T09:04:02Z","title_canon_sha256":"7b76dd5016d981fa11b9e59ebb4da4a237371a6b7f6b30eba1a49f65415e8205"},"schema_version":"1.0","source":{"id":"1803.02067","kind":"arxiv","version":3}},"canonical_sha256":"ac0e6abf75278c065d048f5e431ef6838449c3a797cdb179f171f0edf480e99c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac0e6abf75278c065d048f5e431ef6838449c3a797cdb179f171f0edf480e99c","first_computed_at":"2026-05-18T00:01:43.598380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:43.598380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lY+wxTR0MqU7DnK5g4+b9HIHsNyf6EWDgVHGEdmt4ip2PA3WFSE5Qx+4cHSFTzzUkvewL5GOEV4T7oNNlUasCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:43.598769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38f839c27ecf268f88e284a15b4e1d5d3c14f9760b1877d2fb8b35bfdfa4932d","sha256:e72755000eb89a951e2f109ebea40d2142a0cebb711daffa187f1740397914f3"],"state_sha256":"4a9505337cc41a66ce3cfecc6a48a6d610445335601e14b8a3e53cf1339e9e06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0v3yyzeEWr7dzMV4fUu79IBDahR9ThcbI5hR5CsHl59zsk2Fq5ot8Bidx95C2ZKYHI8fTZDU2JtEJLYxrSlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:06:55.633070Z","bundle_sha256":"2920e8e3fde3321c7504cf317f3f9f0101203f70e81be74da37c6bc8eeebcc8f"}}