{"as_of":"2026-08-19T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8fd961d88b0ec00e3bbdc6c6ba01a7a1d43167e9a1b1342a299b0eae11e20edb","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:58:25.538427Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T04:59:35.628881Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.11897","last_updated":"2024-06-14T19:44:23Z","snapshot_observed_at":"2026-08-19T19:17:04.420862Z","submitted_at":"2024-06-14T19:44:23Z","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11897","snapshot_observed_at":"2026-08-11T20:58:25.538427Z","title":"and Kuhnle, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-19T16:37:00.078917Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.538427Z"},"links":{"cited_paper":"/paper/2406.11897","citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:865b485836fd42cf79327996f61272c0bcafa515ddcbe5a92b023abdb4fecf23","observation_id":"187d7803-8136-472d-a312-c62fd5b02759","resolution":{"observed_at":"2026-08-11T20:58:25.538427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11897","last_updated":"2024-06-14T19:44:23Z","snapshot_observed_at":"2026-08-19T19:17:04.420862Z","submitted_at":"2024-06-14T19:44:23Z","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2406.11897","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.11897","snapshot_observed_at":"2026-07-04T04:59:35.628881Z","title":"A benchmark for maximum cut: Towards standardization of the evaluation of learned heuristics for combinatorial optimization,","venue":null,"work_id":"2fda09c7-ad90-4543-84df-45385b250296","year":2024},"citing_paper":{"arxiv_id":"2606.20968","last_updated":"2026-06-18T22:08:21Z","snapshot_observed_at":"2026-08-06T11:02:22.498405Z","submitted_at":"2026-06-18T22:08:21Z","title":"Profiling the Effective Limits of Error Mitigation via Circuit Replication","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T16:35:40.743596Z"},"links":{"cited_paper":"/paper/2406.11897","citing_paper":"/paper/2606.20968"},"observation_digest":"sha256:d67599b2e33414c5022a9988477e806bf7846c00c98c201584804a2e1801314a","observation_id":"305b9a88-e07a-4a8e-9324-1364c312338e","resolution":{"observed_at":"2026-07-04T04:59:35.630750Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.11897/citation-record","integrity":"/paper/2406.11897/integrity","json":"/paper/2406.11897/citation-record.json","paper":"/paper/2406.11897"},"outbound":[],"paper":{"arxiv_id":"2406.11897","last_updated":"2024-06-14T19:44:23Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-19T19:17:04.420862Z","submitted_at":"2024-06-14T19:44:23Z","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.11897."}