{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:NTQ5FCPGJVHURNPA64LXFTUPWA","short_pith_number":"pith:NTQ5FCPG","canonical_record":{"source":{"id":"0812.0147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-11-30T15:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"ecc92c052a9ec0d80825735cd6eace96673006c0b57aa35dd703582b48436d72","abstract_canon_sha256":"94e66f1b709bf6406cce311ad86c3642f5ad6575840f8601a3e863df0eb31c31"},"schema_version":"1.0"},"canonical_sha256":"6ce1d289e64d4f48b5e0f71772ce8fb002edc1acc86c42fbb231454dfa8ffb97","source":{"kind":"arxiv","id":"0812.0147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.0147","created_at":"2026-05-18T04:32:34Z"},{"alias_kind":"arxiv_version","alias_value":"0812.0147v2","created_at":"2026-05-18T04:32:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.0147","created_at":"2026-05-18T04:32:34Z"},{"alias_kind":"pith_short_12","alias_value":"NTQ5FCPGJVHU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NTQ5FCPGJVHURNPA","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NTQ5FCPG","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:NTQ5FCPGJVHURNPA64LXFTUPWA","target":"record","payload":{"canonical_record":{"source":{"id":"0812.0147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-11-30T15:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"ecc92c052a9ec0d80825735cd6eace96673006c0b57aa35dd703582b48436d72","abstract_canon_sha256":"94e66f1b709bf6406cce311ad86c3642f5ad6575840f8601a3e863df0eb31c31"},"schema_version":"1.0"},"canonical_sha256":"6ce1d289e64d4f48b5e0f71772ce8fb002edc1acc86c42fbb231454dfa8ffb97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:34.216684Z","signature_b64":"D00/SfqFlwYbrS12vJWqUo096P88w5isWS/GDsvm67qPDimftVe6pbp9jWEEwFD9dFAw/CX2pBX+B5tTKvtIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce1d289e64d4f48b5e0f71772ce8fb002edc1acc86c42fbb231454dfa8ffb97","last_reissued_at":"2026-05-18T04:32:34.216181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:34.216181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0812.0147","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-18T04:32:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ih5o9uQEGFo4H0Z2XZPzqdCbq5CLrXU5F7GJFhxA8ncgu+s61a7xdz84D02MV93tgAnsuVlpriURhfL2WuGUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:03:44.841890Z"},"content_sha256":"5c790318eebbfa4625396d3175e6554edbc4b86d22eed3b0ff27a3938d762995","schema_version":"1.0","event_id":"sha256:5c790318eebbfa4625396d3175e6554edbc4b86d22eed3b0ff27a3938d762995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:NTQ5FCPGJVHURNPA64LXFTUPWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete convergence of message passing algorithms for some satisfiability problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dan Vilenchik, Elchanan Mossel, Uriel Feige","submitted_at":"2008-11-30T15:22:30Z","abstract_excerpt":"In this paper we analyze the performance of Warning Propagation, a popular message passing algorithm. We show that for 3CNF formulas drawn from a certain distribution over random satisfiable 3CNF formulas, commonly referred to as the planted-assignment distribution, running Warning Propagation in the standard way (run message passing until convergence, simplify the formula according to the resulting assignment, and satisfy the remaining subformula, if necessary, using a simple \"off the shelf\" heuristic) results in a satisfying assignment when the clause-variable ratio is a sufficiently large c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.0147","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-18T04:32:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRTYRsBcQGJv4hV+zs3K/mprbNrK/aLneX9zU/wwEltMvXib/2+pESstxJUVu/715EM26jFwow0+9oxzkGiJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:03:44.842227Z"},"content_sha256":"0e653d3e5e7aae2a2dc25b8db33b91d4805b16d01be6e35054237213ff38d295","schema_version":"1.0","event_id":"sha256:0e653d3e5e7aae2a2dc25b8db33b91d4805b16d01be6e35054237213ff38d295"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTQ5FCPGJVHURNPA64LXFTUPWA/bundle.json","state_url":"https://pith.science/pith/NTQ5FCPGJVHURNPA64LXFTUPWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTQ5FCPGJVHURNPA64LXFTUPWA/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-01T23:03:44Z","links":{"resolver":"https://pith.science/pith/NTQ5FCPGJVHURNPA64LXFTUPWA","bundle":"https://pith.science/pith/NTQ5FCPGJVHURNPA64LXFTUPWA/bundle.json","state":"https://pith.science/pith/NTQ5FCPGJVHURNPA64LXFTUPWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTQ5FCPGJVHURNPA64LXFTUPWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:NTQ5FCPGJVHURNPA64LXFTUPWA","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":"94e66f1b709bf6406cce311ad86c3642f5ad6575840f8601a3e863df0eb31c31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-11-30T15:22:30Z","title_canon_sha256":"ecc92c052a9ec0d80825735cd6eace96673006c0b57aa35dd703582b48436d72"},"schema_version":"1.0","source":{"id":"0812.0147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.0147","created_at":"2026-05-18T04:32:34Z"},{"alias_kind":"arxiv_version","alias_value":"0812.0147v2","created_at":"2026-05-18T04:32:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.0147","created_at":"2026-05-18T04:32:34Z"},{"alias_kind":"pith_short_12","alias_value":"NTQ5FCPGJVHU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NTQ5FCPGJVHURNPA","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NTQ5FCPG","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:0e653d3e5e7aae2a2dc25b8db33b91d4805b16d01be6e35054237213ff38d295","target":"graph","created_at":"2026-05-18T04:32:34Z","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":"In this paper we analyze the performance of Warning Propagation, a popular message passing algorithm. We show that for 3CNF formulas drawn from a certain distribution over random satisfiable 3CNF formulas, commonly referred to as the planted-assignment distribution, running Warning Propagation in the standard way (run message passing until convergence, simplify the formula according to the resulting assignment, and satisfy the remaining subformula, if necessary, using a simple \"off the shelf\" heuristic) results in a satisfying assignment when the clause-variable ratio is a sufficiently large c","authors_text":"Dan Vilenchik, Elchanan Mossel, Uriel Feige","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-11-30T15:22:30Z","title":"Complete convergence of message passing algorithms for some satisfiability problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.0147","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:5c790318eebbfa4625396d3175e6554edbc4b86d22eed3b0ff27a3938d762995","target":"record","created_at":"2026-05-18T04:32:34Z","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":"94e66f1b709bf6406cce311ad86c3642f5ad6575840f8601a3e863df0eb31c31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-11-30T15:22:30Z","title_canon_sha256":"ecc92c052a9ec0d80825735cd6eace96673006c0b57aa35dd703582b48436d72"},"schema_version":"1.0","source":{"id":"0812.0147","kind":"arxiv","version":2}},"canonical_sha256":"6ce1d289e64d4f48b5e0f71772ce8fb002edc1acc86c42fbb231454dfa8ffb97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ce1d289e64d4f48b5e0f71772ce8fb002edc1acc86c42fbb231454dfa8ffb97","first_computed_at":"2026-05-18T04:32:34.216181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:34.216181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D00/SfqFlwYbrS12vJWqUo096P88w5isWS/GDsvm67qPDimftVe6pbp9jWEEwFD9dFAw/CX2pBX+B5tTKvtIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:34.216684Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.0147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c790318eebbfa4625396d3175e6554edbc4b86d22eed3b0ff27a3938d762995","sha256:0e653d3e5e7aae2a2dc25b8db33b91d4805b16d01be6e35054237213ff38d295"],"state_sha256":"107b2912427776c8790f4b7b90741ee7034ff12d4f5cd294aa02b397ee85163f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBL5cnNjQSv5wY1Y4GH7ALTsOb3ideSPicOZiefazPG0DPE+ue1EL7HsQbeZO8/XTWB9/L4Cn/DgCvDLjkCyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:03:44.844476Z","bundle_sha256":"7256c48f7ef1dcc3b43137e1a0455273d76271a0904fcfc596f8b9d96c9fa5b8"}}