{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3VP57RZYQ6WPFSZTLZYB2X2MFU","short_pith_number":"pith:3VP57RZY","schema_version":"1.0","canonical_sha256":"dd5fdfc73887acf2cb335e701d5f4c2d10f1ee43855da85f074f83a0b10b23ff","source":{"kind":"arxiv","id":"2506.11345","version":1},"attestation_state":"computed","paper":{"title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mohsen Moradi, Sheida Rabeti","submitted_at":"2025-06-12T22:34:22Z","abstract_excerpt":"Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes."},"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":"2506.11345","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-12T22:34:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"327d67de17a19c57312c9de4617f3537bb09a6d003aa6f3b9bc0fdc7d64b7cd5","abstract_canon_sha256":"fddc2d6ee77d5ddad791fee12d0091875cf1242e8eb69171c051ce415d8326b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:02.831222Z","signature_b64":"KUc2v/cUImYgc5ZyStdqoYWrEYN+CZbAAXg+6cucBUZIwfIVJtidvkqK6pyvBIKa+Jr6DiXWawWcGHIBj0aGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd5fdfc73887acf2cb335e701d5f4c2d10f1ee43855da85f074f83a0b10b23ff","last_reissued_at":"2026-07-05T11:21:02.830879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:02.830879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mohsen Moradi, Sheida Rabeti","submitted_at":"2025-06-12T22:34:22Z","abstract_excerpt":"Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11345","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/2506.11345/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":"2506.11345","created_at":"2026-07-05T11:21:02.830940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11345v1","created_at":"2026-07-05T11:21:02.830940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11345","created_at":"2026-07-05T11:21:02.830940+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VP57RZYQ6WP","created_at":"2026-07-05T11:21:02.830940+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VP57RZYQ6WPFSZT","created_at":"2026-07-05T11:21:02.830940+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VP57RZY","created_at":"2026-07-05T11:21:02.830940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06072","citing_title":"PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU","json":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU.json","graph_json":"https://pith.science/api/pith-number/3VP57RZYQ6WPFSZTLZYB2X2MFU/graph.json","events_json":"https://pith.science/api/pith-number/3VP57RZYQ6WPFSZTLZYB2X2MFU/events.json","paper":"https://pith.science/paper/3VP57RZY"},"agent_actions":{"view_html":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU","download_json":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU.json","view_paper":"https://pith.science/paper/3VP57RZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11345&json=true","fetch_graph":"https://pith.science/api/pith-number/3VP57RZYQ6WPFSZTLZYB2X2MFU/graph.json","fetch_events":"https://pith.science/api/pith-number/3VP57RZYQ6WPFSZTLZYB2X2MFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU/action/storage_attestation","attest_author":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU/action/author_attestation","sign_citation":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU/action/citation_signature","submit_replication":"https://pith.science/pith/3VP57RZYQ6WPFSZTLZYB2X2MFU/action/replication_record"}},"created_at":"2026-07-05T11:21:02.830940+00:00","updated_at":"2026-07-05T11:21:02.830940+00:00"}