{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:RGOXJF6IKWCKF453LRCY4PMQBL","short_pith_number":"pith:RGOXJF6I","canonical_record":{"source":{"id":"cs/0702014","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-02-02T06:30:48Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"0654ea037adc74abff4801febc0b608d896c6a9a8a00115993c41fb2ae5eda4c","abstract_canon_sha256":"ef450ffc7000586f0f1e5111f5e795dc2593d462f92434173f644380c5687297"},"schema_version":"1.0"},"canonical_sha256":"899d7497c85584a2f3bb5c458e3d900afc9a941f2f1abbdfedd5d9dcb4215b10","source":{"kind":"arxiv","id":"cs/0702014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702014","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702014v2","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702014","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"RGOXJF6IKWCK","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"RGOXJF6IKWCKF453","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"RGOXJF6I","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:RGOXJF6IKWCKF453LRCY4PMQBL","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0702014","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-02-02T06:30:48Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"0654ea037adc74abff4801febc0b608d896c6a9a8a00115993c41fb2ae5eda4c","abstract_canon_sha256":"ef450ffc7000586f0f1e5111f5e795dc2593d462f92434173f644380c5687297"},"schema_version":"1.0"},"canonical_sha256":"899d7497c85584a2f3bb5c458e3d900afc9a941f2f1abbdfedd5d9dcb4215b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.167637Z","signature_b64":"DiJgDnr19euwjjTpw9PnmA5HtDlJvJ/J1olOk2WBHiXHTTuvmSI9ja7falKrQWgkG6jN1qxc/ZZw659yHI+BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"899d7497c85584a2f3bb5c458e3d900afc9a941f2f1abbdfedd5d9dcb4215b10","last_reissued_at":"2026-05-18T00:58:56.166785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.166785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0702014","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-05-18T00:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghKqyQmPFfNPmfX/POzFNljDgQi0J51MIDKs3OLnwx2hW7YLIwNnFq1Eo8MediQlatSIc6gkD4HHGdEFP8hjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:57.557957Z"},"content_sha256":"1a033cc36f2eed5c6d916a57fd1f189776376a9da7b28506013de88147ef1806","schema_version":"1.0","event_id":"sha256:1a033cc36f2eed5c6d916a57fd1f189776376a9da7b28506013de88147ef1806"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:RGOXJF6IKWCKF453LRCY4PMQBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Analysis of Linear Programming Decoding","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Constantinos Daskalakis, Martin J. Wainwright, Richard M. Karp","submitted_at":"2007-02-02T06:30:48Z","abstract_excerpt":"We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in correcting a constant fraction of errors with high probability. The fraction of correctable errors guaranteed by our analysis surpasses previous non-asymptotic results for LDPC codes, and in particular exceeds the best previous finite-length result on LP decoding by a factor greater than ten. This improvement stems in part from our analysis of probabilistic bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702014","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":""},"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-05-18T00:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfbkdtKg4zMk+w1HG/9BgFe1gC/OSaGyCn2sybsWKQsLFZlDb6g4A7I0uYoDnhe4H+71Pis9FzWex+StDah1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:57.558325Z"},"content_sha256":"b5ea8e2ac637041b3d59bafccbcc8a583964fff04caf4f63662864f0177c1453","schema_version":"1.0","event_id":"sha256:b5ea8e2ac637041b3d59bafccbcc8a583964fff04caf4f63662864f0177c1453"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGOXJF6IKWCKF453LRCY4PMQBL/bundle.json","state_url":"https://pith.science/pith/RGOXJF6IKWCKF453LRCY4PMQBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGOXJF6IKWCKF453LRCY4PMQBL/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-05-30T10:44:57Z","links":{"resolver":"https://pith.science/pith/RGOXJF6IKWCKF453LRCY4PMQBL","bundle":"https://pith.science/pith/RGOXJF6IKWCKF453LRCY4PMQBL/bundle.json","state":"https://pith.science/pith/RGOXJF6IKWCKF453LRCY4PMQBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGOXJF6IKWCKF453LRCY4PMQBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:RGOXJF6IKWCKF453LRCY4PMQBL","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":"ef450ffc7000586f0f1e5111f5e795dc2593d462f92434173f644380c5687297","cross_cats_sorted":["cs.DM","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-02-02T06:30:48Z","title_canon_sha256":"0654ea037adc74abff4801febc0b608d896c6a9a8a00115993c41fb2ae5eda4c"},"schema_version":"1.0","source":{"id":"cs/0702014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702014","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702014v2","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702014","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"RGOXJF6IKWCK","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"RGOXJF6IKWCKF453","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"RGOXJF6I","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:b5ea8e2ac637041b3d59bafccbcc8a583964fff04caf4f63662864f0177c1453","target":"graph","created_at":"2026-05-18T00:58:56Z","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"},"paper":{"abstract_excerpt":"We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in correcting a constant fraction of errors with high probability. The fraction of correctable errors guaranteed by our analysis surpasses previous non-asymptotic results for LDPC codes, and in particular exceeds the best previous finite-length result on LP decoding by a factor greater than ten. This improvement stems in part from our analysis of probabilistic bi","authors_text":"Alexandros G. Dimakis, Constantinos Daskalakis, Martin J. Wainwright, Richard M. Karp","cross_cats":["cs.DM","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-02-02T06:30:48Z","title":"Probabilistic Analysis of Linear Programming Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702014","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:1a033cc36f2eed5c6d916a57fd1f189776376a9da7b28506013de88147ef1806","target":"record","created_at":"2026-05-18T00:58:56Z","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":"ef450ffc7000586f0f1e5111f5e795dc2593d462f92434173f644380c5687297","cross_cats_sorted":["cs.DM","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-02-02T06:30:48Z","title_canon_sha256":"0654ea037adc74abff4801febc0b608d896c6a9a8a00115993c41fb2ae5eda4c"},"schema_version":"1.0","source":{"id":"cs/0702014","kind":"arxiv","version":2}},"canonical_sha256":"899d7497c85584a2f3bb5c458e3d900afc9a941f2f1abbdfedd5d9dcb4215b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"899d7497c85584a2f3bb5c458e3d900afc9a941f2f1abbdfedd5d9dcb4215b10","first_computed_at":"2026-05-18T00:58:56.166785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:56.166785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DiJgDnr19euwjjTpw9PnmA5HtDlJvJ/J1olOk2WBHiXHTTuvmSI9ja7falKrQWgkG6jN1qxc/ZZw659yHI+BAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:56.167637Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0702014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a033cc36f2eed5c6d916a57fd1f189776376a9da7b28506013de88147ef1806","sha256:b5ea8e2ac637041b3d59bafccbcc8a583964fff04caf4f63662864f0177c1453"],"state_sha256":"5b9e2426d7318282858e4f8630bb73ab4ea560daa050d23a77d6e75ba93d2031"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOjxjSYOC8br6xsHW6J3wo6Z41EHqDlRTqHlyWCnLd8JX+sPCkcZvTTxnhmJQTfWcjmWInTSrT7eHBTxEj8qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:44:57.560671Z","bundle_sha256":"692eaf77b2454f93606ee0ace540404e4b7850272e121ef8cc09571492b2d858"}}