{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2SJI2A7FUZHU7WK33XKJXCWZRG","short_pith_number":"pith:2SJI2A7F","schema_version":"1.0","canonical_sha256":"d4928d03e5a64f4fd95bddd49b8ad989a753ca8e1a74af555c096c4b4d4db5c9","source":{"kind":"arxiv","id":"2403.17250","version":3},"attestation_state":"computed","paper":{"title":"Machine learning for moduli space of genus two curves and an application to isogeny based cryptography","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.AG","authors_text":"Elira Shaska, Tony Shaska","submitted_at":"2024-03-25T22:52:50Z","abstract_excerpt":"We use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli points with small weighted moduli height and $(n, n)$-split Jacobian for $n=2, 3, 5$. We computational prove that there are only 34 genus two curves (resp. 44 curves) with (2,2)-split Jacobians (resp. (3,3)-split Jacobians) and weighted moduli height $\\leq 3$.\n  We discuss different machine learning models for such applications and demonstrate the ability to d"},"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":"2403.17250","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.AG","submitted_at":"2024-03-25T22:52:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"ba1de64adfa8648e62c8771bca67779cf04f9c80474f1ba94f3dabbdae1e4982","abstract_canon_sha256":"beacb16bacf5aa8b195d63c9af14101b2bdc54ab6b8e4e7d2b1a812f2a6dff19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:11.021424Z","signature_b64":"yzs75XGfrkhL31w6dO39HoaV6oGISbmz/NMUyhlaIvuMq5vZeqCp5ftXTEhcErfjYkByDNUngdyJviCB3ChDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4928d03e5a64f4fd95bddd49b8ad989a753ca8e1a74af555c096c4b4d4db5c9","last_reissued_at":"2026-07-05T10:20:11.020980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:11.020980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine learning for moduli space of genus two curves and an application to isogeny based cryptography","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.AG","authors_text":"Elira Shaska, Tony Shaska","submitted_at":"2024-03-25T22:52:50Z","abstract_excerpt":"We use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli points with small weighted moduli height and $(n, n)$-split Jacobian for $n=2, 3, 5$. We computational prove that there are only 34 genus two curves (resp. 44 curves) with (2,2)-split Jacobians (resp. (3,3)-split Jacobians) and weighted moduli height $\\leq 3$.\n  We discuss different machine learning models for such applications and demonstrate the ability to d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17250","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.17250/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.17250","created_at":"2026-07-05T10:20:11.021033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.17250v3","created_at":"2026-07-05T10:20:11.021033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17250","created_at":"2026-07-05T10:20:11.021033+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SJI2A7FUZHU","created_at":"2026-07-05T10:20:11.021033+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SJI2A7FUZHU7WK3","created_at":"2026-07-05T10:20:11.021033+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SJI2A7F","created_at":"2026-07-05T10:20:11.021033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.12978","citing_title":"Galois groups of polynomials and neurosymbolic networks","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG","json":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG.json","graph_json":"https://pith.science/api/pith-number/2SJI2A7FUZHU7WK33XKJXCWZRG/graph.json","events_json":"https://pith.science/api/pith-number/2SJI2A7FUZHU7WK33XKJXCWZRG/events.json","paper":"https://pith.science/paper/2SJI2A7F"},"agent_actions":{"view_html":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG","download_json":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG.json","view_paper":"https://pith.science/paper/2SJI2A7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.17250&json=true","fetch_graph":"https://pith.science/api/pith-number/2SJI2A7FUZHU7WK33XKJXCWZRG/graph.json","fetch_events":"https://pith.science/api/pith-number/2SJI2A7FUZHU7WK33XKJXCWZRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG/action/storage_attestation","attest_author":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG/action/author_attestation","sign_citation":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG/action/citation_signature","submit_replication":"https://pith.science/pith/2SJI2A7FUZHU7WK33XKJXCWZRG/action/replication_record"}},"created_at":"2026-07-05T10:20:11.021033+00:00","updated_at":"2026-07-05T10:20:11.021033+00:00"}