{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DKIE5CXUMJM5CUS7XJ2J4CSDAZ","short_pith_number":"pith:DKIE5CXU","schema_version":"1.0","canonical_sha256":"1a904e8af46259d1525fba749e0a43066c169b4f44aad312f7610b8345355e18","source":{"kind":"arxiv","id":"1801.06971","version":1},"attestation_state":"computed","paper":{"title":"New code upper bounds for the folded n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Hou, Lihang Hou, Suogang Gao, Wei-Hsuan Yu","submitted_at":"2018-01-22T06:47:53Z","abstract_excerpt":"Let $\\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\\Gamma,d)$. Let $\\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\\square_n,d)$ based on block-diagonalizing the Terwilliger algebra of $\\square_n$ and on semidefinite programming.The technique of this paper is an extension of the approach taken by A. Schrijver \\cite{s} on the study of $A(H(n,2),d)$."},"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":"1801.06971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T06:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"5aa98942eaa27e98a10561337455075ed084b06504d6a7d4bd48923dc602a498","abstract_canon_sha256":"f879e7460a8848eb90d50cc72593ed9781620bd32346e057a850027a34cef516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:22.652666Z","signature_b64":"LIDEQ/0aaUYlz6qs3sh2pF13cniH6cOg5y/YG6U8LAURNVTtOsRoNXkUPF+Omx0Ji/ElTSUqcuoFMX9rGo9lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a904e8af46259d1525fba749e0a43066c169b4f44aad312f7610b8345355e18","last_reissued_at":"2026-05-18T00:25:22.652096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:22.652096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New code upper bounds for the folded n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Hou, Lihang Hou, Suogang Gao, Wei-Hsuan Yu","submitted_at":"2018-01-22T06:47:53Z","abstract_excerpt":"Let $\\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\\Gamma,d)$. Let $\\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\\square_n,d)$ based on block-diagonalizing the Terwilliger algebra of $\\square_n$ and on semidefinite programming.The technique of this paper is an extension of the approach taken by A. Schrijver \\cite{s} on the study of $A(H(n,2),d)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06971","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":"1801.06971","created_at":"2026-05-18T00:25:22.652172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06971v1","created_at":"2026-05-18T00:25:22.652172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06971","created_at":"2026-05-18T00:25:22.652172+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKIE5CXUMJM5","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKIE5CXUMJM5CUS7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKIE5CXU","created_at":"2026-05-18T12:32:19.392346+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/DKIE5CXUMJM5CUS7XJ2J4CSDAZ","json":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ.json","graph_json":"https://pith.science/api/pith-number/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/graph.json","events_json":"https://pith.science/api/pith-number/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/events.json","paper":"https://pith.science/paper/DKIE5CXU"},"agent_actions":{"view_html":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ","download_json":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ.json","view_paper":"https://pith.science/paper/DKIE5CXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06971&json=true","fetch_graph":"https://pith.science/api/pith-number/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/action/storage_attestation","attest_author":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/action/author_attestation","sign_citation":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/action/citation_signature","submit_replication":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/action/replication_record"}},"created_at":"2026-05-18T00:25:22.652172+00:00","updated_at":"2026-05-18T00:25:22.652172+00:00"}