Pith. sign in

Paper Citation Record · LEDGER

Max-Cut with $\epsilon$-Accurate Predictions

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.18263.

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

pith.paper-citation-record.v1
2402.18263 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T17:00:54.330905Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-09T17:46:06.591491Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 43753dbb-50ed-4f5f-8283-d41a19f77d46 · inbound

On Tradeoffs in Learning-Augmented Algorithms cites this paper.

On Tradeoffs in Learning-Augmented Algorithms Max-Cut with $\epsilon$-Accurate Predictions

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-10T17:00:54.330905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T17:00:54.330905Z digest=sha256:5799ce987a43af1c7a5532125129167ae1d7671deeccb7febe413363088b0c18

Observation 07774c55-5669-48ab-a624-02999e396a0a · inbound

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems cites this paper.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Max-Cut with $\epsilon$-Accurate Predictions

Reference 6

Resolution
verified exact
local_arxiv, observed 2026-08-09T17:46:06.595897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-09T17:46:06.449371Z digest=sha256:89fa81bdd8449cf183892331c04809e84c8f226ad5e0c061d74b08bab09dd764

Observation 3d54b3dd-037b-47e3-a8bb-1203e1882c94 · inbound

CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees cites this paper.

CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees Max-Cut with $\epsilon$-Accurate Predictions

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-02T01:57:56.652293Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T01:57:56.652293Z digest=sha256:8137f784b8e9d4ea2ebfccac6077b11654a7b4fd761e95953448c7aa5cafcd75