Paper Citation Record · LEDGER

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP

As of 12 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2608.07800.

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

pith.paper-citation-record.v1
2608.07800 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T04:19:01.274226Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

18 of 18 outbound references displayed

verified exact3
verified fuzzy14
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e3ef3f9f-54ad-4945-aee8-7dc8b86fcb90 · outbound

This paper cites The Nonapproximability of Non-Boolean Predicates.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP The Nonapproximability of Non-Boolean Predicates

Reference 1

Resolution: verified exact; doi, observed 2026-08-11T04:19:01.325144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dbd593a0-3872-4cc3-8f1a-e7ed7f93ec9a · outbound

This paper cites A PCP characterization of NP with optimal amortized query complexity.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP A PCP characterization of NP with optimal amortized query complexity

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.556584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation db982644-1c39-4c85-908f-09e9c5f2737e · outbound

This paper cites Near-optimal algorithms for unique games , year =.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Near-optimal algorithms for unique games , year =

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.546860Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d63557cb-60d6-4965-a877-8069fa164285 · outbound

This paper cites Gowers uniformity, influence of variables, and PCP s.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Gowers uniformity, influence of variables, and PCP s

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-11T04:19:01.227053Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c15eccb-04da-4d20-a0f1-3b8ddf10f59c · outbound

This paper cites 2009 , doi =.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP 2009 , doi =

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.538266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a94c36cf-7eff-4dd9-b6a4-fb0533dadb08 · outbound

This paper cites Optimal algorithms and inapproximability results for every CSP ?.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Optimal algorithms and inapproximability results for every CSP ?

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.528909Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 70968ea3-bc7a-4e2a-8335-d751d4fdc974 · outbound

This paper cites More Efficient Queries in PCP s for NP and Improved Approximation Hardness of Maximum CSP.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP More Efficient Queries in PCP s for NP and Improved Approximation Hardness of Maximum CSP

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.519116Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 56641dd1-7661-4353-a4ff-bafd3246919c · outbound

This paper cites Constraint Satisfaction over a Non- B oolean Domain: Approximation Algorithms and U nique- G ames Hardness.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Constraint Satisfaction over a Non- B oolean Domain: Approximation Algorithms and U nique- G ames Hardness

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.509088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 450347f5-3277-4332-94e2-f6f32b839e04 · outbound

This paper cites Approximation Resistant Predicates from Pairwise Independence.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Approximation Resistant Predicates from Pairwise Independence

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.499572Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 87696413-947f-4d03-9719-4842b2a203ab · outbound

This paper cites Approximating.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Approximating

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.489957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e982e886-5d7b-4a2a-a784-2c0a88b5ddfe · outbound

This paper cites Journal of the American Statistical Association.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Journal of the American Statistical Association

Reference 11

Resolution: verified exact; doi, observed 2026-08-11T04:19:01.315410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dac7d02f-0867-4a76-bbf3-61c49b294360 · outbound

This paper cites Algorithmica.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Algorithmica

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.479440Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3a61772f-cd24-4004-9ef3-45bdedf726bc · outbound

This paper cites Journal of the ACM (JACM) , volume=.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Journal of the ACM (JACM) , volume=

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.468101Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 30c35aaf-cef3-4e6d-a429-400f6ff71a5f · outbound

This paper cites Theory of Computing , volume =.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP Theory of Computing , volume =

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.457825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 97763c2e-b310-4c9a-908a-3cc7d648dc56 · outbound

This paper cites The Constraint Satisfaction Problem: Complexity and Approximability , editor =.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP The Constraint Satisfaction Problem: Complexity and Approximability , editor =

Reference 15

Resolution: verified exact; doi, observed 2026-08-11T04:19:01.304312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 60e6676a-8ef8-43d4-895e-33f9549893e7 · outbound

This paper cites ACM Transactions on Computation Theory (TOCT) , volume=.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP ACM Transactions on Computation Theory (TOCT) , volume=

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.447865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f03ca5fa-b05c-4867-beb8-cdb3269d3619 · outbound

This paper cites CoRR , volume =.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP CoRR , volume =

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.438065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation aff51595-e9e1-4482-a3ea-564f4da04317 · outbound

This paper cites CoRR , volume =.

Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP CoRR , volume =

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T04:19:01.426255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Pith citing papers

No inbound Pith citation observations are available.