Paper Citation Record · LEDGER

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2510.27012 v3

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T07:22:19.921938Z

measured 39 of 39 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-13T21:26:02.324238Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-13T21:28:17.598277Z

Reference resolution

38 of 38 outbound references displayed

verified exact0
verified fuzzy0
unresolved38
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 976bb744-755d-43bc-9fc1-ba255d1eb7b8 · outbound

This paper cites Property Testing in Bounded Degree Hypergraphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Property Testing in Bounded Degree Hypergraphs

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:15.514211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 93ead4dc-18c5-47b0-b42c-a107b8a1c768 · outbound

This paper cites Polynomial time approximation schemes for dense instances of np-hard problems.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Polynomial time approximation schemes for dense instances of np-hard problems

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:15.601128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd5d9902-f88e-4310-b0f7-16978094ec68 · outbound

This paper cites Testing satisfiability.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Testing satisfiability

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:15.685710Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbfa0ff3-65f7-4efa-8287-dcb272f1e81a · outbound

This paper cites The collapse of the bounded width hierarchy.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries The collapse of the bounded width hierarchy

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:15.813876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6883c2ed-95b6-4e7c-8414-7cd4439050c5 · outbound

This paper cites Constraint satisfaction problems solvable by local consistency methods.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Constraint satisfaction problems solvable by local consistency methods

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:15.910745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4564d87-3f35-433c-ac33-9f74b6b67e50 · outbound

This paper cites Robustly solvable constraint satisfaction problems.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Robustly solvable constraint satisfaction problems

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.074749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76cc531f-fdd1-469f-9718-051934d5152a · outbound

This paper cites A lower bound for testing 3-colorability in bounded-degree graphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries A lower bound for testing 3-colorability in bounded-degree graphs

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.217322Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25151dd6-9ca3-4b0b-891f-ec8a15c0bfc5 · outbound

This paper cites Notes on CSPs and Polymorphisms.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Notes on CSPs and Polymorphisms

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.364751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c406a36-fa14-40d7-9fe2-9282bdb47bd3 · outbound

This paper cites Every minor-closed property of sparse graphs is testable.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Every minor-closed property of sparse graphs is testable

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.473593Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcc16949-9194-4705-a769-8d4fe804e37e · outbound

This paper cites Linear space streaming lower bounds for approximating csps.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Linear space streaming lower bounds for approximating csps

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.623828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aedf29bb-9905-401f-8540-6974322dac8f · outbound

This paper cites Sketching approximability of all finite csps.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Sketching approximability of all finite csps

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.814753Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d2d3b38b-315d-41ca-8d23-07ac284cc0c5 · outbound

This paper cites Planar graphs: Random walks and bipartiteness testing.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Planar graphs: Random walks and bipartiteness testing

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:16.871910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46c81d8d-d5eb-47f3-99f4-2d97f27afa2f · outbound

This paper cites Robust satisfiability for csps: Hardness and algorithmic results.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Robust satisfiability for csps: Hardness and algorithmic results

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.005323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc700a37-0f50-4872-976a-2e339dfadace · outbound

This paper cites A dichotomy theorem for multi-pass streaming csps.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries A dichotomy theorem for multi-pass streaming csps

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.138890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eac557c7-4ea9-409f-b7f3-f744f6242cf8 · outbound

This paper cites Multi-Pass Streaming Lower Bounds for Approximating Max-Cut.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Multi-Pass Streaming Lower Bounds for Approximating Max-Cut

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.259101Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05ed584e-d9b5-48fc-823c-9f9ad4ea217b · outbound

This paper cites The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.425525Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3103c0be-912b-4c83-8a44-023e4a7bec2f · outbound

This paper cites Closed systems of functions and predicates.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Closed systems of functions and predicates

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.501797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cf9986b-5af1-49d4-8279-dbeefded857f · outbound

This paper cites Property testing and its connection to learning and approximation.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Property testing and its connection to learning and approximation

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.641913Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58a68a9d-d911-4f72-b731-3a57aa75f8a8 · outbound

This paper cites A sublinear bipartiteness tester for bounded degree graphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries A sublinear bipartiteness tester for bounded degree graphs

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.782725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 988bc484-37ff-4806-a1e8-87494f61bd8d · outbound

