{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5NPLNSXICYBJZS5PNI5OHFMRJK","short_pith_number":"pith:5NPLNSXI","schema_version":"1.0","canonical_sha256":"eb5eb6cae816029ccbaf6a3ae395914aba5e88377c799800ae34262db96996ce","source":{"kind":"arxiv","id":"1903.02255","version":1},"attestation_state":"computed","paper":{"title":"Linear Programming Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Danyo Danev, Peter Boyvalenkov","submitted_at":"2019-03-06T09:16:13Z","abstract_excerpt":"This chapter is written for the forthcoming book \"A Concise Encyclopedia of Coding Theory\" (CRC press), edited by W. Cary Huffman, Jon-Lark Kim, and Patrick Sol\\'e. This book will collect short but foundational articles, emphasizing definitions, examples, exhaustive references, and basic facts. The target audience of the Encyclopedia is upper level undergraduates and graduate students."},"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":"1903.02255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-06T09:16:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80b83de917f7f551720e11c1654cbff9282668055ae57734aee89c4884cd72ad","abstract_canon_sha256":"5a4c33a3d3488f953e177df829750386ac8ee719954253fc43dcc1458f899a10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:56.376687Z","signature_b64":"LoKOLzljoLnl8ypsqa1zXu0ywImi7IjKqsMGrObS6KOogwvopVJXn/JChc6CEpu73u6/LnF/R7INW126B9PCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb5eb6cae816029ccbaf6a3ae395914aba5e88377c799800ae34262db96996ce","last_reissued_at":"2026-05-17T23:51:56.376274Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:56.376274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Danyo Danev, Peter Boyvalenkov","submitted_at":"2019-03-06T09:16:13Z","abstract_excerpt":"This chapter is written for the forthcoming book \"A Concise Encyclopedia of Coding Theory\" (CRC press), edited by W. Cary Huffman, Jon-Lark Kim, and Patrick Sol\\'e. This book will collect short but foundational articles, emphasizing definitions, examples, exhaustive references, and basic facts. The target audience of the Encyclopedia is upper level undergraduates and graduate students."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02255","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":"1903.02255","created_at":"2026-05-17T23:51:56.376344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02255v1","created_at":"2026-05-17T23:51:56.376344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02255","created_at":"2026-05-17T23:51:56.376344+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NPLNSXICYBJ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NPLNSXICYBJZS5P","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NPLNSXI","created_at":"2026-05-18T12:33:10.108867+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/5NPLNSXICYBJZS5PNI5OHFMRJK","json":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK.json","graph_json":"https://pith.science/api/pith-number/5NPLNSXICYBJZS5PNI5OHFMRJK/graph.json","events_json":"https://pith.science/api/pith-number/5NPLNSXICYBJZS5PNI5OHFMRJK/events.json","paper":"https://pith.science/paper/5NPLNSXI"},"agent_actions":{"view_html":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK","download_json":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK.json","view_paper":"https://pith.science/paper/5NPLNSXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02255&json=true","fetch_graph":"https://pith.science/api/pith-number/5NPLNSXICYBJZS5PNI5OHFMRJK/graph.json","fetch_events":"https://pith.science/api/pith-number/5NPLNSXICYBJZS5PNI5OHFMRJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK/action/storage_attestation","attest_author":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK/action/author_attestation","sign_citation":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK/action/citation_signature","submit_replication":"https://pith.science/pith/5NPLNSXICYBJZS5PNI5OHFMRJK/action/replication_record"}},"created_at":"2026-05-17T23:51:56.376344+00:00","updated_at":"2026-05-17T23:51:56.376344+00:00"}