{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:22FYGQPX3JPRN7TH5PZWM2WD4Z","short_pith_number":"pith:22FYGQPX","schema_version":"1.0","canonical_sha256":"d68b8341f7da5f16fe67ebf3666ac3e671b3c000dd9c637dc255055d3f8cb51d","source":{"kind":"arxiv","id":"1707.05877","version":1},"attestation_state":"computed","paper":{"title":"Improved rank bounds from 2-descent on hyperelliptic Jacobians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Brendan Creutz","submitted_at":"2017-07-18T22:00:49Z","abstract_excerpt":"We describe a qualitative improvement to the algorithms for performing 2-descents to obtain information regarding the Mordell-Weil rank of a hyperelliptic Jacobian. The improvement has been implemented in the Magma Computational Algebra System and as a result, the rank bounds for hyperelliptic Jacobians are now sharper and have the conjectured parity."},"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":"1707.05877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-07-18T22:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"2f40eec3c0f1bc1963c6cae1e131a8954de8faa5d1d140d58bb2e242e36ec114","abstract_canon_sha256":"c4ffb911726317680a3d093a6d5688de25a0d79cf7a368e2e606745f6a4f48d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:59.072480Z","signature_b64":"vgmeDPeR5axW3fjlVkpFrSO5Wd5pqlGR7S7koEopFqBugPpoUilsGomJlP2GS/7mhT3Q57VnADImT1TjeJcVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d68b8341f7da5f16fe67ebf3666ac3e671b3c000dd9c637dc255055d3f8cb51d","last_reissued_at":"2026-05-18T00:39:59.072051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:59.072051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved rank bounds from 2-descent on hyperelliptic Jacobians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Brendan Creutz","submitted_at":"2017-07-18T22:00:49Z","abstract_excerpt":"We describe a qualitative improvement to the algorithms for performing 2-descents to obtain information regarding the Mordell-Weil rank of a hyperelliptic Jacobian. The improvement has been implemented in the Magma Computational Algebra System and as a result, the rank bounds for hyperelliptic Jacobians are now sharper and have the conjectured parity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05877","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.05877","created_at":"2026-05-18T00:39:59.072115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05877v1","created_at":"2026-05-18T00:39:59.072115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05877","created_at":"2026-05-18T00:39:59.072115+00:00"},{"alias_kind":"pith_short_12","alias_value":"22FYGQPX3JPR","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"22FYGQPX3JPRN7TH","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"22FYGQPX","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z","json":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z.json","graph_json":"https://pith.science/api/pith-number/22FYGQPX3JPRN7TH5PZWM2WD4Z/graph.json","events_json":"https://pith.science/api/pith-number/22FYGQPX3JPRN7TH5PZWM2WD4Z/events.json","paper":"https://pith.science/paper/22FYGQPX"},"agent_actions":{"view_html":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z","download_json":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z.json","view_paper":"https://pith.science/paper/22FYGQPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05877&json=true","fetch_graph":"https://pith.science/api/pith-number/22FYGQPX3JPRN7TH5PZWM2WD4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/22FYGQPX3JPRN7TH5PZWM2WD4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z/action/storage_attestation","attest_author":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z/action/author_attestation","sign_citation":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z/action/citation_signature","submit_replication":"https://pith.science/pith/22FYGQPX3JPRN7TH5PZWM2WD4Z/action/replication_record"}},"created_at":"2026-05-18T00:39:59.072115+00:00","updated_at":"2026-05-18T00:39:59.072115+00:00"}