{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4NTP4XIPVJNSBLNM5TBDIFG3WX","short_pith_number":"pith:4NTP4XIP","schema_version":"1.0","canonical_sha256":"e366fe5d0faa5b20adacecc23414dbb5dba5ca0b35a1522d9704289b29db269c","source":{"kind":"arxiv","id":"2510.27012","version":3},"attestation_state":"computed","paper":{"title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Yumou Fei","submitted_at":"2025-10-30T21:24:51Z","abstract_excerpt":"The bounded-degree query model, introduced by Goldreich and Ron (\\textit{Algorithmica, 2002}), is a standard framework in graph property testing and sublinear-time algorithms. Many properties studied in this model, such as bipartiteness and 3-colorability of graphs, can be expressed as satisfiability of constraint satisfaction problems (CSPs). We prove that for the entire class of \\emph{unbounded-width} CSPs, testing satisfiability requires $\\Omega(n)$ queries in the bounded-degree model. This result unifies and generalizes several previous lower bounds. In particular, it applies to all CSPs t"},"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":"2510.27012","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-30T21:24:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bede365b6f04a16ad5a24d97918a0b46df9d4565171fed01130f477208ef823f","abstract_canon_sha256":"6c859b286e6d2d84074ce255ff434e10223afda3c7575f4179a6ee46555ed0a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:47.034309Z","signature_b64":"SDkm/33y/3LQ4HIvZvWNp84NWcK5IIjSKszFMlN3sVdf+1jJs3uu1EXlkuICCt55oqKV7bF4Edn1Kj7c7STTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e366fe5d0faa5b20adacecc23414dbb5dba5ca0b35a1522d9704289b29db269c","last_reissued_at":"2026-06-26T01:15:47.033816Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:47.033816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Yumou Fei","submitted_at":"2025-10-30T21:24:51Z","abstract_excerpt":"The bounded-degree query model, introduced by Goldreich and Ron (\\textit{Algorithmica, 2002}), is a standard framework in graph property testing and sublinear-time algorithms. Many properties studied in this model, such as bipartiteness and 3-colorability of graphs, can be expressed as satisfiability of constraint satisfaction problems (CSPs). We prove that for the entire class of \\emph{unbounded-width} CSPs, testing satisfiability requires $\\Omega(n)$ queries in the bounded-degree model. This result unifies and generalizes several previous lower bounds. In particular, it applies to all CSPs t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.27012","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.27012/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2510.27012","created_at":"2026-06-26T01:15:47.033869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.27012v3","created_at":"2026-06-26T01:15:47.033869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27012","created_at":"2026-06-26T01:15:47.033869+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NTP4XIPVJNS","created_at":"2026-06-26T01:15:47.033869+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NTP4XIPVJNSBLNM","created_at":"2026-06-26T01:15:47.033869+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NTP4XIP","created_at":"2026-06-26T01:15:47.033869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.01400","citing_title":"Near-Optimal Space Lower Bounds for Streaming CSPs","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX","json":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX.json","graph_json":"https://pith.science/api/pith-number/4NTP4XIPVJNSBLNM5TBDIFG3WX/graph.json","events_json":"https://pith.science/api/pith-number/4NTP4XIPVJNSBLNM5TBDIFG3WX/events.json","paper":"https://pith.science/paper/4NTP4XIP"},"agent_actions":{"view_html":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX","download_json":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX.json","view_paper":"https://pith.science/paper/4NTP4XIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.27012&json=true","fetch_graph":"https://pith.science/api/pith-number/4NTP4XIPVJNSBLNM5TBDIFG3WX/graph.json","fetch_events":"https://pith.science/api/pith-number/4NTP4XIPVJNSBLNM5TBDIFG3WX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/action/storage_attestation","attest_author":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/action/author_attestation","sign_citation":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/action/citation_signature","submit_replication":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/action/replication_record"}},"created_at":"2026-06-26T01:15:47.033869+00:00","updated_at":"2026-06-26T01:15:47.033869+00:00"}