{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PSSEKRBQVLJ4TLIKERJLUHBJER","short_pith_number":"pith:PSSEKRBQ","canonical_record":{"source":{"id":"2406.12900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T12:08:56Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"f9ff18552208ff8f168059e158a6adc9cc0601ddaa5b3abf66c90e3e420c20ce","abstract_canon_sha256":"198af5b846a45471011f798e2a321cf4e3f7765827fe5861dfee690eda484b07"},"schema_version":"1.0"},"canonical_sha256":"7ca4454430aad3c9ad0a2452ba1c2924559521e76103b0681da0467d6380e3c5","source":{"kind":"arxiv","id":"2406.12900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.12900","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"2406.12900v2","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12900","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"PSSEKRBQVLJ4","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"pith_short_16","alias_value":"PSSEKRBQVLJ4TLIK","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"pith_short_8","alias_value":"PSSEKRBQ","created_at":"2026-07-05T09:18:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PSSEKRBQVLJ4TLIKERJLUHBJER","target":"record","payload":{"canonical_record":{"source":{"id":"2406.12900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T12:08:56Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"f9ff18552208ff8f168059e158a6adc9cc0601ddaa5b3abf66c90e3e420c20ce","abstract_canon_sha256":"198af5b846a45471011f798e2a321cf4e3f7765827fe5861dfee690eda484b07"},"schema_version":"1.0"},"canonical_sha256":"7ca4454430aad3c9ad0a2452ba1c2924559521e76103b0681da0467d6380e3c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:27.315101Z","signature_b64":"YZNvoFslnx+cTWijG+4VM1cF3+dSQF7ZR/eCdD09sETCPDFegUletzBW88Gon5suq/6LEIjGAwhZhZyS2EV/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ca4454430aad3c9ad0a2452ba1c2924559521e76103b0681da0467d6380e3c5","last_reissued_at":"2026-07-05T09:18:27.314630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:27.314630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.12900","source_version":2,"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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdTRaIDeW8nGazABqstIgNFgbfTNC9a9trfHEDU1+WCpZ20vZ/CsxVW1L5sutfJWvWzNYfE29qjDAtCA3A/zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:21:00.109692Z"},"content_sha256":"fdee9d6d7bdea811e117c7c3fe6a071177784dd075b00c6adbea43f98b8b5202","schema_version":"1.0","event_id":"sha256:fdee9d6d7bdea811e117c7c3fe6a071177784dd075b00c6adbea43f98b8b5202"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PSSEKRBQVLJ4TLIKERJLUHBJER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Lior Wolf, Yoni Choukroun","submitted_at":"2024-06-09T12:08:56Z","abstract_excerpt":"The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes, the most notable being its efficient decoding via Belief Propagation. While many LDPC code design methods exist, the development of efficient sparse codes that meet the constraints of modern short code lengths and accommodate new channel models remains a challenge. In this work, we propose for the first time a gradient-based data-dr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12900","kind":"arxiv","version":2},"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/2406.12900/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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kq+kbv0kUjNywt7s35JuLw3I18JLRz9lN8JspHMCGCQNFYGJ4f9F6y4JunlISIcYdhSwbQ/A2IOF9J9f5ey/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:21:00.110206Z"},"content_sha256":"f549ff08257d9034ac8f966e7d42bca6aac1e1bad413a3f889eb9d039312d184","schema_version":"1.0","event_id":"sha256:f549ff08257d9034ac8f966e7d42bca6aac1e1bad413a3f889eb9d039312d184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSSEKRBQVLJ4TLIKERJLUHBJER/bundle.json","state_url":"https://pith.science/pith/PSSEKRBQVLJ4TLIKERJLUHBJER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSSEKRBQVLJ4TLIKERJLUHBJER/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-03T18:21:00Z","links":{"resolver":"https://pith.science/pith/PSSEKRBQVLJ4TLIKERJLUHBJER","bundle":"https://pith.science/pith/PSSEKRBQVLJ4TLIKERJLUHBJER/bundle.json","state":"https://pith.science/pith/PSSEKRBQVLJ4TLIKERJLUHBJER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSSEKRBQVLJ4TLIKERJLUHBJER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PSSEKRBQVLJ4TLIKERJLUHBJER","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":"198af5b846a45471011f798e2a321cf4e3f7765827fe5861dfee690eda484b07","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T12:08:56Z","title_canon_sha256":"f9ff18552208ff8f168059e158a6adc9cc0601ddaa5b3abf66c90e3e420c20ce"},"schema_version":"1.0","source":{"id":"2406.12900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.12900","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"2406.12900v2","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12900","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"PSSEKRBQVLJ4","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"pith_short_16","alias_value":"PSSEKRBQVLJ4TLIK","created_at":"2026-07-05T09:18:27Z"},{"alias_kind":"pith_short_8","alias_value":"PSSEKRBQ","created_at":"2026-07-05T09:18:27Z"}],"graph_snapshots":[{"event_id":"sha256:f549ff08257d9034ac8f966e7d42bca6aac1e1bad413a3f889eb9d039312d184","target":"graph","created_at":"2026-07-05T09:18:27Z","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/2406.12900/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes, the most notable being its efficient decoding via Belief Propagation. While many LDPC code design methods exist, the development of efficient sparse codes that meet the constraints of modern short code lengths and accommodate new channel models remains a challenge. In this work, we propose for the first time a gradient-based data-dr","authors_text":"Lior Wolf, Yoni Choukroun","cross_cats":["cs.AI","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T12:08:56Z","title":"Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12900","kind":"arxiv","version":2},"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:fdee9d6d7bdea811e117c7c3fe6a071177784dd075b00c6adbea43f98b8b5202","target":"record","created_at":"2026-07-05T09:18:27Z","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":"198af5b846a45471011f798e2a321cf4e3f7765827fe5861dfee690eda484b07","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T12:08:56Z","title_canon_sha256":"f9ff18552208ff8f168059e158a6adc9cc0601ddaa5b3abf66c90e3e420c20ce"},"schema_version":"1.0","source":{"id":"2406.12900","kind":"arxiv","version":2}},"canonical_sha256":"7ca4454430aad3c9ad0a2452ba1c2924559521e76103b0681da0467d6380e3c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ca4454430aad3c9ad0a2452ba1c2924559521e76103b0681da0467d6380e3c5","first_computed_at":"2026-07-05T09:18:27.314630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:27.314630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YZNvoFslnx+cTWijG+4VM1cF3+dSQF7ZR/eCdD09sETCPDFegUletzBW88Gon5suq/6LEIjGAwhZhZyS2EV/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:27.315101Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.12900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdee9d6d7bdea811e117c7c3fe6a071177784dd075b00c6adbea43f98b8b5202","sha256:f549ff08257d9034ac8f966e7d42bca6aac1e1bad413a3f889eb9d039312d184"],"state_sha256":"a9ca0095885a97866db7f383fa29c37b5d158fc5850de920f79e35e32c68a27a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K79+OinOKKLS+923atxW6C81fKloHuLjHhoVbdel6xjO2XGlwwJd7cDhH/q9zxzCW6RdClz1GfHzgt6mBEHACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:21:00.114699Z","bundle_sha256":"bdc0e92aeb20e8f00a6beccfccc921f65440acd15212267b91ad877d83be84e8"}}