{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EZ44WM3EGWUBC3ZPOLAIZICJHM","short_pith_number":"pith:EZ44WM3E","schema_version":"1.0","canonical_sha256":"2679cb336435a8116f2f72c08ca0493b24abd852977a819d0e0c88ed6a73c5e0","source":{"kind":"arxiv","id":"1310.5061","version":1},"attestation_state":"computed","paper":{"title":"On dual toric complete intersection codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.AG","authors_text":"Ivan Soprunov, Pinar Celebi Demirarslan","submitted_at":"2013-10-18T15:41:22Z","abstract_excerpt":"In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be quasi-self-dual. In the case of d=2 it reduces to a combinatorial condition on the Newton polygons. This allows us to give an explicit construction of dual and quasi-self-dual toric complete intersection codes. We provide a list of examples over the field of 16 elements."},"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":"1310.5061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-10-18T15:41:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"037a9310cb5ee2e9bd8c6ff0c939a7da2ad7b3c593c37828bc8794b375c8bfaf","abstract_canon_sha256":"71a1653e2cd49bafada50a0756603ad8cc7fb0c1b6eff0d50b60fd6925ed17b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:15.847615Z","signature_b64":"A5NKuuBKPXQLVf6xg6RqBWFxb+tWNZlsE28HW9qjD4JGxAZcKNbpd14OMH3KnrFu6tgU2YD6Mo2p2h5QRPd6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2679cb336435a8116f2f72c08ca0493b24abd852977a819d0e0c88ed6a73c5e0","last_reissued_at":"2026-05-18T02:30:15.847070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:15.847070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On dual toric complete intersection codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.AG","authors_text":"Ivan Soprunov, Pinar Celebi Demirarslan","submitted_at":"2013-10-18T15:41:22Z","abstract_excerpt":"In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be quasi-self-dual. In the case of d=2 it reduces to a combinatorial condition on the Newton polygons. This allows us to give an explicit construction of dual and quasi-self-dual toric complete intersection codes. We provide a list of examples over the field of 16 elements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5061","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":"1310.5061","created_at":"2026-05-18T02:30:15.847153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5061v1","created_at":"2026-05-18T02:30:15.847153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5061","created_at":"2026-05-18T02:30:15.847153+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ44WM3EGWUB","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ44WM3EGWUBC3ZP","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ44WM3E","created_at":"2026-05-18T12:27:43.054852+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/EZ44WM3EGWUBC3ZPOLAIZICJHM","json":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM.json","graph_json":"https://pith.science/api/pith-number/EZ44WM3EGWUBC3ZPOLAIZICJHM/graph.json","events_json":"https://pith.science/api/pith-number/EZ44WM3EGWUBC3ZPOLAIZICJHM/events.json","paper":"https://pith.science/paper/EZ44WM3E"},"agent_actions":{"view_html":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM","download_json":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM.json","view_paper":"https://pith.science/paper/EZ44WM3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5061&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ44WM3EGWUBC3ZPOLAIZICJHM/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ44WM3EGWUBC3ZPOLAIZICJHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM/action/storage_attestation","attest_author":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM/action/author_attestation","sign_citation":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM/action/citation_signature","submit_replication":"https://pith.science/pith/EZ44WM3EGWUBC3ZPOLAIZICJHM/action/replication_record"}},"created_at":"2026-05-18T02:30:15.847153+00:00","updated_at":"2026-05-18T02:30:15.847153+00:00"}