{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DTMAFUVVDCLCRBPGF3GZD7BWQ3","short_pith_number":"pith:DTMAFUVV","schema_version":"1.0","canonical_sha256":"1cd802d2b518962885e62ecd91fc3686daeef80ebd337b730fb5449cb7cb9da4","source":{"kind":"arxiv","id":"2410.22714","version":2},"attestation_state":"computed","paper":{"title":"A graph-theoretic approach to computing Selmer groups of elliptic curves $y^2 = x^3 + bx$ over $\\mathbb{Q}(i)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anthony Kling, Ben Savoie","submitted_at":"2024-10-30T05:50:04Z","abstract_excerpt":"We develop a graph-theoretic algorithm to compute the $\\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\\mathbb{Q}(i)$, where $b \\in \\mathbb{Z}[i]$ and $\\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a weighted graph $G_b$, whose vertices are the odd Gaussian primes dividing $b$, and whose edge weights are determined by the quartic residue symbol between pairs of these primes. By applying our algorithm, we explicitly compute the $\\varphi$-Selmer group of $E_b$ when $b$ is a product of inert primes, and we construct several infinite families of elliptic cu"},"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":"2410.22714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-10-30T05:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"3e73f380aaf62b2f4da7a26d915fa248afa84f5384dda1e71ef63261b10d35e6","abstract_canon_sha256":"5381805cdcc28a3b3e43954ce8aa485cce2905aacc80a45b6638877912c867e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:04.993546Z","signature_b64":"QvmUGe4jvfigaIG6y/yMLMxAUnZRDgX/Dbc+cFOsm7b+X9K/UraEiPJGcPmJumY7qu0ZdLmPiaqob4o3wNRdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd802d2b518962885e62ecd91fc3686daeef80ebd337b730fb5449cb7cb9da4","last_reissued_at":"2026-07-05T11:25:04.993055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:04.993055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A graph-theoretic approach to computing Selmer groups of elliptic curves $y^2 = x^3 + bx$ over $\\mathbb{Q}(i)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anthony Kling, Ben Savoie","submitted_at":"2024-10-30T05:50:04Z","abstract_excerpt":"We develop a graph-theoretic algorithm to compute the $\\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\\mathbb{Q}(i)$, where $b \\in \\mathbb{Z}[i]$ and $\\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a weighted graph $G_b$, whose vertices are the odd Gaussian primes dividing $b$, and whose edge weights are determined by the quartic residue symbol between pairs of these primes. By applying our algorithm, we explicitly compute the $\\varphi$-Selmer group of $E_b$ when $b$ is a product of inert primes, and we construct several infinite families of elliptic cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22714","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.22714/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":"2410.22714","created_at":"2026-07-05T11:25:04.993112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.22714v2","created_at":"2026-07-05T11:25:04.993112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22714","created_at":"2026-07-05T11:25:04.993112+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTMAFUVVDCLC","created_at":"2026-07-05T11:25:04.993112+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTMAFUVVDCLCRBPG","created_at":"2026-07-05T11:25:04.993112+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTMAFUVV","created_at":"2026-07-05T11:25:04.993112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.17605","citing_title":"Infinitely many elliptic curves over $\\mathbb{Q}(i)$ with rank 2 and $j$-invariant 1728","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3","json":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3.json","graph_json":"https://pith.science/api/pith-number/DTMAFUVVDCLCRBPGF3GZD7BWQ3/graph.json","events_json":"https://pith.science/api/pith-number/DTMAFUVVDCLCRBPGF3GZD7BWQ3/events.json","paper":"https://pith.science/paper/DTMAFUVV"},"agent_actions":{"view_html":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3","download_json":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3.json","view_paper":"https://pith.science/paper/DTMAFUVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.22714&json=true","fetch_graph":"https://pith.science/api/pith-number/DTMAFUVVDCLCRBPGF3GZD7BWQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/DTMAFUVVDCLCRBPGF3GZD7BWQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3/action/storage_attestation","attest_author":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3/action/author_attestation","sign_citation":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3/action/citation_signature","submit_replication":"https://pith.science/pith/DTMAFUVVDCLCRBPGF3GZD7BWQ3/action/replication_record"}},"created_at":"2026-07-05T11:25:04.993112+00:00","updated_at":"2026-07-05T11:25:04.993112+00:00"}