{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BGSB6EGFXAOJYT2KTA6TPCH7JD","short_pith_number":"pith:BGSB6EGF","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"},"canonical_sha256":"09a41f10c5b81c9c4f4a983d3788ff48d5a1ae47eefc263f4ef160f3b6738d48","source":{"kind":"arxiv","id":"1701.04954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04954","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04954v1","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04954","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"BGSB6EGFXAOJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BGSB6EGFXAOJYT2K","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BGSB6EGF","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BGSB6EGFXAOJYT2KTA6TPCH7JD","target":"record","payload":{"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"},"canonical_sha256":"09a41f10c5b81c9c4f4a983d3788ff48d5a1ae47eefc263f4ef160f3b6738d48","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"},"source_kind":"arxiv","source_id":"1701.04954","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iSJTmkswvwXURX4k5jObwsgzCtQyF1EvilYCEwh7QhvMF/9fTu3CgCmXbEabxVuqgZAxep8Hqy1JTzXqlVRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:17:19.282923Z"},"content_sha256":"02cdad99a750ab1266f926da359e0d5092a31be7f825903f638850f42dc1a2c3","schema_version":"1.0","event_id":"sha256:02cdad99a750ab1266f926da359e0d5092a31be7f825903f638850f42dc1a2c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BGSB6EGFXAOJYT2KTA6TPCH7JD","target":"graph","payload":{"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"},"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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbc6oFgLn3BBDi01x7Gyio50k+pGMkdLa4YrjphBvICMvJCey0t642kSJLhwJNzSU+FRs0T59B2uYeGBAYVnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:17:19.283602Z"},"content_sha256":"5663c0127c28a9605d7117d45dee6a613a4d542f4586c6e0ed5f5ad23d9c3e75","schema_version":"1.0","event_id":"sha256:5663c0127c28a9605d7117d45dee6a613a4d542f4586c6e0ed5f5ad23d9c3e75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/bundle.json","state_url":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/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-05-30T18:17:19Z","links":{"resolver":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD","bundle":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/bundle.json","state":"https://pith.science/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGSB6EGFXAOJYT2KTA6TPCH7JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BGSB6EGFXAOJYT2KTA6TPCH7JD","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":"f1f8ea6b4713f14fec5878757f1bc8966bd8a67f2e250b1bb7e846d295221a99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T05:41:58Z","title_canon_sha256":"8ce4817da5d3836ae174b2d59e9e3ed454d9986f49a58ff01374fe3e5cf84638"},"schema_version":"1.0","source":{"id":"1701.04954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04954","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04954v1","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04954","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"BGSB6EGFXAOJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BGSB6EGFXAOJYT2K","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BGSB6EGF","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:5663c0127c28a9605d7117d45dee6a613a4d542f4586c6e0ed5f5ad23d9c3e75","target":"graph","created_at":"2026-05-18T00:52:33Z","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":"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","authors_text":"Anshoo Tandon, Han Mao Kiah, Mehul Motani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T05:41:58Z","title":"Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04954","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:02cdad99a750ab1266f926da359e0d5092a31be7f825903f638850f42dc1a2c3","target":"record","created_at":"2026-05-18T00:52:33Z","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":"f1f8ea6b4713f14fec5878757f1bc8966bd8a67f2e250b1bb7e846d295221a99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T05:41:58Z","title_canon_sha256":"8ce4817da5d3836ae174b2d59e9e3ed454d9986f49a58ff01374fe3e5cf84638"},"schema_version":"1.0","source":{"id":"1701.04954","kind":"arxiv","version":1}},"canonical_sha256":"09a41f10c5b81c9c4f4a983d3788ff48d5a1ae47eefc263f4ef160f3b6738d48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09a41f10c5b81c9c4f4a983d3788ff48d5a1ae47eefc263f4ef160f3b6738d48","first_computed_at":"2026-05-18T00:52:33.451076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:33.451076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h5dsM15SsRGF0mslYP63u1uPn8x4yy9CUsfhdGwVNAKgCoVTkoZxU/bgtVIZlY7Kuq3dRELUADAj6yol/QDRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:33.451642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02cdad99a750ab1266f926da359e0d5092a31be7f825903f638850f42dc1a2c3","sha256:5663c0127c28a9605d7117d45dee6a613a4d542f4586c6e0ed5f5ad23d9c3e75"],"state_sha256":"99fc3f3e316b5d1e0e30c996162d1a3875da50abf965c7095e015e5941513ee4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+dx7iRe5PBcTxWBZdNXtS4Rty6kiKutcderDaPBQXPh6M6Y0vmzPeS+AOtt3Cw8zsLP/+dra4ZIzMMsKeOGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:17:19.287104Z","bundle_sha256":"8e1a81c862c4b188a70b52fa2c1d09889b119446f4d5d4cfbd0bf1b4dd63e856"}}