{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IIWNDI7RD34RNLRCYXUAE5QJNE","short_pith_number":"pith:IIWNDI7R","canonical_record":{"source":{"id":"1607.00356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-01T19:03:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c76ece058812ebfe7ff08b59a66a664d16422818422b012500fec78ca35d1c43","abstract_canon_sha256":"8b3746ce9a0a70150c06119480fbc202558048684f1c23f60f5b7807e196234c"},"schema_version":"1.0"},"canonical_sha256":"422cd1a3f11ef916ae22c5e80276096935a0439a1165306c3a509ed57e040fab","source":{"kind":"arxiv","id":"1607.00356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00356","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00356v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00356","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"IIWNDI7RD34R","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IIWNDI7RD34RNLRC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IIWNDI7R","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IIWNDI7RD34RNLRCYXUAE5QJNE","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-01T19:03:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c76ece058812ebfe7ff08b59a66a664d16422818422b012500fec78ca35d1c43","abstract_canon_sha256":"8b3746ce9a0a70150c06119480fbc202558048684f1c23f60f5b7807e196234c"},"schema_version":"1.0"},"canonical_sha256":"422cd1a3f11ef916ae22c5e80276096935a0439a1165306c3a509ed57e040fab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.619208Z","signature_b64":"hc8mGY5SUoC11SNl044+0kIRU0SJlI/M6NpmUvyC39f6Ipm3Q5yDfWaJSescssk0toJ+JDlLbdFCEGGPHokjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"422cd1a3f11ef916ae22c5e80276096935a0439a1165306c3a509ed57e040fab","last_reissued_at":"2026-05-18T01:11:37.618720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.618720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00356","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-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/PswWGfSll8XYKVFUBQnqij+OxBDicwqTiitvRE5VD3vnVWpzQeDk7HKBGyzDh2tsHn+cP7V2YyF167jNiAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:54:37.403310Z"},"content_sha256":"a3d72904a34fe94fd0222bc0f7961a1d5f58d16b8b3d1d423e57a2fd80950e65","schema_version":"1.0","event_id":"sha256:a3d72904a34fe94fd0222bc0f7961a1d5f58d16b8b3d1d423e57a2fd80950e65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IIWNDI7RD34RNLRCYXUAE5QJNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of Robust, Protograph Based LDPC Codes for Rate-Adaptation via Probabilistic Shaping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabian Steiner, Patrick Schulte","submitted_at":"2016-07-01T19:03:09Z","abstract_excerpt":"In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\\\"ocherer et al. has been introduced for capacity approaching and rate-adaptive communication with a bitwise-demapper and binary decoder. Previous work by the authors considered the optimization of protograph based LDPC codes for PAS and specific spectral efficiencies (SEs) to jointly optimize the LDPC code node degrees and the mapping of the coded bits to the bit-interleaved coded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00356","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-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNNgAUC6fes0TyQ0dxvVyJcn2IL05LKwdrtpvyXYBZTqLgBBIurMyKIPJRa8g5iYP7k3WvZoBOpdADO8QXodBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:54:37.403911Z"},"content_sha256":"1921f47d2af22f3826d1ab46b7d04be6858d4dd7ea53f0f5b5c99c4e362dd715","schema_version":"1.0","event_id":"sha256:1921f47d2af22f3826d1ab46b7d04be6858d4dd7ea53f0f5b5c99c4e362dd715"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIWNDI7RD34RNLRCYXUAE5QJNE/bundle.json","state_url":"https://pith.science/pith/IIWNDI7RD34RNLRCYXUAE5QJNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIWNDI7RD34RNLRCYXUAE5QJNE/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-06-04T20:54:37Z","links":{"resolver":"https://pith.science/pith/IIWNDI7RD34RNLRCYXUAE5QJNE","bundle":"https://pith.science/pith/IIWNDI7RD34RNLRCYXUAE5QJNE/bundle.json","state":"https://pith.science/pith/IIWNDI7RD34RNLRCYXUAE5QJNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIWNDI7RD34RNLRCYXUAE5QJNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IIWNDI7RD34RNLRCYXUAE5QJNE","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":"8b3746ce9a0a70150c06119480fbc202558048684f1c23f60f5b7807e196234c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-01T19:03:09Z","title_canon_sha256":"c76ece058812ebfe7ff08b59a66a664d16422818422b012500fec78ca35d1c43"},"schema_version":"1.0","source":{"id":"1607.00356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00356","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00356v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00356","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"IIWNDI7RD34R","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IIWNDI7RD34RNLRC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IIWNDI7R","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:1921f47d2af22f3826d1ab46b7d04be6858d4dd7ea53f0f5b5c99c4e362dd715","target":"graph","created_at":"2026-05-18T01:11:37Z","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":"In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\\\"ocherer et al. has been introduced for capacity approaching and rate-adaptive communication with a bitwise-demapper and binary decoder. Previous work by the authors considered the optimization of protograph based LDPC codes for PAS and specific spectral efficiencies (SEs) to jointly optimize the LDPC code node degrees and the mapping of the coded bits to the bit-interleaved coded","authors_text":"Fabian Steiner, Patrick Schulte","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-01T19:03:09Z","title":"Design of Robust, Protograph Based LDPC Codes for Rate-Adaptation via Probabilistic Shaping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00356","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:a3d72904a34fe94fd0222bc0f7961a1d5f58d16b8b3d1d423e57a2fd80950e65","target":"record","created_at":"2026-05-18T01:11:37Z","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":"8b3746ce9a0a70150c06119480fbc202558048684f1c23f60f5b7807e196234c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-01T19:03:09Z","title_canon_sha256":"c76ece058812ebfe7ff08b59a66a664d16422818422b012500fec78ca35d1c43"},"schema_version":"1.0","source":{"id":"1607.00356","kind":"arxiv","version":1}},"canonical_sha256":"422cd1a3f11ef916ae22c5e80276096935a0439a1165306c3a509ed57e040fab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"422cd1a3f11ef916ae22c5e80276096935a0439a1165306c3a509ed57e040fab","first_computed_at":"2026-05-18T01:11:37.618720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:37.618720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hc8mGY5SUoC11SNl044+0kIRU0SJlI/M6NpmUvyC39f6Ipm3Q5yDfWaJSescssk0toJ+JDlLbdFCEGGPHokjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:37.619208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3d72904a34fe94fd0222bc0f7961a1d5f58d16b8b3d1d423e57a2fd80950e65","sha256:1921f47d2af22f3826d1ab46b7d04be6858d4dd7ea53f0f5b5c99c4e362dd715"],"state_sha256":"b09afdfdb63687e3df5acf95d7fcbc8b495448925b1356a0e8e0fdd535ebb056"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ax6BbKfd1IX+kPxlzMLocdkoQJLXLN/tsLGE7wItXLMRWU9yzsbkokMkoP6UzdfqjwByT2NOtTkQKgv3p0BXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:54:37.407633Z","bundle_sha256":"5598854cc135772b51d43e5046858f1347eeec969d045ad8c48d790fa8a40815"}}