{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G54DY6POM2MUGSDDZJORLLX2FI","short_pith_number":"pith:G54DY6PO","canonical_record":{"source":{"id":"1403.7887","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-03-31T07:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"0f14160cd5309f76fe7276cd0d918efd541602714c5fa80dbe0a1ef4d707bcfb","abstract_canon_sha256":"018130cfc4a6651fe5883f6c5f911becc6dbafde453b9f326c07af74eb8a8761"},"schema_version":"1.0"},"canonical_sha256":"37783c79ee6699434863ca5d15aefa2a1ce920a4133a4d41870c8fc5a4712c38","source":{"kind":"arxiv","id":"1403.7887","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7887","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7887v3","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7887","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"G54DY6POM2MU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G54DY6POM2MUGSDD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G54DY6PO","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G54DY6POM2MUGSDDZJORLLX2FI","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7887","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-03-31T07:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"0f14160cd5309f76fe7276cd0d918efd541602714c5fa80dbe0a1ef4d707bcfb","abstract_canon_sha256":"018130cfc4a6651fe5883f6c5f911becc6dbafde453b9f326c07af74eb8a8761"},"schema_version":"1.0"},"canonical_sha256":"37783c79ee6699434863ca5d15aefa2a1ce920a4133a4d41870c8fc5a4712c38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.798512Z","signature_b64":"eXigf/rQmHMfbdVukkuvw/Q/6xkw23IF7r7s6E9P9nsuMhlhod8qWe2Yx2drJVu9lK/Gw1xr6ynAupf8uwmmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37783c79ee6699434863ca5d15aefa2a1ce920a4133a4d41870c8fc5a4712c38","last_reissued_at":"2026-05-18T00:53:40.798128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.798128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7887","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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TqWVY84q0dnViHRfq/xTVcn49n4eiOvlzMJQKi47i5MQzWz1QCjB3/Uiept7E4JAIRPJctq49LkP4J6qN+pDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:56:22.785945Z"},"content_sha256":"97d11901cd90dfe0b058684d18d566a52186cac6641d746a679d41d12259ae13","schema_version":"1.0","event_id":"sha256:97d11901cd90dfe0b058684d18d566a52186cac6641d746a679d41d12259ae13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G54DY6POM2MUGSDDZJORLLX2FI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding elliptic curves with a subgroup of prescribed size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland, Igor E. Shparlinski","submitted_at":"2014-03-31T07:00:03Z","abstract_excerpt":"Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is divisible by m. The running time of the algorithm is mp^(1/2+o(1)), and this leads to more efficient constructions of rational functions over F_p whose image is small relative to p. We also give an unconditional version of the algorithm that works for almost all primes p, and give a probabilistic algorithm with subexponential time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7887","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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROCxsDJFJ8gkOoE6wIq2MJPx6PI93JOhZ+U2OlqagMrIwQQr48u3pykWnft+JEH8jQEcQXciS++7mUJedScMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:56:22.786290Z"},"content_sha256":"068b3a9b122d8ba49abd4abb9b8a6ca007d8114776881341c71eb8c7a246567b","schema_version":"1.0","event_id":"sha256:068b3a9b122d8ba49abd4abb9b8a6ca007d8114776881341c71eb8c7a246567b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G54DY6POM2MUGSDDZJORLLX2FI/bundle.json","state_url":"https://pith.science/pith/G54DY6POM2MUGSDDZJORLLX2FI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G54DY6POM2MUGSDDZJORLLX2FI/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-05T10:56:22Z","links":{"resolver":"https://pith.science/pith/G54DY6POM2MUGSDDZJORLLX2FI","bundle":"https://pith.science/pith/G54DY6POM2MUGSDDZJORLLX2FI/bundle.json","state":"https://pith.science/pith/G54DY6POM2MUGSDDZJORLLX2FI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G54DY6POM2MUGSDDZJORLLX2FI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G54DY6POM2MUGSDDZJORLLX2FI","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":"018130cfc4a6651fe5883f6c5f911becc6dbafde453b9f326c07af74eb8a8761","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-03-31T07:00:03Z","title_canon_sha256":"0f14160cd5309f76fe7276cd0d918efd541602714c5fa80dbe0a1ef4d707bcfb"},"schema_version":"1.0","source":{"id":"1403.7887","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7887","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7887v3","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7887","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"G54DY6POM2MU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G54DY6POM2MUGSDD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G54DY6PO","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:068b3a9b122d8ba49abd4abb9b8a6ca007d8114776881341c71eb8c7a246567b","target":"graph","created_at":"2026-05-18T00:53:40Z","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":"Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is divisible by m. The running time of the algorithm is mp^(1/2+o(1)), and this leads to more efficient constructions of rational functions over F_p whose image is small relative to p. We also give an unconditional version of the algorithm that works for almost all primes p, and give a probabilistic algorithm with subexponential time complexity.","authors_text":"Andrew V. Sutherland, Igor E. Shparlinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-03-31T07:00:03Z","title":"Finding elliptic curves with a subgroup of prescribed size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7887","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:97d11901cd90dfe0b058684d18d566a52186cac6641d746a679d41d12259ae13","target":"record","created_at":"2026-05-18T00:53:40Z","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":"018130cfc4a6651fe5883f6c5f911becc6dbafde453b9f326c07af74eb8a8761","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-03-31T07:00:03Z","title_canon_sha256":"0f14160cd5309f76fe7276cd0d918efd541602714c5fa80dbe0a1ef4d707bcfb"},"schema_version":"1.0","source":{"id":"1403.7887","kind":"arxiv","version":3}},"canonical_sha256":"37783c79ee6699434863ca5d15aefa2a1ce920a4133a4d41870c8fc5a4712c38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37783c79ee6699434863ca5d15aefa2a1ce920a4133a4d41870c8fc5a4712c38","first_computed_at":"2026-05-18T00:53:40.798128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:40.798128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXigf/rQmHMfbdVukkuvw/Q/6xkw23IF7r7s6E9P9nsuMhlhod8qWe2Yx2drJVu9lK/Gw1xr6ynAupf8uwmmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:40.798512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7887","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97d11901cd90dfe0b058684d18d566a52186cac6641d746a679d41d12259ae13","sha256:068b3a9b122d8ba49abd4abb9b8a6ca007d8114776881341c71eb8c7a246567b"],"state_sha256":"31d45b6c3d227332b5773e0baa9b886c94256ba493c76b40a9b187f7346c27b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGO1vIXCDUemvfEnZOz1J1buhIQBb8qd5LfzLlp+764dKYdXMJtHddKbSts4X1onSX9daWA4P85RhtDVubKMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:56:22.789125Z","bundle_sha256":"17823974aab32b488ad5705e6dfb5addeb0e97dfb3fc15545a77827611042ac7"}}