{"as_of":"2026-08-09T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:297bbb618aa3931c68e100146b1046040ab6c00aa519a8ba7adf2b2d4999b313","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-08T06:32:00.761636+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-06T05:42:59.864295Z","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-05T20:29:23.367425Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.05834","last_updated":"2024-11-06T09:12:31Z","snapshot_observed_at":"2026-07-06T19:47:38.708013Z","submitted_at":"2024-11-06T09:12:31Z","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05834","snapshot_observed_at":"2026-08-06T05:42:59.864295Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.864295Z"},"links":{"cited_paper":"/paper/2411.05834","citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:60677e1ffa40c5c86e124508fe14a7b8e55b2a62452d5fbc6845564f05b44b0e","observation_id":"83fc7577-ad7b-4bfd-9a7f-e98849989cf8","resolution":{"observed_at":"2026-08-06T05:42:59.864295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05834","last_updated":"2024-11-06T09:12:31Z","snapshot_observed_at":"2026-07-06T19:47:38.708013Z","submitted_at":"2024-11-06T09:12:31Z","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems","version":1},"cited_work":{"arxiv_id":"2411.05834","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.05834","snapshot_observed_at":"2026-08-05T20:29:23.367425Z","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems","venue":"math.OC","work_id":"626b6619-ec98-4057-a8d9-f7bb836fad30","year":2024},"citing_paper":{"arxiv_id":"2508.10520","last_updated":"2025-08-14T10:45:44Z","snapshot_observed_at":"2026-08-08T02:22:22.624722Z","submitted_at":"2025-08-14T10:45:44Z","title":"Nonlocal Monte Carlo via Reinforcement Learning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T20:29:16.733100Z"},"links":{"cited_paper":"/paper/2411.05834","citing_paper":"/paper/2508.10520"},"observation_digest":"sha256:1cbe4f24e7688c77d8daf40dbcc69abdf20a3e81777ff385ce32f17286299f72","observation_id":"b823db24-d186-492e-9190-fdfeeb0d26a5","resolution":{"observed_at":"2026-08-05T20:29:23.460960Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.05834/citation-record","integrity":"/paper/2411.05834/integrity","json":"/paper/2411.05834/citation-record.json","paper":"/paper/2411.05834"},"outbound":[],"paper":{"arxiv_id":"2411.05834","last_updated":"2024-11-06T09:12:31Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T19:47:38.708013Z","submitted_at":"2024-11-06T09:12:31Z","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2411.05834."}