{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LYCGBQ5ZHVAFZAWAWCZBSLD3JR","short_pith_number":"pith:LYCGBQ5Z","canonical_record":{"source":{"id":"1810.00022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-28T18:09:21Z","cross_cats_sorted":["cs.CR","math.AG"],"title_canon_sha256":"45669f059c52f7e21633e9531d62b567be3221d444fbcd710a23e831719ccbe6","abstract_canon_sha256":"ec3b3f7939c7bfef2b3f06c9c8f914a7992a9de5101594a4e20d5d16b9a76139"},"schema_version":"1.0"},"canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","source":{"kind":"arxiv","id":"1810.00022","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00022","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00022v2","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00022","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"LYCGBQ5ZHVAF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LYCGBQ5ZHVAFZAWA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LYCGBQ5Z","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LYCGBQ5ZHVAFZAWAWCZBSLD3JR","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-28T18:09:21Z","cross_cats_sorted":["cs.CR","math.AG"],"title_canon_sha256":"45669f059c52f7e21633e9531d62b567be3221d444fbcd710a23e831719ccbe6","abstract_canon_sha256":"ec3b3f7939c7bfef2b3f06c9c8f914a7992a9de5101594a4e20d5d16b9a76139"},"schema_version":"1.0"},"canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:19.373788Z","signature_b64":"w+S60jW4EYOCTSSJQoSO7XYkkZY7H7xAq+hDhVwMX1pZ0KptdDRQHoCrh8b2C7xBGi7rz6OvU+s3YaCYH+JFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","last_reissued_at":"2026-05-17T23:46:19.372993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:19.372993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00022","source_version":2,"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-17T23:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yz+Zxgc0hb0/T/c3w5dtNqBxE79ZGGOLuaJxo40UkCedPD3k19E7xAG2gqsLt+dIEuOuY3KYlW1koBCZ05jkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:10:21.384056Z"},"content_sha256":"b6f5de588fca20d668bfeb9f6a6b228be8e3503586ec8c3efb755231253b2a77","schema_version":"1.0","event_id":"sha256:b6f5de588fca20d668bfeb9f6a6b228be8e3503586ec8c3efb755231253b2a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LYCGBQ5ZHVAFZAWAWCZBSLD3JR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hard isogeny problems over RSA moduli and groups with infeasible inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AG"],"primary_cat":"math.NT","authors_text":"Salim Ali Altug, Yilei Chen","submitted_at":"2018-09-28T18:09:21Z","abstract_excerpt":"We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of cryptanalytic attempts on these problems. Moreover, based on the hardness of these problems, we provide a construction of groups with infeasible inversion, where the underlying groups are the ideal class groups of imaginary quadratic orders.\n  Recall that in a group with infeasible inversion, computing the inverse of a group element is required to be hard, whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00022","kind":"arxiv","version":2},"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-17T23:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbTrF7OsPA0Od8upn4HKW2Mk+/yt/CHRp6HIqv5kkcl6Jxd6dWFZERGDed36J2Rsi7ojhngsgnh0RjxYSEAMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:10:21.384769Z"},"content_sha256":"b32f17c46454222ec1258ed485c5192f8ff55cdf9410971229a8c53577ff968c","schema_version":"1.0","event_id":"sha256:b32f17c46454222ec1258ed485c5192f8ff55cdf9410971229a8c53577ff968c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/bundle.json","state_url":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/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-05-31T09:10:21Z","links":{"resolver":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR","bundle":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/bundle.json","state":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LYCGBQ5ZHVAFZAWAWCZBSLD3JR","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":"ec3b3f7939c7bfef2b3f06c9c8f914a7992a9de5101594a4e20d5d16b9a76139","cross_cats_sorted":["cs.CR","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-28T18:09:21Z","title_canon_sha256":"45669f059c52f7e21633e9531d62b567be3221d444fbcd710a23e831719ccbe6"},"schema_version":"1.0","source":{"id":"1810.00022","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00022","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00022v2","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00022","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"LYCGBQ5ZHVAF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LYCGBQ5ZHVAFZAWA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LYCGBQ5Z","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:b32f17c46454222ec1258ed485c5192f8ff55cdf9410971229a8c53577ff968c","target":"graph","created_at":"2026-05-17T23:46:19Z","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":"We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of cryptanalytic attempts on these problems. Moreover, based on the hardness of these problems, we provide a construction of groups with infeasible inversion, where the underlying groups are the ideal class groups of imaginary quadratic orders.\n  Recall that in a group with infeasible inversion, computing the inverse of a group element is required to be hard, whil","authors_text":"Salim Ali Altug, Yilei Chen","cross_cats":["cs.CR","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-28T18:09:21Z","title":"Hard isogeny problems over RSA moduli and groups with infeasible inversion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00022","kind":"arxiv","version":2},"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:b6f5de588fca20d668bfeb9f6a6b228be8e3503586ec8c3efb755231253b2a77","target":"record","created_at":"2026-05-17T23:46:19Z","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":"ec3b3f7939c7bfef2b3f06c9c8f914a7992a9de5101594a4e20d5d16b9a76139","cross_cats_sorted":["cs.CR","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-28T18:09:21Z","title_canon_sha256":"45669f059c52f7e21633e9531d62b567be3221d444fbcd710a23e831719ccbe6"},"schema_version":"1.0","source":{"id":"1810.00022","kind":"arxiv","version":2}},"canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","first_computed_at":"2026-05-17T23:46:19.372993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:19.372993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w+S60jW4EYOCTSSJQoSO7XYkkZY7H7xAq+hDhVwMX1pZ0KptdDRQHoCrh8b2C7xBGi7rz6OvU+s3YaCYH+JFAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:19.373788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00022","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6f5de588fca20d668bfeb9f6a6b228be8e3503586ec8c3efb755231253b2a77","sha256:b32f17c46454222ec1258ed485c5192f8ff55cdf9410971229a8c53577ff968c"],"state_sha256":"55735bd27d55de399d0aa855965f0e7b7264ab17a366d2187668008076ab3a05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdcKhTOjcMUImpNmAJPbBTSbJYVYUe1ECddPKAAkcIEhw/9T6TyktMwO6FuIIojPves6fcfkMCI6gAdLchhYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:10:21.388521Z","bundle_sha256":"8a54766c2acd4df3f8dfbb07649d8e2514d670fe41e8f5751eadbd9754e311da"}}