{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IMY4VWH5QJJQMYI37W5UBZ4ZYB","short_pith_number":"pith:IMY4VWH5","schema_version":"1.0","canonical_sha256":"4331cad8fd825306611bfdbb40e799c07e67da989d38f9eff7bfb989ca97147d","source":{"kind":"arxiv","id":"1602.01648","version":2},"attestation_state":"computed","paper":{"title":"Uniformity Properties of Construction C","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maiara F. Bollauf, Ram Zamir","submitted_at":"2016-02-04T11:53:31Z","abstract_excerpt":"Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is the same for all the points, although the kissing number may vary. In fact, while in the single level ($L=1$) case it reduces to lattice Construction A, a multi-level Construction C is in general not a lattice. We show that the two-level ($L=2$) case is special: a two-level Construction C satisfies Forney's definition for a geometrically uniform constellation."},"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":"1602.01648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T11:53:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52a76af2c420d64713a4e2f46d40f9034a5029d958f44754662d015b6aa7ff9f","abstract_canon_sha256":"202ffbd06e9c761c9fc87355dacb23c40ba507da8178f20c4b6a5fa78a8e8b73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:22.684376Z","signature_b64":"uKlwiwglXxJQWS4LHKuCxRis6R5lU6ltPnz8h7YdpgdRZAyFfTX94Q+G1Np73Khle1N74bPr3sMe8HIVkC3jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4331cad8fd825306611bfdbb40e799c07e67da989d38f9eff7bfb989ca97147d","last_reissued_at":"2026-05-18T01:15:22.683677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:22.683677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniformity Properties of Construction C","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maiara F. Bollauf, Ram Zamir","submitted_at":"2016-02-04T11:53:31Z","abstract_excerpt":"Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is the same for all the points, although the kissing number may vary. In fact, while in the single level ($L=1$) case it reduces to lattice Construction A, a multi-level Construction C is in general not a lattice. We show that the two-level ($L=2$) case is special: a two-level Construction C satisfies Forney's definition for a geometrically uniform constellation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01648","kind":"arxiv","version":2},"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":"1602.01648","created_at":"2026-05-18T01:15:22.683796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01648v2","created_at":"2026-05-18T01:15:22.683796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01648","created_at":"2026-05-18T01:15:22.683796+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMY4VWH5QJJQ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMY4VWH5QJJQMYI3","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMY4VWH5","created_at":"2026-05-18T12:30:22.444734+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/IMY4VWH5QJJQMYI37W5UBZ4ZYB","json":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB.json","graph_json":"https://pith.science/api/pith-number/IMY4VWH5QJJQMYI37W5UBZ4ZYB/graph.json","events_json":"https://pith.science/api/pith-number/IMY4VWH5QJJQMYI37W5UBZ4ZYB/events.json","paper":"https://pith.science/paper/IMY4VWH5"},"agent_actions":{"view_html":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB","download_json":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB.json","view_paper":"https://pith.science/paper/IMY4VWH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01648&json=true","fetch_graph":"https://pith.science/api/pith-number/IMY4VWH5QJJQMYI37W5UBZ4ZYB/graph.json","fetch_events":"https://pith.science/api/pith-number/IMY4VWH5QJJQMYI37W5UBZ4ZYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB/action/storage_attestation","attest_author":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB/action/author_attestation","sign_citation":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB/action/citation_signature","submit_replication":"https://pith.science/pith/IMY4VWH5QJJQMYI37W5UBZ4ZYB/action/replication_record"}},"created_at":"2026-05-18T01:15:22.683796+00:00","updated_at":"2026-05-18T01:15:22.683796+00:00"}