{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DKIE5CXUMJM5CUS7XJ2J4CSDAZ","short_pith_number":"pith:DKIE5CXU","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"},"canonical_sha256":"1a904e8af46259d1525fba749e0a43066c169b4f44aad312f7610b8345355e18","source":{"kind":"arxiv","id":"1801.06971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06971","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06971v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06971","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"DKIE5CXUMJM5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DKIE5CXUMJM5CUS7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DKIE5CXU","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DKIE5CXUMJM5CUS7XJ2J4CSDAZ","target":"record","payload":{"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"},"canonical_sha256":"1a904e8af46259d1525fba749e0a43066c169b4f44aad312f7610b8345355e18","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"},"source_kind":"arxiv","source_id":"1801.06971","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QaN4xscabbus/150RLSBT7NAKxj7uUGi2la5L/wMyTwSoHoCHMuMCeJz0N9pT7vimy3V4AJDrc7L3QwWeGNaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:20.683613Z"},"content_sha256":"235fb9f5a4ab663835fbcca44aef95d5c07b9c0c80e6a7d1dddf95c636bee14a","schema_version":"1.0","event_id":"sha256:235fb9f5a4ab663835fbcca44aef95d5c07b9c0c80e6a7d1dddf95c636bee14a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DKIE5CXUMJM5CUS7XJ2J4CSDAZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjSbtIzcl1TQFRpLHPQYvgXDCDArQ4jSPZSTumLwL8leacwLYy+oQKWo/41Xu+MtsFOjX4snSqYleJHxU9fHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:20.684262Z"},"content_sha256":"4226365cb6c8c2cbea2c7e6c2c062ef3848b4eadb2cf014699d1655149127e23","schema_version":"1.0","event_id":"sha256:4226365cb6c8c2cbea2c7e6c2c062ef3848b4eadb2cf014699d1655149127e23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/bundle.json","state_url":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T16:14:20Z","links":{"resolver":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ","bundle":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/bundle.json","state":"https://pith.science/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKIE5CXUMJM5CUS7XJ2J4CSDAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DKIE5CXUMJM5CUS7XJ2J4CSDAZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f879e7460a8848eb90d50cc72593ed9781620bd32346e057a850027a34cef516","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T06:47:53Z","title_canon_sha256":"5aa98942eaa27e98a10561337455075ed084b06504d6a7d4bd48923dc602a498"},"schema_version":"1.0","source":{"id":"1801.06971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06971","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06971v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06971","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"DKIE5CXUMJM5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DKIE5CXUMJM5CUS7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DKIE5CXU","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:4226365cb6c8c2cbea2c7e6c2c062ef3848b4eadb2cf014699d1655149127e23","target":"graph","created_at":"2026-05-18T00:25:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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)$.","authors_text":"Bo Hou, Lihang Hou, Suogang Gao, Wei-Hsuan Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T06:47:53Z","title":"New code upper bounds for the folded n-cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06971","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:235fb9f5a4ab663835fbcca44aef95d5c07b9c0c80e6a7d1dddf95c636bee14a","target":"record","created_at":"2026-05-18T00:25:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f879e7460a8848eb90d50cc72593ed9781620bd32346e057a850027a34cef516","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T06:47:53Z","title_canon_sha256":"5aa98942eaa27e98a10561337455075ed084b06504d6a7d4bd48923dc602a498"},"schema_version":"1.0","source":{"id":"1801.06971","kind":"arxiv","version":1}},"canonical_sha256":"1a904e8af46259d1525fba749e0a43066c169b4f44aad312f7610b8345355e18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a904e8af46259d1525fba749e0a43066c169b4f44aad312f7610b8345355e18","first_computed_at":"2026-05-18T00:25:22.652096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:22.652096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LIDEQ/0aaUYlz6qs3sh2pF13cniH6cOg5y/YG6U8LAURNVTtOsRoNXkUPF+Omx0Ji/ElTSUqcuoFMX9rGo9lCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:22.652666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:235fb9f5a4ab663835fbcca44aef95d5c07b9c0c80e6a7d1dddf95c636bee14a","sha256:4226365cb6c8c2cbea2c7e6c2c062ef3848b4eadb2cf014699d1655149127e23"],"state_sha256":"00e02a025904614164c7acddb830d03621647e6eede7bf793e73084b4a6f9e03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oxpe1RKvEGetFQDGuO+SKHN1aM1V/FSxEWeqs9zVQEXSilq9nj4dJVk5HrKFO10ItKc8pauYyj35s7DgQQdYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:14:20.687910Z","bundle_sha256":"e5f2d48673a6f5144fcb93870cf1f867f973ce7a666779c9b417156405091ab7"}}