{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W4FO6QUL3RBG57Y2VZJELB5OVJ","short_pith_number":"pith:W4FO6QUL","schema_version":"1.0","canonical_sha256":"b70aef428bdc426eff1aae524587aeaa5e7eac06e7fc1832f36232e0cd754b97","source":{"kind":"arxiv","id":"1606.03159","version":1},"attestation_state":"computed","paper":{"title":"Self-inversive polynomials, curves, and codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CV","authors_text":"David Joyner, Tony Shaska","submitted_at":"2016-06-10T02:19:02Z","abstract_excerpt":"We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\\mathcal X$ is a superelliptic curve defined over $\\mathbb C$ and its reduced automorphism group is nontrivial or not isomorphic to a cyclic group, then we can write its equation as $y^n = f(x)$ or $y^n = x f(x)$, where $f(x)$ is a self-inversive or self-reciprocal polynomial. Moreover, we state a conjecture on the coefficients of the zeta polynomial of extremal formally self-dual codes."},"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":"1606.03159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CV","submitted_at":"2016-06-10T02:19:02Z","cross_cats_sorted":[],"title_canon_sha256":"b73e41e4fbfeab860241fceb4ba34cabe28122c30a253ce0b8c686f564db48bb","abstract_canon_sha256":"437a6c025ae77398ec3036d7f98ea632a217de1440f960583a7f1d06e4a79f91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:48.693567Z","signature_b64":"EPGRb1B/q6aSfRWGXuVEEKIKUstiQ2st0RmLZb/GrlicM/Hy49V1/sJo9gjzMjYZ+PPgSW/hzEaIhx3DcVxhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b70aef428bdc426eff1aae524587aeaa5e7eac06e7fc1832f36232e0cd754b97","last_reissued_at":"2026-05-17T23:44:48.692770Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:48.692770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-inversive polynomials, curves, and codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CV","authors_text":"David Joyner, Tony Shaska","submitted_at":"2016-06-10T02:19:02Z","abstract_excerpt":"We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\\mathcal X$ is a superelliptic curve defined over $\\mathbb C$ and its reduced automorphism group is nontrivial or not isomorphic to a cyclic group, then we can write its equation as $y^n = f(x)$ or $y^n = x f(x)$, where $f(x)$ is a self-inversive or self-reciprocal polynomial. Moreover, we state a conjecture on the coefficients of the zeta polynomial of extremal formally self-dual codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03159","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":"1606.03159","created_at":"2026-05-17T23:44:48.692912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03159v1","created_at":"2026-05-17T23:44:48.692912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03159","created_at":"2026-05-17T23:44:48.692912+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4FO6QUL3RBG","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4FO6QUL3RBG57Y2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4FO6QUL","created_at":"2026-05-18T12:30:48.956258+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/W4FO6QUL3RBG57Y2VZJELB5OVJ","json":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ.json","graph_json":"https://pith.science/api/pith-number/W4FO6QUL3RBG57Y2VZJELB5OVJ/graph.json","events_json":"https://pith.science/api/pith-number/W4FO6QUL3RBG57Y2VZJELB5OVJ/events.json","paper":"https://pith.science/paper/W4FO6QUL"},"agent_actions":{"view_html":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ","download_json":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ.json","view_paper":"https://pith.science/paper/W4FO6QUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03159&json=true","fetch_graph":"https://pith.science/api/pith-number/W4FO6QUL3RBG57Y2VZJELB5OVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/W4FO6QUL3RBG57Y2VZJELB5OVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ/action/storage_attestation","attest_author":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ/action/author_attestation","sign_citation":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ/action/citation_signature","submit_replication":"https://pith.science/pith/W4FO6QUL3RBG57Y2VZJELB5OVJ/action/replication_record"}},"created_at":"2026-05-17T23:44:48.692912+00:00","updated_at":"2026-05-17T23:44:48.692912+00:00"}