{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:I7NP2SCMFX4FX4AE6VZ26IRAI6","short_pith_number":"pith:I7NP2SCM","schema_version":"1.0","canonical_sha256":"47dafd484c2df85bf004f573af222047b6b89c91324e899e4a2b118e440789a5","source":{"kind":"arxiv","id":"2005.02945","version":1},"attestation_state":"computed","paper":{"title":"New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sven Polak","submitted_at":"2020-05-06T16:27:14Z","abstract_excerpt":"In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity.\n  1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory.\n  2. We apply the symmetry reduction to efficiently compute semidefinite programming upper bounds for nonbinary error-correcting codes equipped with the Hamming distance (joint work with Bart Litjens and Lex Schrijver), with the Lee distance and for binary constant weight codes.\n  3. We explore other methods to find new upper bounds for nonbinary codes with the Hamming di"},"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":"2005.02945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-06T16:27:14Z","cross_cats_sorted":[],"title_canon_sha256":"cc4d83b0095fb315c7adbe06a7f087cffe92f7c24a5abf74691e3e26d1a8a6a6","abstract_canon_sha256":"0fa1342e6e7611901d86cdb1561bc714cc325a1474f38ee46104b87200a4b862"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:00:57.571791Z","signature_b64":"FVK2qem0V6FBlPXP2WTn8ruhCll/4YHbbnQGdYdVelQ+u2vY5PAW0zNbzHjKR1hTbO7ah/bghFWsM4ygtgRpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47dafd484c2df85bf004f573af222047b6b89c91324e899e4a2b118e440789a5","last_reissued_at":"2026-07-05T01:00:57.570522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:00:57.570522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sven Polak","submitted_at":"2020-05-06T16:27:14Z","abstract_excerpt":"In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity.\n  1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory.\n  2. We apply the symmetry reduction to efficiently compute semidefinite programming upper bounds for nonbinary error-correcting codes equipped with the Hamming distance (joint work with Bart Litjens and Lex Schrijver), with the Lee distance and for binary constant weight codes.\n  3. We explore other methods to find new upper bounds for nonbinary codes with the Hamming di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.02945","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.02945/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.02945","created_at":"2026-07-05T01:00:57.571383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.02945v1","created_at":"2026-07-05T01:00:57.571383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.02945","created_at":"2026-07-05T01:00:57.571383+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7NP2SCMFX4F","created_at":"2026-07-05T01:00:57.571383+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7NP2SCMFX4FX4AE","created_at":"2026-07-05T01:00:57.571383+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7NP2SCM","created_at":"2026-07-05T01:00:57.571383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2308.15884","citing_title":"Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6","json":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6.json","graph_json":"https://pith.science/api/pith-number/I7NP2SCMFX4FX4AE6VZ26IRAI6/graph.json","events_json":"https://pith.science/api/pith-number/I7NP2SCMFX4FX4AE6VZ26IRAI6/events.json","paper":"https://pith.science/paper/I7NP2SCM"},"agent_actions":{"view_html":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6","download_json":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6.json","view_paper":"https://pith.science/paper/I7NP2SCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.02945&json=true","fetch_graph":"https://pith.science/api/pith-number/I7NP2SCMFX4FX4AE6VZ26IRAI6/graph.json","fetch_events":"https://pith.science/api/pith-number/I7NP2SCMFX4FX4AE6VZ26IRAI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6/action/storage_attestation","attest_author":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6/action/author_attestation","sign_citation":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6/action/citation_signature","submit_replication":"https://pith.science/pith/I7NP2SCMFX4FX4AE6VZ26IRAI6/action/replication_record"}},"created_at":"2026-07-05T01:00:57.571383+00:00","updated_at":"2026-07-05T01:00:57.571383+00:00"}