{"as_of":"2026-08-11T00:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b18e40e9cec8032fbd67b36fb883f4ea478234dba445b05a5620bf14f060e33b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:46:06.456645Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T17:46:06.573936Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.09773","last_updated":"2025-01-04T04:45:25Z","snapshot_observed_at":"2026-07-06T20:06:17.706151Z","submitted_at":"2024-12-13T00:44:47Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","version":2},"cited_work":{"arxiv_id":"2412.09773","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.09773","snapshot_observed_at":"2026-08-09T17:46:06.573936Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","venue":"cs.DS","work_id":"8ca7bb74-44af-48f2-912e-ca7a3b297435","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.456645Z"},"links":{"cited_paper":"/paper/2412.09773","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:68308315a3f5221e8932cd51b4c514823e933fcd190bd2b22d8b136bbfdb186b","observation_id":"60eac726-8e7e-49fb-a8df-a31cbd104b45","resolution":{"observed_at":"2026-08-09T17:46:06.578696Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.09773/citation-record","integrity":"/paper/2412.09773/integrity","json":"/paper/2412.09773/citation-record.json","paper":"/paper/2412.09773"},"outbound":[],"paper":{"arxiv_id":"2412.09773","last_updated":"2025-01-04T04:45:25Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T20:06:17.706151Z","submitted_at":"2024-12-13T00:44:47Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2412.09773."}