{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TUANSWFSGR6OGOOE2JUDTT6KMD","short_pith_number":"pith:TUANSWFS","schema_version":"1.0","canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","source":{"kind":"arxiv","id":"1610.03029","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for CSP refutation by SDP hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Witmer, Ryuhei Mori","submitted_at":"2016-10-10T19:05:54Z","abstract_excerpt":"For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \\gg n$. The natural algorithmic task in this regime is \\emph{refutation}: finding a proof that a given random instance is unsatisfiable. Recent work of Allen et al. suggests that the difficulty of refuting CSP$(P)$ using an SDP is determined by a parameter $\\mathrm{cmplx}(P)$, the smallest $t$ for which there does not exist a $t$-wise uniform distribution over satisfying assignments to $P$. In particular they show that random instances of CSP$(P)$ wit"},"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":"1610.03029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-10T19:05:54Z","cross_cats_sorted":[],"title_canon_sha256":"886cb117b96a9388d2f2ee0469706b0624515b246cad192c875ce4fb73930bff","abstract_canon_sha256":"4cbcb002d76ba3f23294231369a111f3061d84b65f469efccc9c9efb626e1c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.159755Z","signature_b64":"I3L7VyAhG5601CUr1wrcBgfK46UCusYeMC2xJsVvurCdRFgaR/KhYJIHUuIwJLsFuSEHa74rIrqIH4bkPmcvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","last_reissued_at":"2026-05-18T01:02:50.159355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.159355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for CSP refutation by SDP hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Witmer, Ryuhei Mori","submitted_at":"2016-10-10T19:05:54Z","abstract_excerpt":"For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \\gg n$. The natural algorithmic task in this regime is \\emph{refutation}: finding a proof that a given random instance is unsatisfiable. Recent work of Allen et al. suggests that the difficulty of refuting CSP$(P)$ using an SDP is determined by a parameter $\\mathrm{cmplx}(P)$, the smallest $t$ for which there does not exist a $t$-wise uniform distribution over satisfying assignments to $P$. In particular they show that random instances of CSP$(P)$ wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03029","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.03029","created_at":"2026-05-18T01:02:50.159427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03029v1","created_at":"2026-05-18T01:02:50.159427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03029","created_at":"2026-05-18T01:02:50.159427+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUANSWFSGR6O","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUANSWFSGR6OGOOE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUANSWFS","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10479","citing_title":"Public Key Encryption from High-Corruption Constraint Satisfaction Problems","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD","json":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD.json","graph_json":"https://pith.science/api/pith-number/TUANSWFSGR6OGOOE2JUDTT6KMD/graph.json","events_json":"https://pith.science/api/pith-number/TUANSWFSGR6OGOOE2JUDTT6KMD/events.json","paper":"https://pith.science/paper/TUANSWFS"},"agent_actions":{"view_html":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD","download_json":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD.json","view_paper":"https://pith.science/paper/TUANSWFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03029&json=true","fetch_graph":"https://pith.science/api/pith-number/TUANSWFSGR6OGOOE2JUDTT6KMD/graph.json","fetch_events":"https://pith.science/api/pith-number/TUANSWFSGR6OGOOE2JUDTT6KMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/action/storage_attestation","attest_author":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/action/author_attestation","sign_citation":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/action/citation_signature","submit_replication":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/action/replication_record"}},"created_at":"2026-05-18T01:02:50.159427+00:00","updated_at":"2026-05-18T01:02:50.159427+00:00"}