{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:4EZAI4UIXTZCWGLGYSVARYMNPA","short_pith_number":"pith:4EZAI4UI","schema_version":"1.0","canonical_sha256":"e132047288bcf22b1966c4aa08e18d782ab860fb90020375bbd5c56126a38ff6","source":{"kind":"arxiv","id":"0907.0775","version":1},"attestation_state":"computed","paper":{"title":"Statistical mechanics of LDPC codes on channels with memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"cond-mat.dis-nn","authors_text":"I. Neri, N. S. Skantzos","submitted_at":"2009-07-04T17:13:07Z","abstract_excerpt":"We present an analytic method of assessing the typical performance of low-density parity-check codes on finite-state Markov channels. We show that this problem is similar to a spin-glass model on a `small-world' lattice. We apply our methodology to binary-symmetric and binary-asymmetric channels and we provide the critical noise levels for different degrees of channel symmetry."},"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":"0907.0775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-07-04T17:13:07Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"254cb4dd3ba75dda2ec1c81ba06172c7613d483edf58669b70f946412fade1f5","abstract_canon_sha256":"07083ee3389b8f18c5274adb8ed6d89944f58febf3868a02fbe910ee636e1ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:15.536579Z","signature_b64":"gRI/ynuXOLSNoBptVPBf4tazUg7sQaACLgzo18aDCGtYPi5wcSWO3y1R9XT1cO8fXoOE1y54OG1UD1a4A7OBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e132047288bcf22b1966c4aa08e18d782ab860fb90020375bbd5c56126a38ff6","last_reissued_at":"2026-05-18T02:42:15.535872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:15.535872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical mechanics of LDPC codes on channels with memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"cond-mat.dis-nn","authors_text":"I. Neri, N. S. Skantzos","submitted_at":"2009-07-04T17:13:07Z","abstract_excerpt":"We present an analytic method of assessing the typical performance of low-density parity-check codes on finite-state Markov channels. We show that this problem is similar to a spin-glass model on a `small-world' lattice. We apply our methodology to binary-symmetric and binary-asymmetric channels and we provide the critical noise levels for different degrees of channel symmetry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.0775","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":"0907.0775","created_at":"2026-05-18T02:42:15.535986+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.0775v1","created_at":"2026-05-18T02:42:15.535986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.0775","created_at":"2026-05-18T02:42:15.535986+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EZAI4UIXTZC","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EZAI4UIXTZCWGLG","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EZAI4UI","created_at":"2026-05-18T12:25:58.837520+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/4EZAI4UIXTZCWGLGYSVARYMNPA","json":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA.json","graph_json":"https://pith.science/api/pith-number/4EZAI4UIXTZCWGLGYSVARYMNPA/graph.json","events_json":"https://pith.science/api/pith-number/4EZAI4UIXTZCWGLGYSVARYMNPA/events.json","paper":"https://pith.science/paper/4EZAI4UI"},"agent_actions":{"view_html":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA","download_json":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA.json","view_paper":"https://pith.science/paper/4EZAI4UI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.0775&json=true","fetch_graph":"https://pith.science/api/pith-number/4EZAI4UIXTZCWGLGYSVARYMNPA/graph.json","fetch_events":"https://pith.science/api/pith-number/4EZAI4UIXTZCWGLGYSVARYMNPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA/action/storage_attestation","attest_author":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA/action/author_attestation","sign_citation":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA/action/citation_signature","submit_replication":"https://pith.science/pith/4EZAI4UIXTZCWGLGYSVARYMNPA/action/replication_record"}},"created_at":"2026-05-18T02:42:15.535986+00:00","updated_at":"2026-05-18T02:42:15.535986+00:00"}