{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GSRYWRGD77E4BHSDVYE5M5QOHM","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":"5d54f47cd271f81da7d4f098dd3f860133fa5010125358056420bc8495f36b89","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2026-07-18T19:46:54Z","title_canon_sha256":"911545a707bb4282b97d44091aae80a94f9db2aed2485268bc45a8355dd13140"},"schema_version":"1.0","source":{"id":"2607.16945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16945","created_at":"2026-07-21T01:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16945v1","created_at":"2026-07-21T01:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16945","created_at":"2026-07-21T01:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"GSRYWRGD77E4","created_at":"2026-07-21T01:21:07Z"},{"alias_kind":"pith_short_16","alias_value":"GSRYWRGD77E4BHSD","created_at":"2026-07-21T01:21:07Z"},{"alias_kind":"pith_short_8","alias_value":"GSRYWRGD","created_at":"2026-07-21T01:21:07Z"}],"graph_snapshots":[{"event_id":"sha256:a4d13d4e6f2397f300d51aa3b451cd58015be03678babe298959d49011df67d1","target":"graph","created_at":"2026-07-21T01:21:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.16945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study algebraic geometry codes on hyperelliptic curves of genus $g \\geq 2$ with complementarity properties. Our first contribution is a characterization of non-special divisors of degree $g$ and $g-1$ via the polynomial degrees of their reduced Mumford representation, reducing a classical hard geometric problem to a single-degree test on univariate polynomials. Using this, we construct Linear Complementary Pairs (LCP) of codes via polynomial arithmetic on the Jacobian and provide a criterion in terms of Mumford degrees for the resulting codes to be Maximum Distance Separable (MDS). Under a ","authors_text":"Adler Marques, Saeed Tafazolian, Yuri da Silva","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2026-07-18T19:46:54Z","title":"Explicit LCP of MDS Codes and LCD Codes on Hyperelliptic Curves via Mumford Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16945","kind":"arxiv","version":1},"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:d3926556283088ecdaec315961fdddf943e1e71e2c512a4da26cfc171c274ce5","target":"record","created_at":"2026-07-21T01:21:07Z","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":"5d54f47cd271f81da7d4f098dd3f860133fa5010125358056420bc8495f36b89","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2026-07-18T19:46:54Z","title_canon_sha256":"911545a707bb4282b97d44091aae80a94f9db2aed2485268bc45a8355dd13140"},"schema_version":"1.0","source":{"id":"2607.16945","kind":"arxiv","version":1}},"canonical_sha256":"34a38b44c3ffc9c09e43ae09d6760e3b0c6dbc16a4ed465464f83133a581cee3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a38b44c3ffc9c09e43ae09d6760e3b0c6dbc16a4ed465464f83133a581cee3","first_computed_at":"2026-07-21T01:21:07.625821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:07.625821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1EU1KU5N3IeAjfI+iIseaQAHig9vJEGKSRUkzEEzhbjLsNndgqm5ZD3QigaKwbklnYnzBqluFc11A47I/HKAg==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:07.626664Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.16945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3926556283088ecdaec315961fdddf943e1e71e2c512a4da26cfc171c274ce5","sha256:a4d13d4e6f2397f300d51aa3b451cd58015be03678babe298959d49011df67d1"],"state_sha256":"bee452b1dd7e17ef418f56bc3e2b997dc52b19bc9e324b404940360113242dfd"}