{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:76JODAJ55RXGURAXQOZAPYIPAF","short_pith_number":"pith:76JODAJ5","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"},"canonical_sha256":"ff92e1813dec6e6a441783b207e10f0165c1b3f0906f2a9773ec5ff00d66166b","source":{"kind":"arxiv","id":"1901.00387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00387","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00387v1","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00387","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"pith_short_12","alias_value":"76JODAJ55RXG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"76JODAJ55RXGURAX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"76JODAJ5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:76JODAJ55RXGURAXQOZAPYIPAF","target":"record","payload":{"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"},"canonical_sha256":"ff92e1813dec6e6a441783b207e10f0165c1b3f0906f2a9773ec5ff00d66166b","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"},"source_kind":"arxiv","source_id":"1901.00387","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-17T23:57:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePv6A2qaZMw2aXFrGU7Fkab4J1HFUMWLO0EuOxQcSjuF0f89EwM4pmq3DfVtDzrenl/KxVdmtxOpG4twdC9fCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:37.016540Z"},"content_sha256":"879cfa34ca8435383f014c51c5056f96fc0717e30dd5d818263ccfb852a6d5a9","schema_version":"1.0","event_id":"sha256:879cfa34ca8435383f014c51c5056f96fc0717e30dd5d818263ccfb852a6d5a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:76JODAJ55RXGURAXQOZAPYIPAF","target":"graph","payload":{"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"},"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-17T23:57:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SKeRoaOGvBoeje54EckZhWDJ2W/J6qbIpGEWOFC5A4VggvLB4U6sWtB+KP3r/1vaO4gd6O04KUqJFAxriXE4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:37.016895Z"},"content_sha256":"908b7a409eeaabd5639516fb05c179f9cc029848ee81005728859ab69120e06f","schema_version":"1.0","event_id":"sha256:908b7a409eeaabd5639516fb05c179f9cc029848ee81005728859ab69120e06f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/bundle.json","state_url":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76JODAJ55RXGURAXQOZAPYIPAF/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-31T01:17:37Z","links":{"resolver":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF","bundle":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/bundle.json","state":"https://pith.science/pith/76JODAJ55RXGURAXQOZAPYIPAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76JODAJ55RXGURAXQOZAPYIPAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:76JODAJ55RXGURAXQOZAPYIPAF","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":"a817eb932b966930efd5b97d7e30796fa575caa412adc7481a793b6acc376389","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-02T14:16:32Z","title_canon_sha256":"e78a4dc6e9e52ca2c28fbfba13ff0a59237dc92118baa3c4ab55ef099b44cd98"},"schema_version":"1.0","source":{"id":"1901.00387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00387","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00387v1","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00387","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"pith_short_12","alias_value":"76JODAJ55RXG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"76JODAJ55RXGURAX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"76JODAJ5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:908b7a409eeaabd5639516fb05c179f9cc029848ee81005728859ab69120e06f","target":"graph","created_at":"2026-05-17T23:57:04Z","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":"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","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":"2019-01-02T14:16:32Z","title":"Generalized Sphere-Packing Bound for Subblock-Constrained Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00387","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:879cfa34ca8435383f014c51c5056f96fc0717e30dd5d818263ccfb852a6d5a9","target":"record","created_at":"2026-05-17T23:57:04Z","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":"a817eb932b966930efd5b97d7e30796fa575caa412adc7481a793b6acc376389","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-02T14:16:32Z","title_canon_sha256":"e78a4dc6e9e52ca2c28fbfba13ff0a59237dc92118baa3c4ab55ef099b44cd98"},"schema_version":"1.0","source":{"id":"1901.00387","kind":"arxiv","version":1}},"canonical_sha256":"ff92e1813dec6e6a441783b207e10f0165c1b3f0906f2a9773ec5ff00d66166b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff92e1813dec6e6a441783b207e10f0165c1b3f0906f2a9773ec5ff00d66166b","first_computed_at":"2026-05-17T23:57:04.013292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:04.013292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xUj9dt8DG8w8ihjMRR+aclTvMu/fvKTfe0GMfT3ZContcl8EiRmX5XrhvtAJoe6BhREt5pJUleaaSIpz4oqkAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:04.013953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:879cfa34ca8435383f014c51c5056f96fc0717e30dd5d818263ccfb852a6d5a9","sha256:908b7a409eeaabd5639516fb05c179f9cc029848ee81005728859ab69120e06f"],"state_sha256":"cb97fe05b05e20b90aa32d87c6069e5d01c1e4c2ada86b217ee2cb8ad86c7b4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iOGXCB+1ivZ0G2xMD5J/d4Xe1//AJV6xUnv6GhfBI67GZF05AFVPndvmE87EWbKOUBI0BMkt0JOSKWckS1aAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:17:37.019090Z","bundle_sha256":"2c286521520745e81025389b24cc6696cff0b74994f42a13f1c88dfd12c0b340"}}