{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:76JODAJ55RXGURAXQOZAPYIPAF","short_pith_number":"pith:76JODAJ5","schema_version":"1.0","canonical_sha256":"ff92e1813dec6e6a441783b207e10f0165c1b3f0906f2a9773ec5ff00d66166b","source":{"kind":"arxiv","id":"1901.00387","version":1},"attestation_state":"computed","paper":{"title":"Generalized Sphere-Packing Bound for Subblock-Constrained Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anshoo Tandon, Han Mao Kiah, Mehul Motani","submitted_at":"2019-01-02T14:16:32Z","abstract_excerpt":"We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the number of variables in the associated linear programming problem. In particular, we study binary constant subblock-composition codes (CSCCs), characterized by the property that the number of ones in each subblock is constant, and binary subblock energy-constrained codes (SECCs), characterized by the property that the number of ones in each subblock exceeds a certain threshold. For CSCCs, we show that the optimization prob"},"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":"1901.00387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-02T14:16:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e78a4dc6e9e52ca2c28fbfba13ff0a59237dc92118baa3c4ab55ef099b44cd98","abstract_canon_sha256":"a817eb932b966930efd5b97d7e30796fa575caa412adc7481a793b6acc376389"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:04.013953Z","signature_b64":"xUj9dt8DG8w8ihjMRR+aclTvMu/fvKTfe0GMfT3ZContcl8EiRmX5XrhvtAJoe6BhREt5pJUleaaSIpz4oqkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff92e1813dec6e6a441783b207e10f0165c1b3f0906f2a9773ec5ff00d66166b","last_reissued_at":"2026-05-17T23:57:04.013292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:04.013292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Sphere-Packing Bound for Subblock-Constrained Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anshoo Tandon, Han Mao Kiah, Mehul Motani","submitted_at":"2019-01-02T14:16:32Z","abstract_excerpt":"We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the number of variables in the associated linear programming problem. In particular, we study binary constant subblock-composition codes (CSCCs), characterized by the property that the number of ones in each subblock is constant, and binary subblock energy-constrained codes (SECCs), characterized by the property that the number of ones in each subblock exceeds a certain threshold. For CSCCs, we show that the optimization prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00387","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":"1901.00387","created_at":"2026-05-17T23:57:04.013425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00387v1","created_at":"2026-05-17T23:57:04.013425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00387","created_at":"2026-05-17T23:57:04.013425+00:00"},{"alias_kind":"pith_short_12","alias_value":"76JODAJ55RXG","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"76JODAJ55RXGURAX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"76JODAJ5","created_at":"2026-05-18T12:33:12.712433+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/76JODAJ55RXGURAXQOZAPYIPAF","json":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF.json","graph_json":"https://pith.science/api/pith-number/76JODAJ55RXGURAXQOZAPYIPAF/graph.json","events_json":"https://pith.science/api/pith-number/76JODAJ55RXGURAXQOZAPYIPAF/events.json","paper":"https://pith.science/paper/76JODAJ5"},"agent_actions":{"view_html":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF","download_json":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF.json","view_paper":"https://pith.science/paper/76JODAJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00387&json=true","fetch_graph":"https://pith.science/api/pith-number/76JODAJ55RXGURAXQOZAPYIPAF/graph.json","fetch_events":"https://pith.science/api/pith-number/76JODAJ55RXGURAXQOZAPYIPAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/action/storage_attestation","attest_author":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/action/author_attestation","sign_citation":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/action/citation_signature","submit_replication":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/action/replication_record"}},"created_at":"2026-05-17T23:57:04.013425+00:00","updated_at":"2026-05-17T23:57:04.013425+00:00"}