{"as_of":"2026-08-21T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:955b0867fd033a6e495298c8cc0b11bae8343de1b1a55a6ab60aaca6887208c7","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:22:19.921938Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T21:26:02.324238Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T21:28:17.598277Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"cited_work":{"arxiv_id":"2510.27012","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2510.27012","snapshot_observed_at":"2026-06-26T02:16:19.283275Z","title":"Unbounded-width csps are untestable in a sublinear number of queries","venue":null,"work_id":"a6fc8051-a8ef-460f-bfad-66b7498ca8e2","year":null},"citing_paper":{"arxiv_id":"2604.01400","last_updated":"2026-04-01T21:01:17Z","snapshot_observed_at":"2026-08-17T11:23:00.372906Z","submitted_at":"2026-04-01T21:01:17Z","title":"Near-Optimal Space Lower Bounds for Streaming CSPs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:02.324238Z"},"links":{"cited_paper":"/paper/2510.27012","citing_paper":"/paper/2604.01400"},"observation_digest":"sha256:4535b63048dabf6e7af9fe7c95289e0fc068a51cc7703c1e63ca84f1d3ac92e8","observation_id":"1b343920-1021-4a0b-bad2-69b426bf016d","resolution":{"observed_at":"2026-06-26T02:16:19.283275Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2510.27012/citation-record","integrity":"/paper/2510.27012/integrity","json":"/paper/2510.27012/citation-record.json","paper":"/paper/2510.27012"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.18382","last_updated":"2025-03-13T13:07:38Z","snapshot_observed_at":"2026-08-21T08:51:33.090435Z","submitted_at":"2025-02-25T17:25:16Z","title":"Property Testing in Bounded Degree Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18382","snapshot_observed_at":"2026-08-04T07:22:15.514211Z","title":"Property testing in bounded degree hypergraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:15.514211Z"},"links":{"cited_paper":"/paper/2502.18382","citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:954adbb7f139d9a278ed168ef9a3765e04d07a4d0237b16a0649c7ef04d56ef1","observation_id":"976bb744-755d-43bc-9fc1-ba255d1eb7b8","resolution":{"observed_at":"2026-08-04T07:22:15.514211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:15.601128Z","title":"Polynomial time approximation schemes for dense instances of np-hard problems","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:15.601128Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:eb3a9e18ddec7db5ec8e5002b6241db6d469c33c31887af33e37db4653436346","observation_id":"93ead4dc-18c5-47b0-b42c-a107b8a1c768","resolution":{"observed_at":"2026-08-04T07:22:15.601128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:15.685710Z","title":"Testing satisfiability","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:15.685710Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:d145c5782705cb823939ccde6ac86bcb289c74ef7d2d0204af3b3d75e514a9a9","observation_id":"fd5d9902-f88e-4310-b0f7-16978094ec68","resolution":{"observed_at":"2026-08-04T07:22:15.685710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:15.813876Z","title":"The collapse of the bounded width hierarchy","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:15.813876Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:438b01585bb16703014892bd9c1a7aa14577d617c632bec7f560eb542f4dfd49","observation_id":"dbfa0ff3-65f7-4efa-8287-dcb272f1e81a","resolution":{"observed_at":"2026-08-04T07:22:15.813876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:15.910745Z","title":"Constraint satisfaction problems solvable by local consistency methods","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:15.910745Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:406f53a47f4e0d8921141ddc377b779ce5784221107d6ef5be92c3896dc1f61a","observation_id":"6883c2ed-95b6-4e7c-8414-7cd4439050c5","resolution":{"observed_at":"2026-08-04T07:22:15.910745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:16.074749Z","title":"Robustly solvable constraint satisfaction problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.074749Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:0da458ae3f44e0bffbaa9dcd331301d65bcc92265eb3c98127783d9234652ad1","observation_id":"f4564d87-3f35-433c-ac33-9f74b6b67e50","resolution":{"observed_at":"2026-08-04T07:22:16.074749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:16.217322Z","title":"A lower bound for testing 3-colorability in bounded-degree graphs","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.217322Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:c0ee8f803251ed74485e3409609744d9abe8a12dae355db0c5973d4684979a73","observation_id":"76cc531f-fdd1-469f-9718-051934d5152a","resolution":{"observed_at":"2026-08-04T07:22:16.217322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07383","last_updated":"2025-05-26T16:53:31Z","snapshot_observed_at":"2026-08-16T16:24:19.551625Z","submitted_at":"2022-10-13T21:59:55Z","title":"Notes on CSPs and Polymorphisms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07383","snapshot_observed_at":"2026-08-04T07:22:16.364751Z","title":"Notes on csps and polymorphisms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.364751Z"},"links":{"cited_paper":"/paper/2210.07383","citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:5a6752e0146f06866647a32880a074509413b900eba3fe533fe7b8a2d78c0b05","observation_id":"25151dd6-9ca3-4b0b-891f-ec8a15c0bfc5","resolution":{"observed_at":"2026-08-04T07:22:16.364751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:16.473593Z","title":"Every minor-closed property of sparse graphs is testable","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.473593Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:5e168bf9f69db72538bf691fac16a3b887f8564d9feed98e11dfc455a7c506da","observation_id":"0c406a36-fa14-40d7-9fe2-9282bdb47bd3","resolution":{"observed_at":"2026-08-04T07:22:16.473593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:16.623828Z","title":"Linear space streaming lower bounds for approximating csps","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.623828Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:42238b8ea1b04a50b8c907b046e274b77aba5aed50571d16348d16fc611323ce","observation_id":"dcc16949-9194-4705-a769-8d4fe804e37e","resolution":{"observed_at":"2026-08-04T07:22:16.623828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:16.814753Z","title":"Sketching approximability of all finite csps","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.814753Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:10fdc479bc8a3ed5d382de819aeb35105b90d404a3b1839a64a6073067a14c9b","observation_id":"aedf29bb-9905-401f-8540-6974322dac8f","resolution":{"observed_at":"2026-08-04T07:22:16.814753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:16.871910Z","title":"Planar graphs: Random walks and bipartiteness testing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:16.871910Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:08a0aad70c3cadc29b4bdc7479bf79756e8ec7396c6b65e5ecd5ddbace0a2205","observation_id":"d2d3b38b-315d-41ca-8d23-07ac284cc0c5","resolution":{"observed_at":"2026-08-04T07:22:16.871910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.005323Z","title":"Robust satisfiability for csps: Hardness and algorithmic results","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.005323Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:0855ca1363fb9b128a87dfb9d7f41bbf6f6c5ac6f95c5d5f8ab310932e2a6d8e","observation_id":"46c81d8d-d5eb-47f3-99f4-2d97f27afa2f","resolution":{"observed_at":"2026-08-04T07:22:17.005323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.138890Z","title":"A dichotomy theorem for multi-pass streaming csps","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.138890Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:ccc270e7de553e483f2adacc388df8f77442a5ba8ef53141615e112154ef8579","observation_id":"dc700a37-0f50-4872-976a-2e339dfadace","resolution":{"observed_at":"2026-08-04T07:22:17.138890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23404","last_updated":"2025-09-04T21:08:42Z","snapshot_observed_at":"2026-08-16T12:45:37.370720Z","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.23404","snapshot_observed_at":"2026-08-04T07:22:17.259101Z","title":"Multi-pass streaming lower bounds for approximating max-cut","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.259101Z"},"links":{"cited_paper":"/paper/2503.23404","citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:b22a5d38dcb30dbbb30f9e1a07dd94ec08c9681e1be012d7042726a28598d87c","observation_id":"eac557c7-4ea9-409f-b7f3-f744f6242cf8","resolution":{"observed_at":"2026-08-04T07:22:17.259101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.425525Z","title":"The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.425525Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:0e0c8b22987c931266c88d05e0f34dabe9a6663bb57a6f37ce46fa4ea33fb194","observation_id":"05ed584e-d9b5-48fc-823c-9f9ad4ea217b","resolution":{"observed_at":"2026-08-04T07:22:17.425525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.501797Z","title":"Closed systems of functions and predicates","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.501797Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:b62f3424ae00a793401b8808d7914838c1c40169d2a4bdf36fdcdf9be2ab9f34","observation_id":"3103c0be-912b-4c83-8a44-023e4a7bec2f","resolution":{"observed_at":"2026-08-04T07:22:17.501797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.641913Z","title":"Property testing and its connection to learning and approximation","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.641913Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:f498b7d230f4774f2d1d8f2414918e19390235f024577ee4a10746f3c44d73f6","observation_id":"4cf9986b-5af1-49d4-8279-dbeefded857f","resolution":{"observed_at":"2026-08-04T07:22:17.641913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.782725Z","title":"A sublinear bipartiteness tester for bounded degree graphs","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.782725Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:0b5f23e0547815bc3f0ff84eee56a03822e9b49807d7b8ab112188a13f24e5c1","observation_id":"58a68a9d-d911-4f72-b731-3a57aa75f8a8","resolution":{"observed_at":"2026-08-04T07:22:17.782725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.858234Z","title":"Property testing in bounded degree graphs","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.858234Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:30e34ca9c886e215410d022ba23a797202c4888eb7ae37fafc78cfbddbd70264","observation_id":"988bc484-37ff-4806-a1e8-87494f61bd8d","resolution":{"observed_at":"2026-08-04T07:22:17.858234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:17.925277Z","title":"On testing expansion in bounded-degree graphs","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.925277Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:d9ea58d6c4087f9ffa3f17b3d82fc2a1eb820636084c6a4679a6df96322662da","observation_id":"eafdfad6-3993-472a-8385-a07e8736d238","resolution":{"observed_at":"2026-08-04T07:22:17.925277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.011656Z","title":"Tight bounds on the approximability of almost-satisfiable horn sat and exact hitting set","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.011656Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:02384c851d426f317ad1f97021788e4131d35f3f26bdf5674ebec5c797cd1333","observation_id":"8423b95d-d23c-43ea-95c3-60d985d002ac","resolution":{"observed_at":"2026-08-04T07:22:18.011656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.124750Z","title":"Some optimal inapproximability results","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.124750Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:682bfaecc09569e826ed0f2a696d8cbb8ef8cb2cad9ef6ddb0b2f390bf4a42ba","observation_id":"3ab5ebea-57c1-4712-be14-991f6edcb8e7","resolution":{"observed_at":"2026-08-04T07:22:18.124750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.234752Z","title":"The structure of finite algebras , volume 76","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.234752Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:c7a314e5234665f804da623c3366cad488ace970c4c7cbf26b0af6eb642eca59","observation_id":"3c1d3da9-24c2-4935-8c99-3ec84fe617d8","resolution":{"observed_at":"2026-08-04T07:22:18.234752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.404751Z","title":"On the power of unique 2-prover 1-round games","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.404751Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:fc7f4863fe3ba5059eaefa9a7657d2f120d66e22c6a5b5039c16277d17efe526","observation_id":"32d156d0-0b64-470b-89a7-7434a7aac8fb","resolution":{"observed_at":"2026-08-04T07:22:18.404751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.614750Z","title":"An optimal space lower bound for approximating max-cut","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.614750Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:b9587bdf11fb782b5e2285a5c98e383bae52346ec26ba42c2f34b576993df49d","observation_id":"85a4ffa7-f385-4d96-9460-1cf4085341aa","resolution":{"observed_at":"2026-08-04T07:22:18.614750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.753015Z","title":"Streaming lower bounds for approximating max-cut","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.753015Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:ddceb7f36549a7cdd2ed51b33114a6fac8b57a5e69c0f10ed673c26c0609669b","observation_id":"400bbbc0-8bec-4395-b423-e16dab00502e","resolution":{"observed_at":"2026-08-04T07:22:18.753015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:18.910869Z","title":"Bounded width problems and algebras","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:18.910869Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:c781d72ab768352db0029f41e2e3f33660ae1d25c5e6216eca38e57900418eeb","observation_id":"a11cd1fa-1f28-42f0-9422-e9f5ce58ca1d","resolution":{"observed_at":"2026-08-04T07:22:18.910869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.037972Z","title":"Optimal algorithms and inapproximability results for every csp? In Proceedings of the fortieth annual ACM symposium on Theory of computing , pages 245--254, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.037972Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:e8c0191f1cfbba94a6abcf4accf0b3e8b3b97d59088d7a55aa8393c07135811e","observation_id":"eb53fe4f-a3c2-4718-b127-4f8b054d3328","resolution":{"observed_at":"2026-08-04T07:22:19.037972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.171987Z","title":"Streaming algorithms via local algorithms for maximum directed cut","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.171987Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:08b6612c10bcdf0d1480ac124eb10a40d9b5c40e52584ab72bcf6b075f95df99","observation_id":"f81a3b5f-dcd6-4bef-bf53-82f6336b138c","resolution":{"observed_at":"2026-08-04T07:22:19.171987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.340528Z","title":"A survey on strictly simple algebras and minimal varieties","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.340528Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:0998472105107ea4853e423b6eb845fdaa93c2d9dcdc08696dc49b85bab5f63f","observation_id":"207185f6-8a77-4657-9c2a-312aaf311037","resolution":{"observed_at":"2026-08-04T07:22:19.340528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.416227Z","title":"Non-approximability results for optimization problems on bounded degree instances","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.416227Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:54f5b59f1a3315905d26a3979e4322c06151f7b8881f643361b06b37ace81b3f","observation_id":"823315da-194c-413e-b92f-5a18fc04ffb2","resolution":{"observed_at":"2026-08-04T07:22:19.416227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.484742Z","title":"A subalgebra intersection property for congruence distributive varieties","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.484742Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:a5acaf4cd4ff2b23ed69c3e06c7d241f10adb63d72ef0f98d56565ead2af3039","observation_id":"d9ac98da-0cc1-4154-bcec-8b0f5662fc78","resolution":{"observed_at":"2026-08-04T07:22:19.484742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.566203Z","title":"Probability in high dimension (lecture notes), 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.566203Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:f587eb69c105c8922a55f03f8179125eff97b4034b8689db13ef8a53afb04cab","observation_id":"3d6200db-be84-48f6-acff-c8a888a86936","resolution":{"observed_at":"2026-08-04T07:22:19.566203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.694475Z","title":"Models of random regular graphs","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.694475Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:f69eb674390d8c8088a532440ad99fd8e39c72cee8a28d84003ae033da00ba50","observation_id":"906684d7-f62f-42c2-ad26-70b724ecc3b3","resolution":{"observed_at":"2026-08-04T07:22:19.694475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.774220Z","title":"Query-number preserving reductions and linear lower bounds for testing","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.774220Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:ae8fff69664891e02991bdb1a0c997f7d927302b0264974262a4b198c90a2479","observation_id":"8fd1907a-8d58-489b-bc64-5840569407cf","resolution":{"observed_at":"2026-08-04T07:22:19.774220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.844458Z","title":"Property testing on k-vertex-connectivity of graphs","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.844458Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:b37f5072e893e203c8f18c2428169b6c98534ac41c4ce87d96bd19f525462e08","observation_id":"616409c1-93db-4c16-b1d1-5c28305ac8a1","resolution":{"observed_at":"2026-08-04T07:22:19.844458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:22:19.921938Z","title":"Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree csp","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:19.921938Z"},"links":{"citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:deb08e4c46ab5b77c0e488b988d370b2964e5bf44d735da8326c83a64fcaf9b4","observation_id":"81596587-e739-4c4d-879f-d38aa0f2f599","resolution":{"observed_at":"2026-08-04T07:22:19.921938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2510.27012."}