{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:75QQTEHNJKSJG7QDELXHGMLNJB","short_pith_number":"pith:75QQTEHN","canonical_record":{"source":{"id":"1410.4241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T21:45:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"288769096693c185554d9ce3bb7aea10cfd10beaffe06743c4496db2bac793cf","abstract_canon_sha256":"997e1f3a07e562e6ac1a47a7a7037516ed00ca3059afed3d9369c833ec32ec81"},"schema_version":"1.0"},"canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","source":{"kind":"arxiv","id":"1410.4241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4241","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4241v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4241","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"75QQTEHNJKSJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"75QQTEHNJKSJG7QD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"75QQTEHN","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:75QQTEHNJKSJG7QDELXHGMLNJB","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T21:45:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"288769096693c185554d9ce3bb7aea10cfd10beaffe06743c4496db2bac793cf","abstract_canon_sha256":"997e1f3a07e562e6ac1a47a7a7037516ed00ca3059afed3d9369c833ec32ec81"},"schema_version":"1.0"},"canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:56.589797Z","signature_b64":"ShdTyzNQZzS2vnX7CNoPiUwvyVB3FSCrCSUpQ7hFql3S/p1hInYW0cggmlvyiGILKaXlosgUEBwn7SE1bYehDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","last_reissued_at":"2026-05-18T02:39:56.589287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:56.589287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4241","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:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXM+Wv9wvt/uNgpGX27Tx6RQWcGsCyHDMJjs3TRbU/rRjQ7roCVxPDdp5JV9y2J96l9cRr+azbdW9wct+gKNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:25:27.278805Z"},"content_sha256":"26030089858fde55824139d7354e0c7bc080b9fcc7cc84da8a2f093610e39cd1","schema_version":"1.0","event_id":"sha256:26030089858fde55824139d7354e0c7bc080b9fcc7cc84da8a2f093610e39cd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:75QQTEHNJKSJG7QDELXHGMLNJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Badih Ghazi, Euiwoong Lee","submitted_at":"2014-10-15T21:45:59Z","abstract_excerpt":"Random (dv,dc)-regular LDPC codes are well-known to achieve the Shannon capacity of the binary symmetric channel (for sufficiently large dv and dc) under exponential time decoding. However, polynomial time algorithms are only known to correct a much smaller fraction of errors. One of the most powerful polynomial-time algorithms with a formal analysis is the LP decoding algorithm of Feldman et al. which is known to correct an Omega(1/dc) fraction of errors. In this work, we show that fairly powerful extensions of LP decoding, based on the Sherali-Adams and Lasserre hierarchies, fail to correct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4241","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:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Liave33/9HmGPlp6MTgxP22vLqwZzZVUM/ezj0KjmMUKH/2At6rjeY6zeeCVvZiKKep6llqJ8uH0vtikepQSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:25:27.279160Z"},"content_sha256":"9384d1c275c003a6b7812f5e78f95d4a465a18a0c08f56a056aff647f263d9d5","schema_version":"1.0","event_id":"sha256:9384d1c275c003a6b7812f5e78f95d4a465a18a0c08f56a056aff647f263d9d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/bundle.json","state_url":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75QQTEHNJKSJG7QDELXHGMLNJB/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-06-11T13:25:27Z","links":{"resolver":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB","bundle":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/bundle.json","state":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75QQTEHNJKSJG7QDELXHGMLNJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:75QQTEHNJKSJG7QDELXHGMLNJB","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":"997e1f3a07e562e6ac1a47a7a7037516ed00ca3059afed3d9369c833ec32ec81","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T21:45:59Z","title_canon_sha256":"288769096693c185554d9ce3bb7aea10cfd10beaffe06743c4496db2bac793cf"},"schema_version":"1.0","source":{"id":"1410.4241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4241","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4241v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4241","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"75QQTEHNJKSJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"75QQTEHNJKSJG7QD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"75QQTEHN","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:9384d1c275c003a6b7812f5e78f95d4a465a18a0c08f56a056aff647f263d9d5","target":"graph","created_at":"2026-05-18T02:39: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":"Random (dv,dc)-regular LDPC codes are well-known to achieve the Shannon capacity of the binary symmetric channel (for sufficiently large dv and dc) under exponential time decoding. However, polynomial time algorithms are only known to correct a much smaller fraction of errors. One of the most powerful polynomial-time algorithms with a formal analysis is the LP decoding algorithm of Feldman et al. which is known to correct an Omega(1/dc) fraction of errors. In this work, we show that fairly powerful extensions of LP decoding, based on the Sherali-Adams and Lasserre hierarchies, fail to correct ","authors_text":"Badih Ghazi, Euiwoong Lee","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T21:45:59Z","title":"LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4241","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:26030089858fde55824139d7354e0c7bc080b9fcc7cc84da8a2f093610e39cd1","target":"record","created_at":"2026-05-18T02:39: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":"997e1f3a07e562e6ac1a47a7a7037516ed00ca3059afed3d9369c833ec32ec81","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T21:45:59Z","title_canon_sha256":"288769096693c185554d9ce3bb7aea10cfd10beaffe06743c4496db2bac793cf"},"schema_version":"1.0","source":{"id":"1410.4241","kind":"arxiv","version":1}},"canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","first_computed_at":"2026-05-18T02:39:56.589287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:56.589287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ShdTyzNQZzS2vnX7CNoPiUwvyVB3FSCrCSUpQ7hFql3S/p1hInYW0cggmlvyiGILKaXlosgUEBwn7SE1bYehDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:56.589797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26030089858fde55824139d7354e0c7bc080b9fcc7cc84da8a2f093610e39cd1","sha256:9384d1c275c003a6b7812f5e78f95d4a465a18a0c08f56a056aff647f263d9d5"],"state_sha256":"832e299dfe6935596f032331fb0f9ad8a9695906fbb42c25b089d9efcc756c5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbXt/194r4yw6moc1FJ0oS0b6lll77X/tehVH8k9nom1gR7+iQHHd/WSgzJFFuqHnA6vzmtG0TPNr1QhEEW0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:25:27.281381Z","bundle_sha256":"75f638fa7d639d1cb283ff0e9b94c31cedd59ded3b937b76d05d636656914053"}}