{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q5CW37X4I7N6PXFXNXJZEPZWS4","short_pith_number":"pith:Q5CW37X4","schema_version":"1.0","canonical_sha256":"87456dfefc47dbe7dcb76dd3923f36970d9d0eb1e6b0d1ac982d59e33a68f086","source":{"kind":"arxiv","id":"1402.3246","version":1},"attestation_state":"computed","paper":{"title":"Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland, David Harvey","submitted_at":"2014-02-13T18:30:36Z","abstract_excerpt":"We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for N = 2^26."},"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":"1402.3246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-02-13T18:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"8524326ed1958094707a8e0aac5de003e1586c5547fba12d4056a5d515f1c217","abstract_canon_sha256":"ed64ac1f0f55aa837dd43641aa2b1b21e87896702f2c3355fc240408a3488a07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:30.786521Z","signature_b64":"uGb1ztE9fWMvzl1EhvLXOT8Ta4KZxQqPoMPToI+ug2mUZ4P7pM15s9sYCDgqumIrP7Vy3AQIVqod9EEsTSMVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87456dfefc47dbe7dcb76dd3923f36970d9d0eb1e6b0d1ac982d59e33a68f086","last_reissued_at":"2026-05-18T01:24:30.785812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:30.785812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew V. Sutherland, David Harvey","submitted_at":"2014-02-13T18:30:36Z","abstract_excerpt":"We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for N = 2^26."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3246","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":"1402.3246","created_at":"2026-05-18T01:24:30.785923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3246v1","created_at":"2026-05-18T01:24:30.785923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3246","created_at":"2026-05-18T01:24:30.785923+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5CW37X4I7N6","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5CW37X4I7N6PXFX","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5CW37X4","created_at":"2026-05-18T12:28:43.426989+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/Q5CW37X4I7N6PXFXNXJZEPZWS4","json":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4.json","graph_json":"https://pith.science/api/pith-number/Q5CW37X4I7N6PXFXNXJZEPZWS4/graph.json","events_json":"https://pith.science/api/pith-number/Q5CW37X4I7N6PXFXNXJZEPZWS4/events.json","paper":"https://pith.science/paper/Q5CW37X4"},"agent_actions":{"view_html":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4","download_json":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4.json","view_paper":"https://pith.science/paper/Q5CW37X4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3246&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5CW37X4I7N6PXFXNXJZEPZWS4/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5CW37X4I7N6PXFXNXJZEPZWS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4/action/storage_attestation","attest_author":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4/action/author_attestation","sign_citation":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4/action/citation_signature","submit_replication":"https://pith.science/pith/Q5CW37X4I7N6PXFXNXJZEPZWS4/action/replication_record"}},"created_at":"2026-05-18T01:24:30.785923+00:00","updated_at":"2026-05-18T01:24:30.785923+00:00"}