{"as_of":"2026-08-14T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a9788e94a95d44b1f5e0d53c53b11dd74987acf2881a627c930df7dee01d56d","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:44:32.278132Z","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-05-16T14:41:02.267856Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.06975","last_updated":"2022-08-19T17:22:55Z","snapshot_observed_at":"2026-08-14T11:25:38.826864Z","submitted_at":"2022-08-15T02:24:26Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.06975","snapshot_observed_at":"2026-08-11T16:44:32.278132Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.09860","last_updated":"2024-12-13T05:00:57Z","snapshot_observed_at":"2026-08-14T11:26:04.261034Z","submitted_at":"2024-12-13T05:00:57Z","title":"Brain-inspired Chaotic Graph Backpropagation for Large-scale Combinatorial Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T16:44:32.278132Z"},"links":{"cited_paper":"/paper/2208.06975","citing_paper":"/paper/2412.09860"},"observation_digest":"sha256:c5cf00bd8b104de843456b4a2ffa366c187a6d964520bb629e5ab63195c75722","observation_id":"c5c6c696-5e25-4d19-a742-e74954b40dfb","resolution":{"observed_at":"2026-08-11T16:44:32.278132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06975","last_updated":"2022-08-19T17:22:55Z","snapshot_observed_at":"2026-08-14T11:25:38.826864Z","submitted_at":"2022-08-15T02:24:26Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.06975","snapshot_observed_at":"2026-08-11T15:17:23.208712Z","title":"Pan, and Bei Yu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11205","last_updated":"2024-12-15T14:37:56Z","snapshot_observed_at":"2026-08-12T06:45:07.323868Z","submitted_at":"2024-12-15T14:37:56Z","title":"Concept Learning in the Wild: Towards Algorithmic Understanding of Neural Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:17:23.208712Z"},"links":{"cited_paper":"/paper/2208.06975","citing_paper":"/paper/2412.11205"},"observation_digest":"sha256:44538295f4602daf6ccf85576f8eb6ed69be75d8b056450d4970b8876609ea86","observation_id":"1e5e1952-dc39-4305-8f06-26feb4aab6f9","resolution":{"observed_at":"2026-08-11T15:17:23.208712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06975","last_updated":"2022-08-19T17:22:55Z","snapshot_observed_at":"2026-08-14T11:25:38.826864Z","submitted_at":"2022-08-15T02:24:26Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.06975","snapshot_observed_at":"2026-08-07T14:02:52.960637Z","title":"2208.06975","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20250","last_updated":"2025-09-11T04:19:00Z","snapshot_observed_at":"2026-08-14T11:25:57.233165Z","submitted_at":"2025-05-26T17:23:47Z","title":"Efficient Optimization Accelerator Framework for Multistate Ising Problems","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:02:52.960637Z"},"links":{"cited_paper":"/paper/2208.06975","citing_paper":"/paper/2505.20250"},"observation_digest":"sha256:108d207d9cc77d906f2824f7e523b905ae9f18be1e773b8d0d2a327d41e10c65","observation_id":"3b0a6e2b-e4cb-453f-9986-a8021fb5b3ee","resolution":{"observed_at":"2026-08-07T14:02:52.960637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06975","last_updated":"2022-08-19T17:22:55Z","snapshot_observed_at":"2026-08-14T11:25:38.826864Z","submitted_at":"2022-08-15T02:24:26Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","version":2},"cited_work":{"arxiv_id":"2208.06975","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.06975","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rethinking graph neural networks for the graph coloring problem","venue":null,"work_id":"e9d7196d-85b3-46b9-a673-26d7cc7751e5","year":2022},"citing_paper":{"arxiv_id":"2601.10175","last_updated":"2026-05-07T14:13:19Z","snapshot_observed_at":"2026-08-03T23:20:34.236027Z","submitted_at":"2026-01-15T08:28:21Z","title":"A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-16T14:40:39.112184Z"},"links":{"cited_paper":"/paper/2208.06975","citing_paper":"/paper/2601.10175"},"observation_digest":"sha256:ea019d93e9ce9058482f904c5812b37dce6c4ccc90e609beb39bc0cb16479f39","observation_id":"10b3156d-4d31-4d5b-b1f5-73b0ffd032bc","resolution":{"observed_at":"2026-05-16T14:41:02.270539Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.06975/citation-record","integrity":"/paper/2208.06975/integrity","json":"/paper/2208.06975/citation-record.json","paper":"/paper/2208.06975"},"outbound":[],"paper":{"arxiv_id":"2208.06975","last_updated":"2022-08-19T17:22:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T11:25:38.826864Z","submitted_at":"2022-08-15T02:24:26Z","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2208.06975."}