{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BGSB6EGFXAOJYT2KTA6TPCH7JD","short_pith_number":"pith:BGSB6EGF","schema_version":"1.0","canonical_sha256":"09a41f10c5b81c9c4f4a983d3788ff48d5a1ae47eefc263f4ef160f3b6738d48","source":{"kind":"arxiv","id":"1701.04954","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the Size and Asymptotic Rate of 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":"2017-01-18T05:41:58Z","abstract_excerpt":"The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary constant subblock-composition codes (CSCCs), where each codeword is partitioned into equal sized subblocks, and every subblock has the same fixed weight. The second class is binary subblock energy-constrained codes (SECCs), where the weight of every subblock exceeds a given threshold. We present novel upper and lower bounds on the code sizes and asymptotic rate"},"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":"1701.04954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T05:41:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ce4817da5d3836ae174b2d59e9e3ed454d9986f49a58ff01374fe3e5cf84638","abstract_canon_sha256":"f1f8ea6b4713f14fec5878757f1bc8966bd8a67f2e250b1bb7e846d295221a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.451642Z","signature_b64":"h5dsM15SsRGF0mslYP63u1uPn8x4yy9CUsfhdGwVNAKgCoVTkoZxU/bgtVIZlY7Kuq3dRELUADAj6yol/QDRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a41f10c5b81c9c4f4a983d3788ff48d5a1ae47eefc263f4ef160f3b6738d48","last_reissued_at":"2026-05-18T00:52:33.451076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.451076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Size and Asymptotic Rate of 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":"2017-01-18T05:41:58Z","abstract_excerpt":"The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary constant subblock-composition codes (CSCCs), where each codeword is partitioned into equal sized subblocks, and every subblock has the same fixed weight. The second class is binary subblock energy-constrained codes (SECCs), where the weight of every subblock exceeds a given threshold. We present novel upper and lower bounds on the code sizes and asymptotic rate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04954","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":"1701.04954","created_at":"2026-05-18T00:52:33.451169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04954v1","created_at":"2026-05-18T00:52:33.451169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04954","created_at":"2026-05-18T00:52:33.451169+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGSB6EGFXAOJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGSB6EGFXAOJYT2K","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGSB6EGF","created_at":"2026-05-18T12:31:08.081275+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/BGSB6EGFXAOJYT2KTA6TPCH7JD","json":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD.json","graph_json":"https://pith.science/api/pith-number/BGSB6EGFXAOJYT2KTA6TPCH7JD/graph.json","events_json":"https://pith.science/api/pith-number/BGSB6EGFXAOJYT2KTA6TPCH7JD/events.json","paper":"https://pith.science/paper/BGSB6EGF"},"agent_actions":{"view_html":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD","download_json":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD.json","view_paper":"https://pith.science/paper/BGSB6EGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04954&json=true","fetch_graph":"https://pith.science/api/pith-number/BGSB6EGFXAOJYT2KTA6TPCH7JD/graph.json","fetch_events":"https://pith.science/api/pith-number/BGSB6EGFXAOJYT2KTA6TPCH7JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/action/storage_attestation","attest_author":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/action/author_attestation","sign_citation":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/action/citation_signature","submit_replication":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/action/replication_record"}},"created_at":"2026-05-18T00:52:33.451169+00:00","updated_at":"2026-05-18T00:52:33.451169+00:00"}