Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-15T17:01:37.480510Z
Paper Citation Record · LEDGER
Sharp Online Hardness for Large Balanced Independent Sets
As of 17 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 2 inbound Pith citation observations for arXiv:2508.20785.
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-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-10T03:09:42.968897Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T21:11:20.707993Z
Reference resolution
5 of 5 outbound references displayed
- verified exact0
- verified fuzzy1
- unresolved4
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 3a8d1078-723e-4ae2-b05f-03d29d8568d3 · outbound
This paper cites Notes on computational-to-statistical gaps: predictions using statistical physics.
Sharp Online Hardness for Large Balanced Independent Sets Notes on computational-to-statistical gaps: predictions using statistical physics
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T17:01:37.438027Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9c8784d5-28e7-4378-9fa7-4c4d1b7d90b7 · outbound
This paper cites The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials.
Sharp Online Hardness for Large Balanced Independent Sets The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T17:01:37.450011Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c59ee4bc-e5bc-427f-8dea-5c50f0774637 · outbound
This paper cites Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes.
Sharp Online Hardness for Large Balanced Independent Sets Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T17:01:37.460195Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 34691695-03b0-4c6c-9ea0-d3fcea742f6f · outbound
This paper cites Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses.
Sharp Online Hardness for Large Balanced Independent Sets Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T17:01:37.469497Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4a18b6a4-9954-46d1-962f-9e6a4130a545 · outbound
This paper cites Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2024, 123:1–123:20 (cit.
Sharp Online Hardness for Large Balanced Independent Sets Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2024, 123:1–123:20 (cit
Reference 297
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T17:01:37.614048Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Pith citing papers
Observation 92c35697-5d12-4469-b609-ff0877a02aef · inbound
Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection cites this paper.
Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection Sharp Online Hardness for Large Balanced Independent Sets
Reference 33
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T12:41:05.018272Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 48291f4b-8a6a-437a-9c81-7ed0ed0b9e16 · inbound
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs cites this paper.
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs Sharp Online Hardness for Large Balanced Independent Sets
Reference 30
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T21:11:20.710617Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.