{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QD7HYUN7F75G37DV4QLHEJFGCY","short_pith_number":"pith:QD7HYUN7","canonical_record":{"source":{"id":"1401.8168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T14:13:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d479271f2be0f70b516c38d6ccaf9fd669acb4a7e252c993dae32bcec1e93f7d","abstract_canon_sha256":"c94ca79b1a9e4624650956effddde329da33c573e072ae1260bc45ca4fcf2265"},"schema_version":"1.0"},"canonical_sha256":"80fe7c51bf2ffa6dfc75e4167224a61622a64a840b0f556efdb536c9f218047b","source":{"kind":"arxiv","id":"1401.8168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8168","created_at":"2026-05-18T03:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8168v1","created_at":"2026-05-18T03:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8168","created_at":"2026-05-18T03:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"QD7HYUN7F75G","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QD7HYUN7F75G37DV","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QD7HYUN7","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QD7HYUN7F75G37DV4QLHEJFGCY","target":"record","payload":{"canonical_record":{"source":{"id":"1401.8168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T14:13:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d479271f2be0f70b516c38d6ccaf9fd669acb4a7e252c993dae32bcec1e93f7d","abstract_canon_sha256":"c94ca79b1a9e4624650956effddde329da33c573e072ae1260bc45ca4fcf2265"},"schema_version":"1.0"},"canonical_sha256":"80fe7c51bf2ffa6dfc75e4167224a61622a64a840b0f556efdb536c9f218047b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:28.034817Z","signature_b64":"KtrQf6rzchYOb/iLMroEwaEnDa5K3zcazXI2WrzI7GXGI3j4KyRm2Nopb/eaMgDwr0OTHmpu1GpmWXD2C3CACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80fe7c51bf2ffa6dfc75e4167224a61622a64a840b0f556efdb536c9f218047b","last_reissued_at":"2026-05-18T03:00:28.034202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:28.034202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.8168","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-18T03:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"faO5m1O7RTNBzciYv9HNW9rsRcSs0YofWnD5QcYX6U+Br9Af9Mbbc/3wqbVJohYWdUCEMhJM2V0cUfHh1yP9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:31:55.840720Z"},"content_sha256":"d1897fae0c720d3a884303023889631511339b90e1794972485e112567b46120","schema_version":"1.0","event_id":"sha256:d1897fae0c720d3a884303023889631511339b90e1794972485e112567b46120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QD7HYUN7F75G37DV4QLHEJFGCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thresholds of absorbing sets in 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":"Alessandro Tomasoni, Marco Ferrari, Sandro Bellini","submitted_at":"2014-01-31T14:13:42Z","abstract_excerpt":"In this paper, we investigate absorbing sets, responsible of error floors in Low Density Parity Check codes. We look for a concise, quantitative way to rate the absorbing sets' dangerousness. Based on a simplified model for iterative decoding evolution, we show that absorbing sets exhibit a threshold behavior. An absorbing set with at least one channel log-likelihood-ratio below the threshold can stop the convergence towards the right codeword. Otherwise convergence is guaranteed. We show that absorbing sets with negative thresholds can be deactivated simply using proper saturation levels. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8168","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-18T03:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLxEIdVlu5RnH8bHrE8EwtwIKtnvSUKbQdbcKzBWuMYq5HVm214guap+e0p51ODOlBFx/BwAwLfLm/m2YgyrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:31:55.841067Z"},"content_sha256":"0db5e9f4bc381bcd156f4f3defebf7d6679e34561454a042f683871b33af34b9","schema_version":"1.0","event_id":"sha256:0db5e9f4bc381bcd156f4f3defebf7d6679e34561454a042f683871b33af34b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QD7HYUN7F75G37DV4QLHEJFGCY/bundle.json","state_url":"https://pith.science/pith/QD7HYUN7F75G37DV4QLHEJFGCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QD7HYUN7F75G37DV4QLHEJFGCY/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-30T18:31:55Z","links":{"resolver":"https://pith.science/pith/QD7HYUN7F75G37DV4QLHEJFGCY","bundle":"https://pith.science/pith/QD7HYUN7F75G37DV4QLHEJFGCY/bundle.json","state":"https://pith.science/pith/QD7HYUN7F75G37DV4QLHEJFGCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QD7HYUN7F75G37DV4QLHEJFGCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QD7HYUN7F75G37DV4QLHEJFGCY","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":"c94ca79b1a9e4624650956effddde329da33c573e072ae1260bc45ca4fcf2265","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T14:13:42Z","title_canon_sha256":"d479271f2be0f70b516c38d6ccaf9fd669acb4a7e252c993dae32bcec1e93f7d"},"schema_version":"1.0","source":{"id":"1401.8168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8168","created_at":"2026-05-18T03:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8168v1","created_at":"2026-05-18T03:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8168","created_at":"2026-05-18T03:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"QD7HYUN7F75G","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QD7HYUN7F75G37DV","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QD7HYUN7","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:0db5e9f4bc381bcd156f4f3defebf7d6679e34561454a042f683871b33af34b9","target":"graph","created_at":"2026-05-18T03:00:28Z","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 paper, we investigate absorbing sets, responsible of error floors in Low Density Parity Check codes. We look for a concise, quantitative way to rate the absorbing sets' dangerousness. Based on a simplified model for iterative decoding evolution, we show that absorbing sets exhibit a threshold behavior. An absorbing set with at least one channel log-likelihood-ratio below the threshold can stop the convergence towards the right codeword. Otherwise convergence is guaranteed. We show that absorbing sets with negative thresholds can be deactivated simply using proper saturation levels. We ","authors_text":"Alessandro Tomasoni, Marco Ferrari, Sandro Bellini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T14:13:42Z","title":"Thresholds of absorbing sets in Low-Density-Parity-Check codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8168","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:d1897fae0c720d3a884303023889631511339b90e1794972485e112567b46120","target":"record","created_at":"2026-05-18T03:00:28Z","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":"c94ca79b1a9e4624650956effddde329da33c573e072ae1260bc45ca4fcf2265","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T14:13:42Z","title_canon_sha256":"d479271f2be0f70b516c38d6ccaf9fd669acb4a7e252c993dae32bcec1e93f7d"},"schema_version":"1.0","source":{"id":"1401.8168","kind":"arxiv","version":1}},"canonical_sha256":"80fe7c51bf2ffa6dfc75e4167224a61622a64a840b0f556efdb536c9f218047b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80fe7c51bf2ffa6dfc75e4167224a61622a64a840b0f556efdb536c9f218047b","first_computed_at":"2026-05-18T03:00:28.034202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:28.034202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KtrQf6rzchYOb/iLMroEwaEnDa5K3zcazXI2WrzI7GXGI3j4KyRm2Nopb/eaMgDwr0OTHmpu1GpmWXD2C3CACw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:28.034817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.8168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1897fae0c720d3a884303023889631511339b90e1794972485e112567b46120","sha256:0db5e9f4bc381bcd156f4f3defebf7d6679e34561454a042f683871b33af34b9"],"state_sha256":"37535754d91b00ff9891950e8186bbd39a53a8d94350a569ac166c1018a75361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHXhXbjXT4ehLar5QFf89T1e8itdJWWf/NrjY+nxUvcKVs3c0B8s/x0vnc2gpF7hWYSlj7bn+xRVlzx5bi8OAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:31:55.843065Z","bundle_sha256":"91e5f09e9eae933c1fe5edc34e21b36e71516e50ba662e1be4e39bca412c8775"}}