{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LGZDR45P63TRQ3R25VZS2KRMU5","short_pith_number":"pith:LGZDR45P","schema_version":"1.0","canonical_sha256":"59b238f3aff6e7186e3aed732d2a2ca74aa1fcb521d5feb1779437cc6ed90a06","source":{"kind":"arxiv","id":"1611.04341","version":1},"attestation_state":"computed","paper":{"title":"Counting generalized Reed-Solomon codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"David Glynn, Krishna Kaipa, Peter Beelen, Tom H{\\o}holdt","submitted_at":"2016-11-14T11:24:49Z","abstract_excerpt":"In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of 3-dimensional MDS codes of length n=6,7,8,9."},"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":"1611.04341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-14T11:24:49Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"1b28d3b149ffe2b5d0d9a5742efa2f4a36581f5d765bd45dee3a13ee3bc1345f","abstract_canon_sha256":"555eeac880a74249b8a8aea3418c95a63739ca7d70134f86894ef0e809549566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:16.890156Z","signature_b64":"RPOfEFNqY+gng1rFrxbE8uqX5vGq47mhXKrW8uA/70We+E6fsInEQjn8Ec0Ek02dim0/md8rJzRYywG0gvlkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59b238f3aff6e7186e3aed732d2a2ca74aa1fcb521d5feb1779437cc6ed90a06","last_reissued_at":"2026-05-18T00:59:16.889477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:16.889477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting generalized Reed-Solomon codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"David Glynn, Krishna Kaipa, Peter Beelen, Tom H{\\o}holdt","submitted_at":"2016-11-14T11:24:49Z","abstract_excerpt":"In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of 3-dimensional MDS codes of length n=6,7,8,9."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04341","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":"1611.04341","created_at":"2026-05-18T00:59:16.889592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04341v1","created_at":"2026-05-18T00:59:16.889592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04341","created_at":"2026-05-18T00:59:16.889592+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGZDR45P63TR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGZDR45P63TRQ3R2","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGZDR45P","created_at":"2026-05-18T12:30:29.479603+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/LGZDR45P63TRQ3R25VZS2KRMU5","json":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5.json","graph_json":"https://pith.science/api/pith-number/LGZDR45P63TRQ3R25VZS2KRMU5/graph.json","events_json":"https://pith.science/api/pith-number/LGZDR45P63TRQ3R25VZS2KRMU5/events.json","paper":"https://pith.science/paper/LGZDR45P"},"agent_actions":{"view_html":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5","download_json":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5.json","view_paper":"https://pith.science/paper/LGZDR45P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04341&json=true","fetch_graph":"https://pith.science/api/pith-number/LGZDR45P63TRQ3R25VZS2KRMU5/graph.json","fetch_events":"https://pith.science/api/pith-number/LGZDR45P63TRQ3R25VZS2KRMU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5/action/storage_attestation","attest_author":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5/action/author_attestation","sign_citation":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5/action/citation_signature","submit_replication":"https://pith.science/pith/LGZDR45P63TRQ3R25VZS2KRMU5/action/replication_record"}},"created_at":"2026-05-18T00:59:16.889592+00:00","updated_at":"2026-05-18T00:59:16.889592+00:00"}