{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:DF6KUI2GJ5THBJRYJ7BDWV6YDH","short_pith_number":"pith:DF6KUI2G","schema_version":"1.0","canonical_sha256":"197caa23464f6670a6384fc23b57d819d7cf0d03e99cce9dd30474dc3a34f9d6","source":{"kind":"arxiv","id":"cs/9907002","version":1},"attestation_state":"computed","paper":{"title":"The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Eppstein, Padhraic Smyth, Xian-ping Ge","submitted_at":"1999-07-02T23:37:54Z","abstract_excerpt":"This paper analyzes the distribution of cycle lengths in turbo decoding and low-density parity check (LDPC) graphs. The properties of such cycles are of significant interest in the context of iterative decoding algorithms which are based on belief propagation or message passing. We estimate the probability that there exist no simple cycles of length less than or equal to k at a randomly chosen node in a turbo decoding graph using a combination of counting arguments and independence assumptions. For large block lengths n, this probability is approximately e^{-{2^{k-1}-4}/n}, k>=4. Simulation re"},"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":"cs/9907002","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"1999-07-02T23:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"426ebe05cb6dc421aeea6f7994e2b5c367e27c40fed746add2b671ab9ee8a8f6","abstract_canon_sha256":"6eff3680c0d7c51a8a7e72b7563c1ec5b77fb79fb0cad263b924304c23f19544"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:20:01.744921Z","signature_b64":"XvrOFpD2u0Gn5gWv+9zSMHo2gNfjGWuVyiXGJDLq9w5y9es8QiQrIEgQx1nSvb4haWDm2WunymT8MxCgHvmdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"197caa23464f6670a6384fc23b57d819d7cf0d03e99cce9dd30474dc3a34f9d6","last_reissued_at":"2026-07-04T17:20:01.744526Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:20:01.744526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Eppstein, Padhraic Smyth, Xian-ping Ge","submitted_at":"1999-07-02T23:37:54Z","abstract_excerpt":"This paper analyzes the distribution of cycle lengths in turbo decoding and low-density parity check (LDPC) graphs. The properties of such cycles are of significant interest in the context of iterative decoding algorithms which are based on belief propagation or message passing. We estimate the probability that there exist no simple cycles of length less than or equal to k at a randomly chosen node in a turbo decoding graph using a combination of counting arguments and independence assumptions. For large block lengths n, this probability is approximately e^{-{2^{k-1}-4}/n}, k>=4. Simulation re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9907002","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/9907002/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/9907002","created_at":"2026-07-04T17:20:01.744591+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9907002v1","created_at":"2026-07-04T17:20:01.744591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9907002","created_at":"2026-07-04T17:20:01.744591+00:00"},{"alias_kind":"pith_short_12","alias_value":"DF6KUI2GJ5TH","created_at":"2026-07-04T17:20:01.744591+00:00"},{"alias_kind":"pith_short_16","alias_value":"DF6KUI2GJ5THBJRY","created_at":"2026-07-04T17:20:01.744591+00:00"},{"alias_kind":"pith_short_8","alias_value":"DF6KUI2G","created_at":"2026-07-04T17:20:01.744591+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/DF6KUI2GJ5THBJRYJ7BDWV6YDH","json":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH.json","graph_json":"https://pith.science/api/pith-number/DF6KUI2GJ5THBJRYJ7BDWV6YDH/graph.json","events_json":"https://pith.science/api/pith-number/DF6KUI2GJ5THBJRYJ7BDWV6YDH/events.json","paper":"https://pith.science/paper/DF6KUI2G"},"agent_actions":{"view_html":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH","download_json":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH.json","view_paper":"https://pith.science/paper/DF6KUI2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9907002&json=true","fetch_graph":"https://pith.science/api/pith-number/DF6KUI2GJ5THBJRYJ7BDWV6YDH/graph.json","fetch_events":"https://pith.science/api/pith-number/DF6KUI2GJ5THBJRYJ7BDWV6YDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH/action/storage_attestation","attest_author":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH/action/author_attestation","sign_citation":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH/action/citation_signature","submit_replication":"https://pith.science/pith/DF6KUI2GJ5THBJRYJ7BDWV6YDH/action/replication_record"}},"created_at":"2026-07-04T17:20:01.744591+00:00","updated_at":"2026-07-04T17:20:01.744591+00:00"}