{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:UFKTNYBQNLHR6S4K2LUIU67CZY","short_pith_number":"pith:UFKTNYBQ","schema_version":"1.0","canonical_sha256":"a15536e0306acf1f4b8ad2e88a7be2ce0f357f1faf477a32ee4934a41e2c5b59","source":{"kind":"arxiv","id":"cs/0512025","version":2},"attestation_state":"computed","paper":{"title":"Spectral approach to linear programming bounds on codes","license":"","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Dmitry Nogin","submitted_at":"2005-12-06T04:36:39Z","abstract_excerpt":"We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal polynomials. The examples of the method considered in the paper include binary codes, binary constant-weight codes, spherical codes, and codes in the projective spaces."},"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":"cs/0512025","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-12-06T04:36:39Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"64005ce1b3e85f9058c6844ca3d2afadf0fd08e6f38ae33b8bd00f93ab9a63fe","abstract_canon_sha256":"d598fa3b3cbf4694b8db173c1a84c0d0981abee2fa0ce5c6c50012277b1b19f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:22.319481Z","signature_b64":"WVdEeGyTJPjLOGt5cxmaIL86r2iGKGxbOn2w7HTPMz0WhUo+mqUvC7bZp9wDQk4lMJ2foLb1mbjccBw8lwKzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a15536e0306acf1f4b8ad2e88a7be2ce0f357f1faf477a32ee4934a41e2c5b59","last_reissued_at":"2026-05-17T23:46:22.318855Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:22.318855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral approach to linear programming bounds on codes","license":"","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Dmitry Nogin","submitted_at":"2005-12-06T04:36:39Z","abstract_excerpt":"We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal polynomials. The examples of the method considered in the paper include binary codes, binary constant-weight codes, spherical codes, and codes in the projective spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512025","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":"cs/0512025","created_at":"2026-05-17T23:46:22.318973+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512025v2","created_at":"2026-05-17T23:46:22.318973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512025","created_at":"2026-05-17T23:46:22.318973+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFKTNYBQNLHR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFKTNYBQNLHR6S4K","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFKTNYBQ","created_at":"2026-05-18T12:25:53.939244+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/UFKTNYBQNLHR6S4K2LUIU67CZY","json":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY.json","graph_json":"https://pith.science/api/pith-number/UFKTNYBQNLHR6S4K2LUIU67CZY/graph.json","events_json":"https://pith.science/api/pith-number/UFKTNYBQNLHR6S4K2LUIU67CZY/events.json","paper":"https://pith.science/paper/UFKTNYBQ"},"agent_actions":{"view_html":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY","download_json":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY.json","view_paper":"https://pith.science/paper/UFKTNYBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512025&json=true","fetch_graph":"https://pith.science/api/pith-number/UFKTNYBQNLHR6S4K2LUIU67CZY/graph.json","fetch_events":"https://pith.science/api/pith-number/UFKTNYBQNLHR6S4K2LUIU67CZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY/action/storage_attestation","attest_author":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY/action/author_attestation","sign_citation":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY/action/citation_signature","submit_replication":"https://pith.science/pith/UFKTNYBQNLHR6S4K2LUIU67CZY/action/replication_record"}},"created_at":"2026-05-17T23:46:22.318973+00:00","updated_at":"2026-05-17T23:46:22.318973+00:00"}