{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EXE3EUMUM4YOVMHA74I7APWHEM","short_pith_number":"pith:EXE3EUMU","schema_version":"1.0","canonical_sha256":"25c9b251946730eab0e0ff11f03ec723202db23da487f730275b756e93fad61b","source":{"kind":"arxiv","id":"1708.05558","version":1},"attestation_state":"computed","paper":{"title":"Ultra-Sparse Non-Binary LDPC Codes for Probabilistic Amplitude Shaping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabian Steiner, Georg B\\\"ocherer, Gianluigi Liva","submitted_at":"2017-08-18T10:45:12Z","abstract_excerpt":"This work shows how non-binary low-density parity-check codes over GF($2^p$) can be combined with probabilistic amplitude shaping (PAS) (B\\\"ocherer, et al., 2015), which combines forward-error correction with non-uniform signaling for power-efficient communication. Ultra-sparse low-density parity-check codes over GF(64) and GF(256) gain 0.6 dB in power efficiency over state-of-the-art binary LDPC codes at a spectral efficiency of 1.5 bits per channel use and a blocklength of 576 bits. The simulation results are compared to finite length coding bounds and complemented by density evolution analy"},"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":"1708.05558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T10:45:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"026127662cae7ccf9593822a36a694f6e179fc50ffb1817b76d0e14e535588c3","abstract_canon_sha256":"5e5cc5ed48fc7bce9a4bf41a0d74c929a75d20f2105bb8a7f5f55769ff41ea66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:49.717336Z","signature_b64":"8mnfypNW/tpMvmPRe3mLLIsjVUvN9j2S5k/CIM4lS2Ji8IC4Sva4HN8gZgl/6gYKbdAinZFgKPbZIZE5Y8I9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25c9b251946730eab0e0ff11f03ec723202db23da487f730275b756e93fad61b","last_reissued_at":"2026-05-18T00:37:49.716679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:49.716679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ultra-Sparse Non-Binary LDPC Codes for Probabilistic Amplitude Shaping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabian Steiner, Georg B\\\"ocherer, Gianluigi Liva","submitted_at":"2017-08-18T10:45:12Z","abstract_excerpt":"This work shows how non-binary low-density parity-check codes over GF($2^p$) can be combined with probabilistic amplitude shaping (PAS) (B\\\"ocherer, et al., 2015), which combines forward-error correction with non-uniform signaling for power-efficient communication. Ultra-sparse low-density parity-check codes over GF(64) and GF(256) gain 0.6 dB in power efficiency over state-of-the-art binary LDPC codes at a spectral efficiency of 1.5 bits per channel use and a blocklength of 576 bits. The simulation results are compared to finite length coding bounds and complemented by density evolution analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05558","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":"1708.05558","created_at":"2026-05-18T00:37:49.716774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05558v1","created_at":"2026-05-18T00:37:49.716774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05558","created_at":"2026-05-18T00:37:49.716774+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXE3EUMUM4YO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXE3EUMUM4YOVMHA","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXE3EUMU","created_at":"2026-05-18T12:31:12.930513+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/EXE3EUMUM4YOVMHA74I7APWHEM","json":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM.json","graph_json":"https://pith.science/api/pith-number/EXE3EUMUM4YOVMHA74I7APWHEM/graph.json","events_json":"https://pith.science/api/pith-number/EXE3EUMUM4YOVMHA74I7APWHEM/events.json","paper":"https://pith.science/paper/EXE3EUMU"},"agent_actions":{"view_html":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM","download_json":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM.json","view_paper":"https://pith.science/paper/EXE3EUMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05558&json=true","fetch_graph":"https://pith.science/api/pith-number/EXE3EUMUM4YOVMHA74I7APWHEM/graph.json","fetch_events":"https://pith.science/api/pith-number/EXE3EUMUM4YOVMHA74I7APWHEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM/action/storage_attestation","attest_author":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM/action/author_attestation","sign_citation":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM/action/citation_signature","submit_replication":"https://pith.science/pith/EXE3EUMUM4YOVMHA74I7APWHEM/action/replication_record"}},"created_at":"2026-05-18T00:37:49.716774+00:00","updated_at":"2026-05-18T00:37:49.716774+00:00"}