Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.16722.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T04:18:58.535900Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 459ff9cd-5beb-4ecc-8d2c-e82ca5f5159f · inbound
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size cites this paper.
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
Reference 9
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T05:15:13.974454Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation 876b8709-48ca-4539-8b57-fd435b924632 · inbound
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability cites this paper.
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
Reference 71
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T04:18:58.535900Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.