{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I5DF3H3ZDBTUMPOUKQEVKTF4SF","short_pith_number":"pith:I5DF3H3Z","canonical_record":{"source":{"id":"1402.0052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-01T05:05:12Z","cross_cats_sorted":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"title_canon_sha256":"0a4aa3f3823bfbc8e85283ce3e04c510993fa5411f4586afc4b4d467c74f1d51","abstract_canon_sha256":"8ef3189c28f086dee199ae52fb6a36ff91c6dcf0cebfb5d93f0e4d5faca77ab4"},"schema_version":"1.0"},"canonical_sha256":"47465d9f791867463dd45409554cbc91530d6b4c6a165ffc8160da263f04e7c5","source":{"kind":"arxiv","id":"1402.0052","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0052","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0052v2","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0052","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"I5DF3H3ZDBTU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I5DF3H3ZDBTUMPOU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I5DF3H3Z","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I5DF3H3ZDBTUMPOUKQEVKTF4SF","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-01T05:05:12Z","cross_cats_sorted":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"title_canon_sha256":"0a4aa3f3823bfbc8e85283ce3e04c510993fa5411f4586afc4b4d467c74f1d51","abstract_canon_sha256":"8ef3189c28f086dee199ae52fb6a36ff91c6dcf0cebfb5d93f0e4d5faca77ab4"},"schema_version":"1.0"},"canonical_sha256":"47465d9f791867463dd45409554cbc91530d6b4c6a165ffc8160da263f04e7c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:26.119793Z","signature_b64":"Zscnw3W8g/Zvgu60AtsC/cfhKmhoPtFqLO8wT53Yl8PPfLwGKr9qSoHq1r5vuJ8alv1bMTIRTsEyt5DjqhjIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47465d9f791867463dd45409554cbc91530d6b4c6a165ffc8160da263f04e7c5","last_reissued_at":"2026-05-18T02:41:26.119360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:26.119360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0052","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-18T02:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azrrVzTRo6jk02KYZS7e2gtIYQuBIt8GZ/h8k1qB+b0GqhHR717VidID12P0q4KP+lxlGo1Sz1SMUhCOydQJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:31:36.905929Z"},"content_sha256":"b912e5aeeed5f3a8f4a3e6212bb02abf43bde2f7c98e890f49b53287d8a65633","schema_version":"1.0","event_id":"sha256:b912e5aeeed5f3a8f4a3e6212bb02abf43bde2f7c98e890f49b53287d8a65633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I5DF3H3ZDBTUMPOUKQEVKTF4SF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"David Gamarnik, Madhu Sudan","submitted_at":"2014-02-01T05:05:12Z","abstract_excerpt":"We show that the Survey Propagation-guided decimation algorithm fails to find satisfying assignments on random instances of the \"Not-All-Equal-$K$-SAT\" problem if the number of message passing iterations is bounded by a constant independent of the size of the instance and the clause-to-variable ratio is above $(1+o_K(1)){2^{K-1}\\over K}\\log^2 K$ for sufficiently large $K$. Our analysis in fact applies to a broad class of algorithms described as \"sequential local algorithms\". Such algorithms iteratively set variables based on some local information and then recurse on the reduced instance. Surv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0052","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-18T02:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvo6WBor/5y2wSK0/L/+OsliAoGtfsBJOmnvIvBG9Vtf1U/jLZ/YUtuE+7eabhPfw3ve8T5vxFKAWwY56gpUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:31:36.906659Z"},"content_sha256":"eb54f968d4fb3363356ed329c20b02a6466ce3932487e80f93c6919e8d516d41","schema_version":"1.0","event_id":"sha256:eb54f968d4fb3363356ed329c20b02a6466ce3932487e80f93c6919e8d516d41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/bundle.json","state_url":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/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-26T21:31:36Z","links":{"resolver":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF","bundle":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/bundle.json","state":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I5DF3H3ZDBTUMPOUKQEVKTF4SF","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":"8ef3189c28f086dee199ae52fb6a36ff91c6dcf0cebfb5d93f0e4d5faca77ab4","cross_cats_sorted":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-01T05:05:12Z","title_canon_sha256":"0a4aa3f3823bfbc8e85283ce3e04c510993fa5411f4586afc4b4d467c74f1d51"},"schema_version":"1.0","source":{"id":"1402.0052","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0052","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0052v2","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0052","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"I5DF3H3ZDBTU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I5DF3H3ZDBTUMPOU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I5DF3H3Z","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:eb54f968d4fb3363356ed329c20b02a6466ce3932487e80f93c6919e8d516d41","target":"graph","created_at":"2026-05-18T02:41:26Z","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 show that the Survey Propagation-guided decimation algorithm fails to find satisfying assignments on random instances of the \"Not-All-Equal-$K$-SAT\" problem if the number of message passing iterations is bounded by a constant independent of the size of the instance and the clause-to-variable ratio is above $(1+o_K(1)){2^{K-1}\\over K}\\log^2 K$ for sufficiently large $K$. Our analysis in fact applies to a broad class of algorithms described as \"sequential local algorithms\". Such algorithms iteratively set variables based on some local information and then recurse on the reduced instance. Surv","authors_text":"David Gamarnik, Madhu Sudan","cross_cats":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-01T05:05:12Z","title":"Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0052","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:b912e5aeeed5f3a8f4a3e6212bb02abf43bde2f7c98e890f49b53287d8a65633","target":"record","created_at":"2026-05-18T02:41:26Z","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":"8ef3189c28f086dee199ae52fb6a36ff91c6dcf0cebfb5d93f0e4d5faca77ab4","cross_cats_sorted":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-01T05:05:12Z","title_canon_sha256":"0a4aa3f3823bfbc8e85283ce3e04c510993fa5411f4586afc4b4d467c74f1d51"},"schema_version":"1.0","source":{"id":"1402.0052","kind":"arxiv","version":2}},"canonical_sha256":"47465d9f791867463dd45409554cbc91530d6b4c6a165ffc8160da263f04e7c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47465d9f791867463dd45409554cbc91530d6b4c6a165ffc8160da263f04e7c5","first_computed_at":"2026-05-18T02:41:26.119360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:26.119360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zscnw3W8g/Zvgu60AtsC/cfhKmhoPtFqLO8wT53Yl8PPfLwGKr9qSoHq1r5vuJ8alv1bMTIRTsEyt5DjqhjIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:26.119793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0052","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b912e5aeeed5f3a8f4a3e6212bb02abf43bde2f7c98e890f49b53287d8a65633","sha256:eb54f968d4fb3363356ed329c20b02a6466ce3932487e80f93c6919e8d516d41"],"state_sha256":"641fcb6ff7658fc61268fd4b776e3c03cd1cef9e96a5970aaf9ac49f4ccba914"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvuwilO1S/jeZ7fVY97Ez08c/a8vxguCjYFvEmQCczKPgThS8GYhU4AEMN4yRvzOeZ3JQzHz+6alWg915dxvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:31:36.910257Z","bundle_sha256":"fe1cab914398f3fb3e2953b2d21d06dc4be141c528e043e81da4ac813a3beab3"}}