{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:I5DF3H3ZDBTUMPOUKQEVKTF4SF","short_pith_number":"pith:I5DF3H3Z","schema_version":"1.0","canonical_sha256":"47465d9f791867463dd45409554cbc91530d6b4c6a165ffc8160da263f04e7c5","source":{"kind":"arxiv","id":"1402.0052","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.0052","created_at":"2026-05-18T02:41:26.119422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0052v2","created_at":"2026-05-18T02:41:26.119422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0052","created_at":"2026-05-18T02:41:26.119422+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5DF3H3ZDBTU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5DF3H3ZDBTUMPOU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5DF3H3Z","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF","json":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF.json","graph_json":"https://pith.science/api/pith-number/I5DF3H3ZDBTUMPOUKQEVKTF4SF/graph.json","events_json":"https://pith.science/api/pith-number/I5DF3H3ZDBTUMPOUKQEVKTF4SF/events.json","paper":"https://pith.science/paper/I5DF3H3Z"},"agent_actions":{"view_html":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF","download_json":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF.json","view_paper":"https://pith.science/paper/I5DF3H3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0052&json=true","fetch_graph":"https://pith.science/api/pith-number/I5DF3H3ZDBTUMPOUKQEVKTF4SF/graph.json","fetch_events":"https://pith.science/api/pith-number/I5DF3H3ZDBTUMPOUKQEVKTF4SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/action/storage_attestation","attest_author":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/action/author_attestation","sign_citation":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/action/citation_signature","submit_replication":"https://pith.science/pith/I5DF3H3ZDBTUMPOUKQEVKTF4SF/action/replication_record"}},"created_at":"2026-05-18T02:41:26.119422+00:00","updated_at":"2026-05-18T02:41:26.119422+00:00"}