{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FWPFQGPYOEA45TPIYKTELMWNBZ","short_pith_number":"pith:FWPFQGPY","schema_version":"1.0","canonical_sha256":"2d9e5819f87101cecde8c2a645b2cd0e551621024b6cdb0f63e37e08812c4b7c","source":{"kind":"arxiv","id":"1801.10607","version":1},"attestation_state":"computed","paper":{"title":"Hypercube Packings and Coverings with Higher Dimensional Rooks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Stoner, Mehtaab Sawhney","submitted_at":"2018-01-31T18:55:06Z","abstract_excerpt":"We introduce a generalization of classical $q$-ary codes by allowing points to cover other points that are Hamming distance $1$ or $2$ in a freely chosen subset of all directions. More specifically, we generalize the notion of $1$-covering, $1$-packing, and $2$-packing in the case of $q$-ary codes. In the covering case, we establish the analog of the sphere-packing bound and in the packing case, we establish an analog of the singleton bound. Given these analogs, in the covering case we establish that the sphere-packing bound is asymptotically never tight except in trivial cases. This is in ess"},"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.10607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-31T18:55:06Z","cross_cats_sorted":[],"title_canon_sha256":"3b9fe8a5a4f5c043f012f67a48df41a41b8ff9e248dcc3071a5a532b6421c631","abstract_canon_sha256":"54abd2725e8774d0c2106a6c17876e9483539897567bc48dbf22ce6f18f097ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:40.369485Z","signature_b64":"SF8UyUPEx+Tja1bOAXnDgCM2gqUESl/8ftdVHPeE/DpT8sS20S5iGfFRHGz2clxPPbnBaltxGPE3o0h7MDrADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d9e5819f87101cecde8c2a645b2cd0e551621024b6cdb0f63e37e08812c4b7c","last_reissued_at":"2026-05-18T00:24:40.368858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:40.368858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypercube Packings and Coverings with Higher Dimensional Rooks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Stoner, Mehtaab Sawhney","submitted_at":"2018-01-31T18:55:06Z","abstract_excerpt":"We introduce a generalization of classical $q$-ary codes by allowing points to cover other points that are Hamming distance $1$ or $2$ in a freely chosen subset of all directions. More specifically, we generalize the notion of $1$-covering, $1$-packing, and $2$-packing in the case of $q$-ary codes. In the covering case, we establish the analog of the sphere-packing bound and in the packing case, we establish an analog of the singleton bound. Given these analogs, in the covering case we establish that the sphere-packing bound is asymptotically never tight except in trivial cases. This is in ess"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10607","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.10607","created_at":"2026-05-18T00:24:40.368950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10607v1","created_at":"2026-05-18T00:24:40.368950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10607","created_at":"2026-05-18T00:24:40.368950+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWPFQGPYOEA4","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWPFQGPYOEA45TPI","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWPFQGPY","created_at":"2026-05-18T12:32:25.280505+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/FWPFQGPYOEA45TPIYKTELMWNBZ","json":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ.json","graph_json":"https://pith.science/api/pith-number/FWPFQGPYOEA45TPIYKTELMWNBZ/graph.json","events_json":"https://pith.science/api/pith-number/FWPFQGPYOEA45TPIYKTELMWNBZ/events.json","paper":"https://pith.science/paper/FWPFQGPY"},"agent_actions":{"view_html":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ","download_json":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ.json","view_paper":"https://pith.science/paper/FWPFQGPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10607&json=true","fetch_graph":"https://pith.science/api/pith-number/FWPFQGPYOEA45TPIYKTELMWNBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FWPFQGPYOEA45TPIYKTELMWNBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ/action/storage_attestation","attest_author":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ/action/author_attestation","sign_citation":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ/action/citation_signature","submit_replication":"https://pith.science/pith/FWPFQGPYOEA45TPIYKTELMWNBZ/action/replication_record"}},"created_at":"2026-05-18T00:24:40.368950+00:00","updated_at":"2026-05-18T00:24:40.368950+00:00"}