This paper cites Property testing in bounded degree graphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Property testing in bounded degree graphs

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.858234Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eafdfad6-3993-472a-8385-a07e8736d238 · outbound

This paper cites On testing expansion in bounded-degree graphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries On testing expansion in bounded-degree graphs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:17.925277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8423b95d-d23c-43ea-95c3-60d985d002ac · outbound

This paper cites Tight bounds on the approximability of almost-satisfiable horn sat and exact hitting set.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Tight bounds on the approximability of almost-satisfiable horn sat and exact hitting set

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.011656Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ab5ebea-57c1-4712-be14-991f6edcb8e7 · outbound

This paper cites Some optimal inapproximability results.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Some optimal inapproximability results

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.124750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c1d3da9-24c2-4935-8c99-3ec84fe617d8 · outbound

This paper cites The structure of finite algebras , volume 76.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries The structure of finite algebras , volume 76

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.234752Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32d156d0-0b64-470b-89a7-7434a7aac8fb · outbound

This paper cites On the power of unique 2-prover 1-round games.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries On the power of unique 2-prover 1-round games

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.404751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85a4ffa7-f385-4d96-9460-1cf4085341aa · outbound

This paper cites An optimal space lower bound for approximating max-cut.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries An optimal space lower bound for approximating max-cut

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.614750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 400bbbc0-8bec-4395-b423-e16dab00502e · outbound

This paper cites Streaming lower bounds for approximating max-cut.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Streaming lower bounds for approximating max-cut

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.753015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a11cd1fa-1f28-42f0-9422-e9f5ce58ca1d · outbound

This paper cites Bounded width problems and algebras.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Bounded width problems and algebras

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:18.910869Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb53fe4f-a3c2-4718-b127-4f8b054d3328 · outbound

This paper cites Optimal algorithms and inapproximability results for every csp? In Proceedings of the fortieth annual ACM symposium on Theory of computing , pages 245--254, 2008.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Optimal algorithms and inapproximability results for every csp? In Proceedings of the fortieth annual ACM symposium on Theory of computing , pages 245--254, 2008

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.037972Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f81a3b5f-dcd6-4bef-bf53-82f6336b138c · outbound

This paper cites Streaming algorithms via local algorithms for maximum directed cut.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Streaming algorithms via local algorithms for maximum directed cut

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.171987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 207185f6-8a77-4657-9c2a-312aaf311037 · outbound

This paper cites A survey on strictly simple algebras and minimal varieties.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries A survey on strictly simple algebras and minimal varieties

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.340528Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 823315da-194c-413e-b92f-5a18fc04ffb2 · outbound

This paper cites Non-approximability results for optimization problems on bounded degree instances.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Non-approximability results for optimization problems on bounded degree instances

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.416227Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9ac98da-0cc1-4154-bcec-8b0f5662fc78 · outbound

This paper cites A subalgebra intersection property for congruence distributive varieties.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries A subalgebra intersection property for congruence distributive varieties

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.484742Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d6200db-be84-48f6-acff-c8a888a86936 · outbound

This paper cites Probability in high dimension (lecture notes), 2014.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Probability in high dimension (lecture notes), 2014

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.566203Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 906684d7-f62f-42c2-ad26-70b724ecc3b3 · outbound

This paper cites Models of random regular graphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Models of random regular graphs

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.694475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8fd1907a-8d58-489b-bc64-5840569407cf · outbound

This paper cites Query-number preserving reductions and linear lower bounds for testing.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Query-number preserving reductions and linear lower bounds for testing

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.774220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 616409c1-93db-4c16-b1d1-5c28305ac8a1 · outbound

This paper cites Property testing on k-vertex-connectivity of graphs.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Property testing on k-vertex-connectivity of graphs

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.844458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81596587-e739-4c4d-879f-d38aa0f2f599 · outbound

This paper cites Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree csp.

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree csp

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T07:22:19.921938Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 1b343920-1021-4a0b-bad2-69b426bf016d · inbound

Near-Optimal Space Lower Bounds for Streaming CSPs cites this paper.

Near-Optimal Space Lower Bounds for Streaming CSPs Unbounded-width CSPs are Untestable in a Sublinear Number of Queries

Reference 5

Resolution: verified exact; arxiv_id, observed 2026-06-26T02:16:19.283275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.