{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:DWMIDBYZN6TOULJC6GFODHPPNR","short_pith_number":"pith:DWMIDBYZ","schema_version":"1.0","canonical_sha256":"1d988187196fa6ea2d22f18ae19def6c5c3308f3ffc698d8966bf3b514b155fe","source":{"kind":"arxiv","id":"math/0507598","version":2},"attestation_state":"computed","paper":{"title":"Toric surface codes and Minkowski sums","license":"","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Hal Schenck, John Little","submitted_at":"2005-07-28T20:16:06Z","abstract_excerpt":"Toric codes are evaluation codes obtained from an integral convex polytope $P \\subset \\R^n$ and finite field $\\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner. In this paper, we obtain upper and lower bounds on the minimum distance of a toric code constructed from a polygon $P \\subset \\R^2$ by examining Minkowski sum decompositions of subpolygons of $P$. Our results give a simple and unifying explanation of bounds of Hansen and empirical results of Joyner; they also apply to previously unknown cases."},"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":"math/0507598","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.AG","submitted_at":"2005-07-28T20:16:06Z","cross_cats_sorted":[],"title_canon_sha256":"f95cb2d1701784e6a9d998e88df3b2fee68471595b4810edc880f8cc9f833d63","abstract_canon_sha256":"35f7f804849e3c9e8bd913f6aede4ef1aa1bd5a3c412c57b417316a9c8a831f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:32.930575Z","signature_b64":"3ws1iOVGA19xdl4A7yQeWimdxtgP/4KBKSXgD0v8vmsvO1HySBXTVdpc3z1dv/9DqZS0RGAf2/LsjQfaGcYoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d988187196fa6ea2d22f18ae19def6c5c3308f3ffc698d8966bf3b514b155fe","last_reissued_at":"2026-05-18T04:03:32.929905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:32.929905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toric surface codes and Minkowski sums","license":"","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Hal Schenck, John Little","submitted_at":"2005-07-28T20:16:06Z","abstract_excerpt":"Toric codes are evaluation codes obtained from an integral convex polytope $P \\subset \\R^n$ and finite field $\\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner. In this paper, we obtain upper and lower bounds on the minimum distance of a toric code constructed from a polygon $P \\subset \\R^2$ by examining Minkowski sum decompositions of subpolygons of $P$. Our results give a simple and unifying explanation of bounds of Hansen and empirical results of Joyner; they also apply to previously unknown cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0507598","kind":"arxiv","version":2},"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":"math/0507598","created_at":"2026-05-18T04:03:32.930013+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0507598v2","created_at":"2026-05-18T04:03:32.930013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0507598","created_at":"2026-05-18T04:03:32.930013+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWMIDBYZN6TO","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWMIDBYZN6TOULJC","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWMIDBYZ","created_at":"2026-05-18T12:25:53.335082+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/DWMIDBYZN6TOULJC6GFODHPPNR","json":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR.json","graph_json":"https://pith.science/api/pith-number/DWMIDBYZN6TOULJC6GFODHPPNR/graph.json","events_json":"https://pith.science/api/pith-number/DWMIDBYZN6TOULJC6GFODHPPNR/events.json","paper":"https://pith.science/paper/DWMIDBYZ"},"agent_actions":{"view_html":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR","download_json":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR.json","view_paper":"https://pith.science/paper/DWMIDBYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0507598&json=true","fetch_graph":"https://pith.science/api/pith-number/DWMIDBYZN6TOULJC6GFODHPPNR/graph.json","fetch_events":"https://pith.science/api/pith-number/DWMIDBYZN6TOULJC6GFODHPPNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR/action/storage_attestation","attest_author":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR/action/author_attestation","sign_citation":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR/action/citation_signature","submit_replication":"https://pith.science/pith/DWMIDBYZN6TOULJC6GFODHPPNR/action/replication_record"}},"created_at":"2026-05-18T04:03:32.930013+00:00","updated_at":"2026-05-18T04:03:32.930013+00:00"}