{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3BR5EWGOK5DIUO2AYINEAMXO2C","short_pith_number":"pith:3BR5EWGO","canonical_record":{"source":{"id":"1103.6149","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-31T11:58:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"266ba9c0b5771ad04562a625f782930985b959c8b3c4f68fea866572d00c23c9","abstract_canon_sha256":"9b86ed8efe88221d3a21e3a23c1557576155407d145e9fa491d5f5207ba78e55"},"schema_version":"1.0"},"canonical_sha256":"d863d258ce57468a3b40c21a4032eed0b3c671e8615d6c27c20cff71c2bc95ea","source":{"kind":"arxiv","id":"1103.6149","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.6149","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1103.6149v3","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6149","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"3BR5EWGOK5DI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3BR5EWGOK5DIUO2A","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3BR5EWGO","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3BR5EWGOK5DIUO2AYINEAMXO2C","target":"record","payload":{"canonical_record":{"source":{"id":"1103.6149","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-31T11:58:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"266ba9c0b5771ad04562a625f782930985b959c8b3c4f68fea866572d00c23c9","abstract_canon_sha256":"9b86ed8efe88221d3a21e3a23c1557576155407d145e9fa491d5f5207ba78e55"},"schema_version":"1.0"},"canonical_sha256":"d863d258ce57468a3b40c21a4032eed0b3c671e8615d6c27c20cff71c2bc95ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:14.416997Z","signature_b64":"sjcdGwL7O+zdQUKIv5hvs29xhAH2wOJMvBdIdKK+8ztZan0gNC4FaopxAn/DBPfLWDUJXdXXhsiMSpNgoy7hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d863d258ce57468a3b40c21a4032eed0b3c671e8615d6c27c20cff71c2bc95ea","last_reissued_at":"2026-05-18T03:35:14.416231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:14.416231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.6149","source_version":3,"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-18T03:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+473YXEgg9zvMh4KOqTXuogVYGnO9XVuxE2YYCCNYiUro4wvc231bN53i3Xx0g2F9r01RkWOFJoValIJw25JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:04:44.886137Z"},"content_sha256":"e36dab3fa72841d1120cb675b9ea5602836ede2c5ae3308cf91840786cbafdbd","schema_version":"1.0","event_id":"sha256:e36dab3fa72841d1120cb675b9ea5602836ede2c5ae3308cf91840786cbafdbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3BR5EWGOK5DIUO2AYINEAMXO2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Untainted Puncturing for Irregular Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Elkouss, Jesus Martinez-Mateo, Vicente Martin","submitted_at":"2011-03-31T11:58:00Z","abstract_excerpt":"Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6149","kind":"arxiv","version":3},"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-18T03:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9kzDMrSUMGvNH/hSbH6H97NIxvEZmy8kBaAx2aILDAfA4SmOY7o61AuxH7EGRXYlnirlnTlUr4/uomFOZhEGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:04:44.886710Z"},"content_sha256":"69295cf51c236f406e8d03b94ca8d3541d93a4ca6ec763e967ba64321ad25e59","schema_version":"1.0","event_id":"sha256:69295cf51c236f406e8d03b94ca8d3541d93a4ca6ec763e967ba64321ad25e59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BR5EWGOK5DIUO2AYINEAMXO2C/bundle.json","state_url":"https://pith.science/pith/3BR5EWGOK5DIUO2AYINEAMXO2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BR5EWGOK5DIUO2AYINEAMXO2C/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-07T11:04:44Z","links":{"resolver":"https://pith.science/pith/3BR5EWGOK5DIUO2AYINEAMXO2C","bundle":"https://pith.science/pith/3BR5EWGOK5DIUO2AYINEAMXO2C/bundle.json","state":"https://pith.science/pith/3BR5EWGOK5DIUO2AYINEAMXO2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BR5EWGOK5DIUO2AYINEAMXO2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3BR5EWGOK5DIUO2AYINEAMXO2C","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":"9b86ed8efe88221d3a21e3a23c1557576155407d145e9fa491d5f5207ba78e55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-31T11:58:00Z","title_canon_sha256":"266ba9c0b5771ad04562a625f782930985b959c8b3c4f68fea866572d00c23c9"},"schema_version":"1.0","source":{"id":"1103.6149","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.6149","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1103.6149v3","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6149","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"3BR5EWGOK5DI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3BR5EWGOK5DIUO2A","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3BR5EWGO","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:69295cf51c236f406e8d03b94ca8d3541d93a4ca6ec763e967ba64321ad25e59","target":"graph","created_at":"2026-05-18T03:35:14Z","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":"Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.","authors_text":"David Elkouss, Jesus Martinez-Mateo, Vicente Martin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-31T11:58:00Z","title":"Untainted Puncturing for Irregular Low-Density Parity-Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6149","kind":"arxiv","version":3},"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:e36dab3fa72841d1120cb675b9ea5602836ede2c5ae3308cf91840786cbafdbd","target":"record","created_at":"2026-05-18T03:35:14Z","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":"9b86ed8efe88221d3a21e3a23c1557576155407d145e9fa491d5f5207ba78e55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-31T11:58:00Z","title_canon_sha256":"266ba9c0b5771ad04562a625f782930985b959c8b3c4f68fea866572d00c23c9"},"schema_version":"1.0","source":{"id":"1103.6149","kind":"arxiv","version":3}},"canonical_sha256":"d863d258ce57468a3b40c21a4032eed0b3c671e8615d6c27c20cff71c2bc95ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d863d258ce57468a3b40c21a4032eed0b3c671e8615d6c27c20cff71c2bc95ea","first_computed_at":"2026-05-18T03:35:14.416231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:14.416231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sjcdGwL7O+zdQUKIv5hvs29xhAH2wOJMvBdIdKK+8ztZan0gNC4FaopxAn/DBPfLWDUJXdXXhsiMSpNgoy7hAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:14.416997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.6149","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e36dab3fa72841d1120cb675b9ea5602836ede2c5ae3308cf91840786cbafdbd","sha256:69295cf51c236f406e8d03b94ca8d3541d93a4ca6ec763e967ba64321ad25e59"],"state_sha256":"78f31e387e6d37d68916507c64659a019635518dc87adc32cb93e969317e5ade"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGt6o4LzcJugr/XQIR7Xw8k5N3Ywk5ASTEOva7KqgLy2z1DUdSG9NF9rXWzOVs4mWGACSJ7ynBk+pB0fxebbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:04:44.889662Z","bundle_sha256":"b44b22609dbb9c20f25044c7f1b53b81381238cdf4cbefe216c09f28facd94d2"}}