{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NM6BRRBLU34YRHP2V76HNXJVYL","short_pith_number":"pith:NM6BRRBL","canonical_record":{"source":{"id":"2607.08484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-09T13:42:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c96e756bd5c5631c393453775e5d07aa0e25d270b025c8c7a6a7c2b082956b2","abstract_canon_sha256":"636f7cc1bb427128218594169be06940f2499bc6a2b751319c8fabfa2b887700"},"schema_version":"1.0"},"canonical_sha256":"6b3c18c42ba6f9889dfaaffc76dd35c2d8f0d15bfc52bfaf28a349918071064c","source":{"kind":"arxiv","id":"2607.08484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08484","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08484v1","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08484","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"NM6BRRBLU34Y","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_16","alias_value":"NM6BRRBLU34YRHP2","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_8","alias_value":"NM6BRRBL","created_at":"2026-07-10T01:19:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NM6BRRBLU34YRHP2V76HNXJVYL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.08484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-09T13:42:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c96e756bd5c5631c393453775e5d07aa0e25d270b025c8c7a6a7c2b082956b2","abstract_canon_sha256":"636f7cc1bb427128218594169be06940f2499bc6a2b751319c8fabfa2b887700"},"schema_version":"1.0"},"canonical_sha256":"6b3c18c42ba6f9889dfaaffc76dd35c2d8f0d15bfc52bfaf28a349918071064c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:51.825886Z","signature_b64":"AMuvxpcGEcUYDR0phQsjxaYM1G4a/BMKSaz9hfaJF7yr9GflrZ5cwgstxjDL4uGs3uqNcfkp1JVBCiQ31r7aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b3c18c42ba6f9889dfaaffc76dd35c2d8f0d15bfc52bfaf28a349918071064c","last_reissued_at":"2026-07-10T01:19:51.825458Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:51.825458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.08484","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-10T01:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osbFAJJIDM8J2HuqYwM1gBIjBkJvGvX9EBpr8uhVUN3qJg3IU1nDhNrY9Nxc6vFZWziTKx5h8qx7rdwNx7TWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:27:39.241850Z"},"content_sha256":"e0891130bea9b12c9fb0e576efa8ad1a8f6438a6236d780465e2e1f85a4cb39f","schema_version":"1.0","event_id":"sha256:e0891130bea9b12c9fb0e576efa8ad1a8f6438a6236d780465e2e1f85a4cb39f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NM6BRRBLU34YRHP2V76HNXJVYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning LDPC codes with quantized density evolution over relaxed protographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Dmitry Artemasov, Gennady Shutkov, Kirill Andreev, Pavel Rybin","submitted_at":"2026-07-09T13:42:10Z","abstract_excerpt":"We consider the design of low-density parity-check (LDPC) codes for a given iterative decoder. Despite tools such as direct simulation, density evolution (DE), and EXIT-chart analysis, selecting a parity-check matrix remains a difficult combinatorial optimization problem. Existing approaches often rely on population-based search, random mutations, genetic algorithms, or related heuristics, which require careful parameter tuning and may be computationally expensive. Recent gradient descent (GD)-based methods optimize relaxed parity-check matrices by differentiating through decoder simulations. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08484","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/2607.08484/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-10T01:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SU2VUwRGB8eYoOSfJ5bYf48QJlJ1rgq7STt5mjBd9nS4s8DTcVavc0s1ThJYrvyBDauKK9e6sAwFAJw4+I/XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:27:39.242392Z"},"content_sha256":"5e4758c6c584826f2aa3638db205e1961347e6a728d12a54dc27f7c2da0fcd64","schema_version":"1.0","event_id":"sha256:5e4758c6c584826f2aa3638db205e1961347e6a728d12a54dc27f7c2da0fcd64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NM6BRRBLU34YRHP2V76HNXJVYL/bundle.json","state_url":"https://pith.science/pith/NM6BRRBLU34YRHP2V76HNXJVYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NM6BRRBLU34YRHP2V76HNXJVYL/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-19T13:27:39Z","links":{"resolver":"https://pith.science/pith/NM6BRRBLU34YRHP2V76HNXJVYL","bundle":"https://pith.science/pith/NM6BRRBLU34YRHP2V76HNXJVYL/bundle.json","state":"https://pith.science/pith/NM6BRRBLU34YRHP2V76HNXJVYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NM6BRRBLU34YRHP2V76HNXJVYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NM6BRRBLU34YRHP2V76HNXJVYL","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":"636f7cc1bb427128218594169be06940f2499bc6a2b751319c8fabfa2b887700","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-09T13:42:10Z","title_canon_sha256":"7c96e756bd5c5631c393453775e5d07aa0e25d270b025c8c7a6a7c2b082956b2"},"schema_version":"1.0","source":{"id":"2607.08484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08484","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08484v1","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08484","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"NM6BRRBLU34Y","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_16","alias_value":"NM6BRRBLU34YRHP2","created_at":"2026-07-10T01:19:51Z"},{"alias_kind":"pith_short_8","alias_value":"NM6BRRBL","created_at":"2026-07-10T01:19:51Z"}],"graph_snapshots":[{"event_id":"sha256:5e4758c6c584826f2aa3638db205e1961347e6a728d12a54dc27f7c2da0fcd64","target":"graph","created_at":"2026-07-10T01:19:51Z","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/2607.08484/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the design of low-density parity-check (LDPC) codes for a given iterative decoder. Despite tools such as direct simulation, density evolution (DE), and EXIT-chart analysis, selecting a parity-check matrix remains a difficult combinatorial optimization problem. Existing approaches often rely on population-based search, random mutations, genetic algorithms, or related heuristics, which require careful parameter tuning and may be computationally expensive. Recent gradient descent (GD)-based methods optimize relaxed parity-check matrices by differentiating through decoder simulations. ","authors_text":"Alexey Frolov, Dmitry Artemasov, Gennady Shutkov, Kirill Andreev, Pavel Rybin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-09T13:42:10Z","title":"Learning LDPC codes with quantized density evolution over relaxed protographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08484","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:e0891130bea9b12c9fb0e576efa8ad1a8f6438a6236d780465e2e1f85a4cb39f","target":"record","created_at":"2026-07-10T01:19:51Z","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":"636f7cc1bb427128218594169be06940f2499bc6a2b751319c8fabfa2b887700","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-09T13:42:10Z","title_canon_sha256":"7c96e756bd5c5631c393453775e5d07aa0e25d270b025c8c7a6a7c2b082956b2"},"schema_version":"1.0","source":{"id":"2607.08484","kind":"arxiv","version":1}},"canonical_sha256":"6b3c18c42ba6f9889dfaaffc76dd35c2d8f0d15bfc52bfaf28a349918071064c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b3c18c42ba6f9889dfaaffc76dd35c2d8f0d15bfc52bfaf28a349918071064c","first_computed_at":"2026-07-10T01:19:51.825458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:51.825458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AMuvxpcGEcUYDR0phQsjxaYM1G4a/BMKSaz9hfaJF7yr9GflrZ5cwgstxjDL4uGs3uqNcfkp1JVBCiQ31r7aAg==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:51.825886Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0891130bea9b12c9fb0e576efa8ad1a8f6438a6236d780465e2e1f85a4cb39f","sha256:5e4758c6c584826f2aa3638db205e1961347e6a728d12a54dc27f7c2da0fcd64"],"state_sha256":"ce13538bde0139961af20abda54ac1f5ca9d1e1c6d49779c15a472f66dd4710e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7Q6H/tKcPgZMBNCH2+wDXTTI5bss1wPq1HS4/xqcZX7p6aU0YTsOshh5IUt72NAbrGkmQLarVW857JdihD0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:27:39.247152Z","bundle_sha256":"3e63e90fbee7ef7dfae7407698f2128c475208b53199dd0a313a8cc222925cfe"}}