{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KCSL4SOLPM2LX6SDAOTNOYZBEC","short_pith_number":"pith:KCSL4SOL","schema_version":"1.0","canonical_sha256":"50a4be49cb7b34bbfa4303a6d7632120be60ff66cd8add371ac7e8585f9f568f","source":{"kind":"arxiv","id":"1510.03406","version":2},"attestation_state":"computed","paper":{"title":"Energy bounds for codes and designs in Hamming spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Douglas P. Hardin, Edward B. Saff, Maya M. Stoyanova, Peter D. Dragnev, Peter G. Boyvalenkov","submitted_at":"2015-10-12T19:38:28Z","abstract_excerpt":"We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for maximal codes."},"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":"1510.03406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2015-10-12T19:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"fe1aea776bdf1a010c7373eeafdea5dd5b2ff510357ff8630f7e967b93519e00","abstract_canon_sha256":"ada7fa5cf0387d0508cc1c095de58fe79d53cedf993d6b13d3baff1ff6484359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:13.608028Z","signature_b64":"Hkuf2Su2i3RKWbwdGU4zNGulvcAQ1a3WcGLo5z6Y9vgx4z4oCFWNMtUTIsWifDrvzVZD2NKW0LTFqNW4D182Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50a4be49cb7b34bbfa4303a6d7632120be60ff66cd8add371ac7e8585f9f568f","last_reissued_at":"2026-05-18T01:02:13.607425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:13.607425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy bounds for codes and designs in Hamming spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Douglas P. Hardin, Edward B. Saff, Maya M. Stoyanova, Peter D. Dragnev, Peter G. Boyvalenkov","submitted_at":"2015-10-12T19:38:28Z","abstract_excerpt":"We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for maximal codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03406","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":"1510.03406","created_at":"2026-05-18T01:02:13.607514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03406v2","created_at":"2026-05-18T01:02:13.607514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03406","created_at":"2026-05-18T01:02:13.607514+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCSL4SOLPM2L","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCSL4SOLPM2LX6SD","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCSL4SOL","created_at":"2026-05-18T12:29:27.538025+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/KCSL4SOLPM2LX6SDAOTNOYZBEC","json":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC.json","graph_json":"https://pith.science/api/pith-number/KCSL4SOLPM2LX6SDAOTNOYZBEC/graph.json","events_json":"https://pith.science/api/pith-number/KCSL4SOLPM2LX6SDAOTNOYZBEC/events.json","paper":"https://pith.science/paper/KCSL4SOL"},"agent_actions":{"view_html":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC","download_json":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC.json","view_paper":"https://pith.science/paper/KCSL4SOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03406&json=true","fetch_graph":"https://pith.science/api/pith-number/KCSL4SOLPM2LX6SDAOTNOYZBEC/graph.json","fetch_events":"https://pith.science/api/pith-number/KCSL4SOLPM2LX6SDAOTNOYZBEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC/action/storage_attestation","attest_author":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC/action/author_attestation","sign_citation":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC/action/citation_signature","submit_replication":"https://pith.science/pith/KCSL4SOLPM2LX6SDAOTNOYZBEC/action/replication_record"}},"created_at":"2026-05-18T01:02:13.607514+00:00","updated_at":"2026-05-18T01:02:13.607514+00:00"}