{"as_of":"2026-08-11T03:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15cca6957d1c4466e324526b28c82d726c84f6694e2759d06566b6f6f7d3df25","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:46:06.429944Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.16600","last_updated":"2024-11-25T17:31:34Z","snapshot_observed_at":"2026-07-06T19:56:43.637339Z","submitted_at":"2024-11-25T17:31:34Z","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16600","snapshot_observed_at":"2026-08-09T17:46:06.429944Z","title":"Approximation algorithms for combinatorial optimization with predictions, 2024","venue":null,"work_id":null,"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":1,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.429944Z"},"links":{"cited_paper":"/paper/2411.16600","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:09f8a80fa8428965fede052ac510bbd7c0610290134869326d6470f5f917faca","observation_id":"bd5a9d76-e1b1-4487-aa7a-2908c82976e1","resolution":{"observed_at":"2026-08-09T17:46:06.429944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16600","last_updated":"2024-11-25T17:31:34Z","snapshot_observed_at":"2026-07-06T19:56:43.637339Z","submitted_at":"2024-11-25T17:31:34Z","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16600","snapshot_observed_at":"2026-08-07T12:55:23.764531Z","title":"Approximation algorithms for combinatorial optimization with predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:23.764531Z"},"links":{"cited_paper":"/paper/2411.16600","citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:4782e33b544c283a0a009e314304964e8c7e33e3c4c66348bdebc5a3a28d9a99","observation_id":"7a204478-25ca-43d8-9b0f-57f581e12717","resolution":{"observed_at":"2026-08-07T12:55:23.764531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16600","last_updated":"2024-11-25T17:31:34Z","snapshot_observed_at":"2026-07-06T19:56:43.637339Z","submitted_at":"2024-11-25T17:31:34Z","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","version":1},"cited_work":{"arxiv_id":"2411.16600","doi":"10.48550/arxiv.2411.16600","metadata_source":"pith","pith_arxiv_id":"2411.16600","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","venue":"cs.DS","work_id":"56a87a30-e740-47d8-9c1c-b13901964d55","year":2024},"citing_paper":{"arxiv_id":"2607.07756","last_updated":"2026-07-08T14:01:16Z","snapshot_observed_at":"2026-08-02T22:53:58.003943Z","submitted_at":"2026-07-08T14:01:16Z","title":"The Importance of Encoder Choice:A Tabular-Image Study","version":1},"reference_index":187,"source":"arxiv_source","source_observed_at":"2026-07-10T19:03:32.353393Z"},"links":{"cited_paper":"/paper/2411.16600","citing_paper":"/paper/2607.07756"},"observation_digest":"sha256:2e5a29e0e6f4413fcd921cb7502f30608c34b2538b04c15d2094caa52e840f2d","observation_id":"7c1aa651-0dfa-4e7d-ae1a-09a7324b7ee3","resolution":{"observed_at":"2026-07-10T19:07:34.901768Z","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/2411.16600/citation-record","integrity":"/paper/2411.16600/integrity","json":"/paper/2411.16600/citation-record.json","paper":"/paper/2411.16600"},"outbound":[],"paper":{"arxiv_id":"2411.16600","last_updated":"2024-11-25T17:31:34Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T19:56:43.637339Z","submitted_at":"2024-11-25T17:31:34Z","title":"Approximation Algorithms for Combinatorial Optimization with Predictions"},"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 3 inbound Pith citation observations for arXiv:2411.16600."}