{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F4ODVO6TDVRR5ZXG6NEB5W2CNT","short_pith_number":"pith:F4ODVO6T","schema_version":"1.0","canonical_sha256":"2f1c3abbd31d631ee6e6f3481edb426cf27a7758f5b76b57fafdc55bb4fb0b2c","source":{"kind":"arxiv","id":"2411.16203","version":1},"attestation_state":"computed","paper":{"title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandru Amaricai, Oana Boncalo","submitted_at":"2024-11-25T09:02:45Z","abstract_excerpt":"This paper proposes a new iterative gradient descent decoding method for real number parity codes. The proposed decoder, named Gradient Descent Symbol Update (GDSU), is used for a class of low-density parity-check (LDPC) real-number codes that can be defined with parity check matrices which are similar to those of the binary LDPC from communication standards such as WiFi (IEEE 802.11), 5G. These codes have a simple and efficient two stage encoding that is especially appealing for the real number field. The Gradient optimization based decoding has been a relatively simple and fast decoding tech"},"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":"2411.16203","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-25T09:02:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4cfba7acaeb2659627680ba37fe705e5c5e68fc1cd0c614299aa660e0706b682","abstract_canon_sha256":"def41c6f9c8e5f1a629d9b10532a6ade2a3ee13cc9dfaddf50ea12c1f9d9ce90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:05.789619Z","signature_b64":"+k54c3eR8fbGXrEJvBrR4vjAckubVIhhzXG41w62DLdtIZ86LKm/amxvtZ8sVQ/ateOlPysEyujc9mDw7TPiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f1c3abbd31d631ee6e6f3481edb426cf27a7758f5b76b57fafdc55bb4fb0b2c","last_reissued_at":"2026-07-05T09:40:05.789201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:05.789201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandru Amaricai, Oana Boncalo","submitted_at":"2024-11-25T09:02:45Z","abstract_excerpt":"This paper proposes a new iterative gradient descent decoding method for real number parity codes. The proposed decoder, named Gradient Descent Symbol Update (GDSU), is used for a class of low-density parity-check (LDPC) real-number codes that can be defined with parity check matrices which are similar to those of the binary LDPC from communication standards such as WiFi (IEEE 802.11), 5G. These codes have a simple and efficient two stage encoding that is especially appealing for the real number field. The Gradient optimization based decoding has been a relatively simple and fast decoding tech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16203","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/2411.16203/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":"2411.16203","created_at":"2026-07-05T09:40:05.789257+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16203v1","created_at":"2026-07-05T09:40:05.789257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16203","created_at":"2026-07-05T09:40:05.789257+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4ODVO6TDVRR","created_at":"2026-07-05T09:40:05.789257+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4ODVO6TDVRR5ZXG","created_at":"2026-07-05T09:40:05.789257+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4ODVO6T","created_at":"2026-07-05T09:40:05.789257+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/F4ODVO6TDVRR5ZXG6NEB5W2CNT","json":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT.json","graph_json":"https://pith.science/api/pith-number/F4ODVO6TDVRR5ZXG6NEB5W2CNT/graph.json","events_json":"https://pith.science/api/pith-number/F4ODVO6TDVRR5ZXG6NEB5W2CNT/events.json","paper":"https://pith.science/paper/F4ODVO6T"},"agent_actions":{"view_html":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT","download_json":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT.json","view_paper":"https://pith.science/paper/F4ODVO6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16203&json=true","fetch_graph":"https://pith.science/api/pith-number/F4ODVO6TDVRR5ZXG6NEB5W2CNT/graph.json","fetch_events":"https://pith.science/api/pith-number/F4ODVO6TDVRR5ZXG6NEB5W2CNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/action/storage_attestation","attest_author":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/action/author_attestation","sign_citation":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/action/citation_signature","submit_replication":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/action/replication_record"}},"created_at":"2026-07-05T09:40:05.789257+00:00","updated_at":"2026-07-05T09:40:05.789257+00:00"}