{"as_of":"2026-08-08T13:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64a57fb4c4309ad3b069ac138b2c29efc888f759c6e90d8361a9b6bc65ead6f3","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-08T06:32:00.761636+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-07T05:57:46.975976Z","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-07T05:57:47.207975Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.03594","last_updated":"2022-05-10T15:32:26Z","snapshot_observed_at":"2026-07-06T11:16:40.406758Z","submitted_at":"2021-06-07T13:21:09Z","title":"Learning Combinatorial Node Labeling Algorithms","version":3},"cited_work":{"arxiv_id":"2106.03594","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03594","snapshot_observed_at":"2026-08-07T05:57:47.207975Z","title":"Learning Combinatorial Node Labeling Algorithms","venue":"cs.LG","work_id":"5758724d-96f3-4982-9c49-18a17af9fe25","year":2021},"citing_paper":{"arxiv_id":"2506.06682","last_updated":"2025-06-07T06:35:42Z","snapshot_observed_at":"2026-08-07T05:49:51.556523Z","submitted_at":"2025-06-07T06:35:42Z","title":"Learning Robust Heterogeneous Graph Representations via Contrastive-Reconstruction under Sparse Semantics","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:57:46.975976Z"},"links":{"cited_paper":"/paper/2106.03594","citing_paper":"/paper/2506.06682"},"observation_digest":"sha256:d5eb0c7d1d4b5203c11f64353ffbbfc13a300b7e95f6da312096994507268ce9","observation_id":"47218717-0233-4189-9730-ae5b9152c319","resolution":{"observed_at":"2026-08-07T05:57:47.211365Z","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/2106.03594/citation-record","integrity":"/paper/2106.03594/integrity","json":"/paper/2106.03594/citation-record.json","paper":"/paper/2106.03594"},"outbound":[],"paper":{"arxiv_id":"2106.03594","last_updated":"2022-05-10T15:32:26Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:16:40.406758Z","submitted_at":"2021-06-07T13:21:09Z","title":"Learning Combinatorial Node Labeling Algorithms"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.03594."}