{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R5I7KZ42ZJXBNM3XEFO226AAKH","short_pith_number":"pith:R5I7KZ42","canonical_record":{"source":{"id":"1504.03628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-14T17:03:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"16ace8b6040b482a673c37ae4cdbddabed0a4f29af785e55b08cc24016eaf85b","abstract_canon_sha256":"a064431552b1786d074728c636a539925f728853c29dfbfaba2f98c81904c28f"},"schema_version":"1.0"},"canonical_sha256":"8f51f5679aca6e16b377215dad780051c2d5aa88f3f4e74b55f05fdfc9dde529","source":{"kind":"arxiv","id":"1504.03628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03628","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03628v1","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03628","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"R5I7KZ42ZJXB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5I7KZ42ZJXBNM3X","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5I7KZ42","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R5I7KZ42ZJXBNM3XEFO226AAKH","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-14T17:03:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"16ace8b6040b482a673c37ae4cdbddabed0a4f29af785e55b08cc24016eaf85b","abstract_canon_sha256":"a064431552b1786d074728c636a539925f728853c29dfbfaba2f98c81904c28f"},"schema_version":"1.0"},"canonical_sha256":"8f51f5679aca6e16b377215dad780051c2d5aa88f3f4e74b55f05fdfc9dde529","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:50.341596Z","signature_b64":"/eU1oFpr4wLmZoGISiklpbrkSbJbDLLhrJoyOVoNNA27TD5HZ0upzdPRNvv4ur2mhhhKzF7+RNUceVIz4QLVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f51f5679aca6e16b377215dad780051c2d5aa88f3f4e74b55f05fdfc9dde529","last_reissued_at":"2026-05-18T02:18:50.340828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:50.340828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03628","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-18T02:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMXOOr7x5c4brI7uCigGcshlhgShWQ1L8Ip1vpWMrp+wRpX9DZNt9b99r17VDFC/sXexbuydc+EIRCEGvzoEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:25:12.454870Z"},"content_sha256":"f6532fd4443bb86445368df76f135d19c8c7a6080b2162c06f1a48a5843c443f","schema_version":"1.0","event_id":"sha256:f6532fd4443bb86445368df76f135d19c8c7a6080b2162c06f1a48a5843c443f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R5I7KZ42ZJXBNM3XEFO226AAKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Protograph-Based LDPC Code Design for Shaped Bit-Metric Decoding","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":"2015-04-14T17:03:55Z","abstract_excerpt":"A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the bit-interleaved coded modulation (BICM) bit-channels. For BICM with uniform input and for BICM with probabilistic shaping, binary-input symmetric-output surrogate channels for the code design are used. The constructed codes for uniform inputs perform as good as the multi-edge type codes of Zhang and Kschischang (2013). For 8-ASK and 64-ASK with probabilistic shaping, cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03628","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-18T02:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJb+Cug6oC+n+XHtlDO3acTYQrq0aipcSi2YXGX4LIt2f8e4lz+bKqpNpHSfv9Qs/HuwG1jTSa4PCVbi6KabDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:25:12.455238Z"},"content_sha256":"efd1cedf45a3b56bd839b4c6692afe0aebb877adfc5006c5fd2662f7d683f547","schema_version":"1.0","event_id":"sha256:efd1cedf45a3b56bd839b4c6692afe0aebb877adfc5006c5fd2662f7d683f547"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5I7KZ42ZJXBNM3XEFO226AAKH/bundle.json","state_url":"https://pith.science/pith/R5I7KZ42ZJXBNM3XEFO226AAKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5I7KZ42ZJXBNM3XEFO226AAKH/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-04T16:25:12Z","links":{"resolver":"https://pith.science/pith/R5I7KZ42ZJXBNM3XEFO226AAKH","bundle":"https://pith.science/pith/R5I7KZ42ZJXBNM3XEFO226AAKH/bundle.json","state":"https://pith.science/pith/R5I7KZ42ZJXBNM3XEFO226AAKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5I7KZ42ZJXBNM3XEFO226AAKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R5I7KZ42ZJXBNM3XEFO226AAKH","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":"a064431552b1786d074728c636a539925f728853c29dfbfaba2f98c81904c28f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-14T17:03:55Z","title_canon_sha256":"16ace8b6040b482a673c37ae4cdbddabed0a4f29af785e55b08cc24016eaf85b"},"schema_version":"1.0","source":{"id":"1504.03628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03628","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03628v1","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03628","created_at":"2026-05-18T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"R5I7KZ42ZJXB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5I7KZ42ZJXBNM3X","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5I7KZ42","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:efd1cedf45a3b56bd839b4c6692afe0aebb877adfc5006c5fd2662f7d683f547","target":"graph","created_at":"2026-05-18T02:18:50Z","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":"A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the bit-interleaved coded modulation (BICM) bit-channels. For BICM with uniform input and for BICM with probabilistic shaping, binary-input symmetric-output surrogate channels for the code design are used. The constructed codes for uniform inputs perform as good as the multi-edge type codes of Zhang and Kschischang (2013). For 8-ASK and 64-ASK with probabilistic shaping, cod","authors_text":"Fabian Steiner, Georg B\\\"ocherer, Gianluigi Liva","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-14T17:03:55Z","title":"Protograph-Based LDPC Code Design for Shaped Bit-Metric Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03628","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:f6532fd4443bb86445368df76f135d19c8c7a6080b2162c06f1a48a5843c443f","target":"record","created_at":"2026-05-18T02:18:50Z","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":"a064431552b1786d074728c636a539925f728853c29dfbfaba2f98c81904c28f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-14T17:03:55Z","title_canon_sha256":"16ace8b6040b482a673c37ae4cdbddabed0a4f29af785e55b08cc24016eaf85b"},"schema_version":"1.0","source":{"id":"1504.03628","kind":"arxiv","version":1}},"canonical_sha256":"8f51f5679aca6e16b377215dad780051c2d5aa88f3f4e74b55f05fdfc9dde529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f51f5679aca6e16b377215dad780051c2d5aa88f3f4e74b55f05fdfc9dde529","first_computed_at":"2026-05-18T02:18:50.340828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:50.340828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/eU1oFpr4wLmZoGISiklpbrkSbJbDLLhrJoyOVoNNA27TD5HZ0upzdPRNvv4ur2mhhhKzF7+RNUceVIz4QLVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:50.341596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6532fd4443bb86445368df76f135d19c8c7a6080b2162c06f1a48a5843c443f","sha256:efd1cedf45a3b56bd839b4c6692afe0aebb877adfc5006c5fd2662f7d683f547"],"state_sha256":"f82395c233dd445060e38b4853de1c0d1853b4f32928b68f7ec53f9d8ef6fe58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GR6K7Lc9B4FiggziVyAgoFkOPaq3g4qBWai229pYAOum9i1Mvzy9Jch+Xxv+s6AGJg1Aw7YRQ/BSCTHWUVWFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:25:12.457261Z","bundle_sha256":"13abf0354343f1d6702155fa9f3867c161d441c0dc9afd9d91839daf5b8c09af"}}