{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:F4ODVO6TDVRR5ZXG6NEB5W2CNT","short_pith_number":"pith:F4ODVO6T","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"},"canonical_sha256":"2f1c3abbd31d631ee6e6f3481edb426cf27a7758f5b76b57fafdc55bb4fb0b2c","source":{"kind":"arxiv","id":"2411.16203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16203","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16203v1","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16203","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"F4ODVO6TDVRR","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"pith_short_16","alias_value":"F4ODVO6TDVRR5ZXG","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"pith_short_8","alias_value":"F4ODVO6T","created_at":"2026-07-05T09:40:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:F4ODVO6TDVRR5ZXG6NEB5W2CNT","target":"record","payload":{"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"},"canonical_sha256":"2f1c3abbd31d631ee6e6f3481edb426cf27a7758f5b76b57fafdc55bb4fb0b2c","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"},"source_kind":"arxiv","source_id":"2411.16203","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-07-05T09:40:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmKRPD8Ycvh0bTItwMDKKdDZQw1LGhqvsjnQYt5nwjmx/3lOo+jGoOjISZ82ie/ogwBNSfWotZWAU/UJhSKIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:40:17.625591Z"},"content_sha256":"d791ce5af7022cbf6a2b4a51d9ef3df8aad96efe63350d8a8f64b7bae31d219a","schema_version":"1.0","event_id":"sha256:d791ce5af7022cbf6a2b4a51d9ef3df8aad96efe63350d8a8f64b7bae31d219a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:F4ODVO6TDVRR5ZXG6NEB5W2CNT","target":"graph","payload":{"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"},"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-07-05T09:40:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6QadivURvBPSb67agh8RI8J0cNqz9T90Hb4jPWbioJ7x3Lv6dElKROobo6+ewNb4KPkyTy7NNLfDhoKXSB+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:40:17.625968Z"},"content_sha256":"4d54d4df45c7921baa05dece6b884ea02af9fe993632561918fa46241a2609a9","schema_version":"1.0","event_id":"sha256:4d54d4df45c7921baa05dece6b884ea02af9fe993632561918fa46241a2609a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/bundle.json","state_url":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/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-08-13T08:40:17Z","links":{"resolver":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT","bundle":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/bundle.json","state":"https://pith.science/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4ODVO6TDVRR5ZXG6NEB5W2CNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:F4ODVO6TDVRR5ZXG6NEB5W2CNT","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":"def41c6f9c8e5f1a629d9b10532a6ade2a3ee13cc9dfaddf50ea12c1f9d9ce90","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-25T09:02:45Z","title_canon_sha256":"4cfba7acaeb2659627680ba37fe705e5c5e68fc1cd0c614299aa660e0706b682"},"schema_version":"1.0","source":{"id":"2411.16203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16203","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16203v1","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16203","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"F4ODVO6TDVRR","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"pith_short_16","alias_value":"F4ODVO6TDVRR5ZXG","created_at":"2026-07-05T09:40:05Z"},{"alias_kind":"pith_short_8","alias_value":"F4ODVO6T","created_at":"2026-07-05T09:40:05Z"}],"graph_snapshots":[{"event_id":"sha256:4d54d4df45c7921baa05dece6b884ea02af9fe993632561918fa46241a2609a9","target":"graph","created_at":"2026-07-05T09:40:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.16203/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexandru Amaricai, Oana Boncalo","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-25T09:02:45Z","title":"Iterative Gradient Descent Decoding for Real Number LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16203","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:d791ce5af7022cbf6a2b4a51d9ef3df8aad96efe63350d8a8f64b7bae31d219a","target":"record","created_at":"2026-07-05T09:40:05Z","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":"def41c6f9c8e5f1a629d9b10532a6ade2a3ee13cc9dfaddf50ea12c1f9d9ce90","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-25T09:02:45Z","title_canon_sha256":"4cfba7acaeb2659627680ba37fe705e5c5e68fc1cd0c614299aa660e0706b682"},"schema_version":"1.0","source":{"id":"2411.16203","kind":"arxiv","version":1}},"canonical_sha256":"2f1c3abbd31d631ee6e6f3481edb426cf27a7758f5b76b57fafdc55bb4fb0b2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f1c3abbd31d631ee6e6f3481edb426cf27a7758f5b76b57fafdc55bb4fb0b2c","first_computed_at":"2026-07-05T09:40:05.789201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:05.789201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+k54c3eR8fbGXrEJvBrR4vjAckubVIhhzXG41w62DLdtIZ86LKm/amxvtZ8sVQ/ateOlPysEyujc9mDw7TPiDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:05.789619Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d791ce5af7022cbf6a2b4a51d9ef3df8aad96efe63350d8a8f64b7bae31d219a","sha256:4d54d4df45c7921baa05dece6b884ea02af9fe993632561918fa46241a2609a9"],"state_sha256":"a1a7d891f366023fec97a5c3c79b28dbfa1ab94c240e76fe190bf8047dd59e2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIT5Oxeq9S15answiuCbV2WNzEMWY2nnK86Lu+SO450yNQnwE7PWz18p2fyLhJmnpnPkvlbjK3M4xaS2OI//Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:40:17.629044Z","bundle_sha256":"d5e6a76f2d89ad48caba567ce6e98734f915a4648bbdc47a615951d482a2ec57"}}