{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4NTP4XIPVJNSBLNM5TBDIFG3WX","short_pith_number":"pith:4NTP4XIP","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"},"canonical_sha256":"e366fe5d0faa5b20adacecc23414dbb5dba5ca0b35a1522d9704289b29db269c","source":{"kind":"arxiv","id":"2510.27012","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.27012","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"2510.27012v3","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27012","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"4NTP4XIPVJNS","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"pith_short_16","alias_value":"4NTP4XIPVJNSBLNM","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"pith_short_8","alias_value":"4NTP4XIP","created_at":"2026-06-26T01:15:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4NTP4XIPVJNSBLNM5TBDIFG3WX","target":"record","payload":{"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"},"canonical_sha256":"e366fe5d0faa5b20adacecc23414dbb5dba5ca0b35a1522d9704289b29db269c","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"},"source_kind":"arxiv","source_id":"2510.27012","source_version":3,"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-06-26T01:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAhFaEnPim/pKpjVpNuqQ/B0EXjOhHieN+aOXBeOQ9msH3hIbPf3tFdOxdgpNT8+rBKdLppJx2b1rMBbhnG6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:35:45.782189Z"},"content_sha256":"04484d7d73ef3f9d393ebbd3d6671a00169a30bff6c62ea1eef0ca4611d117aa","schema_version":"1.0","event_id":"sha256:04484d7d73ef3f9d393ebbd3d6671a00169a30bff6c62ea1eef0ca4611d117aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4NTP4XIPVJNSBLNM5TBDIFG3WX","target":"graph","payload":{"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"},"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-06-26T01:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gV5YTBKbAak2TL0Ve43GkiloHnuMSFELH5b7vjisFMO6BxLkGuSz0koBd1MKtlLL9T0fJUTM6NTl3cx1RcBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:35:45.782571Z"},"content_sha256":"ca8c11e80f156ab373a173dd44cceeb080560858568bd8dc3ae599352f15c6fd","schema_version":"1.0","event_id":"sha256:ca8c11e80f156ab373a173dd44cceeb080560858568bd8dc3ae599352f15c6fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/bundle.json","state_url":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/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-07-05T04:35:45Z","links":{"resolver":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX","bundle":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/bundle.json","state":"https://pith.science/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NTP4XIPVJNSBLNM5TBDIFG3WX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4NTP4XIPVJNSBLNM5TBDIFG3WX","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":"6c859b286e6d2d84074ce255ff434e10223afda3c7575f4179a6ee46555ed0a4","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-30T21:24:51Z","title_canon_sha256":"bede365b6f04a16ad5a24d97918a0b46df9d4565171fed01130f477208ef823f"},"schema_version":"1.0","source":{"id":"2510.27012","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.27012","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"2510.27012v3","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27012","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"4NTP4XIPVJNS","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"pith_short_16","alias_value":"4NTP4XIPVJNSBLNM","created_at":"2026-06-26T01:15:47Z"},{"alias_kind":"pith_short_8","alias_value":"4NTP4XIP","created_at":"2026-06-26T01:15:47Z"}],"graph_snapshots":[{"event_id":"sha256:ca8c11e80f156ab373a173dd44cceeb080560858568bd8dc3ae599352f15c6fd","target":"graph","created_at":"2026-06-26T01:15:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.27012/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Yumou Fei","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.27012","kind":"arxiv","version":3},"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:04484d7d73ef3f9d393ebbd3d6671a00169a30bff6c62ea1eef0ca4611d117aa","target":"record","created_at":"2026-06-26T01:15:47Z","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":"6c859b286e6d2d84074ce255ff434e10223afda3c7575f4179a6ee46555ed0a4","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-30T21:24:51Z","title_canon_sha256":"bede365b6f04a16ad5a24d97918a0b46df9d4565171fed01130f477208ef823f"},"schema_version":"1.0","source":{"id":"2510.27012","kind":"arxiv","version":3}},"canonical_sha256":"e366fe5d0faa5b20adacecc23414dbb5dba5ca0b35a1522d9704289b29db269c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e366fe5d0faa5b20adacecc23414dbb5dba5ca0b35a1522d9704289b29db269c","first_computed_at":"2026-06-26T01:15:47.033816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:47.033816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDkm/33y/3LQ4HIvZvWNp84NWcK5IIjSKszFMlN3sVdf+1jJs3uu1EXlkuICCt55oqKV7bF4Edn1Kj7c7STTDQ==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:47.034309Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.27012","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04484d7d73ef3f9d393ebbd3d6671a00169a30bff6c62ea1eef0ca4611d117aa","sha256:ca8c11e80f156ab373a173dd44cceeb080560858568bd8dc3ae599352f15c6fd"],"state_sha256":"660eaf7e8ec284595fd0846b44a6eaf125675e2d72a729eab658009d900f54d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gWtgH3AnVuBWIf5pChCpgioBR7YxxAdyL9jHBLYtLDwpYSJOCkq6OVCkzEGTNHyhTp2xhwjr876Q+wKPzmjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T04:35:45.784478Z","bundle_sha256":"5e997ed73f4439ac8a3e445a015dd71cf753845acd66fd004ac26408c40d7e7d"}}