{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UM7FPDMUJJXXAGZOXN4U66CP3L","short_pith_number":"pith:UM7FPDMU","canonical_record":{"source":{"id":"1105.4665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-24T01:11:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3d163127ad8c0cd73e44c331fe7ebc2d7206e767e188c4fca9e91d75972f001","abstract_canon_sha256":"ef75d2ff1318ca16c736febae2ba8e1c6b5ca89627df656c58111c8fe212168c"},"schema_version":"1.0"},"canonical_sha256":"a33e578d944a6f701b2ebb794f784fdaf2be4cd14de0a2c2636160c6b89a3e81","source":{"kind":"arxiv","id":"1105.4665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4665","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4665v1","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4665","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"UM7FPDMUJJXX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UM7FPDMUJJXXAGZO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UM7FPDMU","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UM7FPDMUJJXXAGZOXN4U66CP3L","target":"record","payload":{"canonical_record":{"source":{"id":"1105.4665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-24T01:11:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3d163127ad8c0cd73e44c331fe7ebc2d7206e767e188c4fca9e91d75972f001","abstract_canon_sha256":"ef75d2ff1318ca16c736febae2ba8e1c6b5ca89627df656c58111c8fe212168c"},"schema_version":"1.0"},"canonical_sha256":"a33e578d944a6f701b2ebb794f784fdaf2be4cd14de0a2c2636160c6b89a3e81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:49.987748Z","signature_b64":"51q5+EG7x/FJsREMSvCt02y1Gg9LOUSQp/XC47hnObOml/hh1EZT6ey7laldRjuQCcv0jkOsdfGG+07Ssi2ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a33e578d944a6f701b2ebb794f784fdaf2be4cd14de0a2c2636160c6b89a3e81","last_reissued_at":"2026-05-18T02:21:49.987230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:49.987230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.4665","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-05-18T02:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsc+y0dvXOTqlWf9yHlY2kxzFAPBGUEWmzyVICSbgIBYXweWZCd/2D936sN1cyNsSHR/tzJv9n44ayfoTKPWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:06:49.454282Z"},"content_sha256":"3bd09dc6df65b19815916b9f0e19640f67f929487bcff0a5932463a1b155d9d1","schema_version":"1.0","event_id":"sha256:3bd09dc6df65b19815916b9f0e19640f67f929487bcff0a5932463a1b155d9d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UM7FPDMUJJXXAGZOXN4U66CP3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Linear Programming Decoding using Frustrated Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jason K. Johnson, Misha Chertkov, Shrinivas Kudekar","submitted_at":"2011-05-24T01:11:21Z","abstract_excerpt":"We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In general, the linear programming decoder is suboptimal. I.e., the word error rate is higher than the optimal, maximum a posteriori decoder.\n  In this paper we present a systematic approach to enhance the linear program decoder. More precisely, in the cases where the linear program outputs a fractional solution, we give a simple algorithm to identify frustrated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4665","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":""},"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-18T02:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5sV9aEI7FbUUFuW/sOw9UH4TQ3/aJ7uY0lGhygQLVDgHMeq2H6S71O+i9Y2QECYfjMhSsHxR1VSM0l3uZF6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:06:49.455082Z"},"content_sha256":"d5e1ce12e0d8344ec1f2237a994584ecf37c10edd2652e2104f4414ac84a1b57","schema_version":"1.0","event_id":"sha256:d5e1ce12e0d8344ec1f2237a994584ecf37c10edd2652e2104f4414ac84a1b57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UM7FPDMUJJXXAGZOXN4U66CP3L/bundle.json","state_url":"https://pith.science/pith/UM7FPDMUJJXXAGZOXN4U66CP3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UM7FPDMUJJXXAGZOXN4U66CP3L/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-31T23:06:49Z","links":{"resolver":"https://pith.science/pith/UM7FPDMUJJXXAGZOXN4U66CP3L","bundle":"https://pith.science/pith/UM7FPDMUJJXXAGZOXN4U66CP3L/bundle.json","state":"https://pith.science/pith/UM7FPDMUJJXXAGZOXN4U66CP3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UM7FPDMUJJXXAGZOXN4U66CP3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UM7FPDMUJJXXAGZOXN4U66CP3L","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":"ef75d2ff1318ca16c736febae2ba8e1c6b5ca89627df656c58111c8fe212168c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-24T01:11:21Z","title_canon_sha256":"a3d163127ad8c0cd73e44c331fe7ebc2d7206e767e188c4fca9e91d75972f001"},"schema_version":"1.0","source":{"id":"1105.4665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4665","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4665v1","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4665","created_at":"2026-05-18T02:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"UM7FPDMUJJXX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UM7FPDMUJJXXAGZO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UM7FPDMU","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:d5e1ce12e0d8344ec1f2237a994584ecf37c10edd2652e2104f4414ac84a1b57","target":"graph","created_at":"2026-05-18T02:21:49Z","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 consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In general, the linear programming decoder is suboptimal. I.e., the word error rate is higher than the optimal, maximum a posteriori decoder.\n  In this paper we present a systematic approach to enhance the linear program decoder. More precisely, in the cases where the linear program outputs a fractional solution, we give a simple algorithm to identify frustrated ","authors_text":"Jason K. Johnson, Misha Chertkov, Shrinivas Kudekar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-24T01:11:21Z","title":"Improved Linear Programming Decoding using Frustrated Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4665","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:3bd09dc6df65b19815916b9f0e19640f67f929487bcff0a5932463a1b155d9d1","target":"record","created_at":"2026-05-18T02:21:49Z","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":"ef75d2ff1318ca16c736febae2ba8e1c6b5ca89627df656c58111c8fe212168c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-24T01:11:21Z","title_canon_sha256":"a3d163127ad8c0cd73e44c331fe7ebc2d7206e767e188c4fca9e91d75972f001"},"schema_version":"1.0","source":{"id":"1105.4665","kind":"arxiv","version":1}},"canonical_sha256":"a33e578d944a6f701b2ebb794f784fdaf2be4cd14de0a2c2636160c6b89a3e81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a33e578d944a6f701b2ebb794f784fdaf2be4cd14de0a2c2636160c6b89a3e81","first_computed_at":"2026-05-18T02:21:49.987230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:49.987230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51q5+EG7x/FJsREMSvCt02y1Gg9LOUSQp/XC47hnObOml/hh1EZT6ey7laldRjuQCcv0jkOsdfGG+07Ssi2ODQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:49.987748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.4665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bd09dc6df65b19815916b9f0e19640f67f929487bcff0a5932463a1b155d9d1","sha256:d5e1ce12e0d8344ec1f2237a994584ecf37c10edd2652e2104f4414ac84a1b57"],"state_sha256":"89cb07434c2c970f7125f0691240662103a24b317812de89c1e5e680e558104a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZXkMV3cgxpzfFRPCmHuhT+hNDMSAeuOFtmlmgr4mkpe01qQ5d0/XcX93zNnZ9z6ABuCtgPKYmoseItt3FmDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:06:49.459100Z","bundle_sha256":"a0138d26f488b97efba5616fa5d7867f524ab8977197a1aff0b26740c1d165a0"}}