{"as_of":"2026-08-17T15:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9621753b4b7bb4de76cdbf051b5751addbb32e8993034483887f16bf73f515eb","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-17T06:30:58.91139+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-15T15:39:54.800037Z","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.138196Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.11147","last_updated":"2020-12-21T06:58:38Z","snapshot_observed_at":"2026-08-16T18:57:05.658639Z","submitted_at":"2020-12-21T06:58:38Z","title":"Hop-Hop Relation-aware Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2012.11147","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.11147","snapshot_observed_at":"2026-08-07T05:57:47.138196Z","title":"Hop-Hop Relation-aware Graph Neural Networks","venue":"cs.LG","work_id":"814627c2-ce15-4b66-aa96-3657de0b4de0","year":2020},"citing_paper":{"arxiv_id":"2506.06682","last_updated":"2025-06-07T06:35:42Z","snapshot_observed_at":"2026-08-10T23:47:11.373343Z","submitted_at":"2025-06-07T06:35:42Z","title":"Learning Robust Heterogeneous Graph Representations via Contrastive-Reconstruction under Sparse Semantics","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:57:47.088553Z"},"links":{"cited_paper":"/paper/2012.11147","citing_paper":"/paper/2506.06682"},"observation_digest":"sha256:1a5982304d970ce0137bbdec894edf495e6aae0a6e5a39705a0df786af971d64","observation_id":"433cedca-522b-4def-ab6e-562f183b8091","resolution":{"observed_at":"2026-08-07T05:57:47.143571Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.11147","last_updated":"2020-12-21T06:58:38Z","snapshot_observed_at":"2026-08-16T18:57:05.658639Z","submitted_at":"2020-12-21T06:58:38Z","title":"Hop-Hop Relation-aware Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.11147","snapshot_observed_at":"2026-08-15T15:39:54.800037Z","title":"Hop-hop relation-aware graph neural networks.arXiv preprint arXiv:2012.11147, 2020","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.19385","last_updated":"2026-07-01T13:05:33Z","snapshot_observed_at":"2026-08-16T07:16:27.823946Z","submitted_at":"2026-07-01T13:05:33Z","title":"STN-TGAT: Top-K Portfolio Construction via Prior-Guided Graph Attention with Learnable Soft-Threshold Sparsification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:39:54.800037Z"},"links":{"cited_paper":"/paper/2012.11147","citing_paper":"/paper/2607.19385"},"observation_digest":"sha256:0b4861dacdc1d77ce54fa098bece6bcaf58f8727326361bfbbc1ecee0b191d4e","observation_id":"ceaba6f1-4254-4c8b-8c50-38a84af5a999","resolution":{"observed_at":"2026-08-15T15:39:54.800037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2012.11147/citation-record","integrity":"/paper/2012.11147/integrity","json":"/paper/2012.11147/citation-record.json","paper":"/paper/2012.11147"},"outbound":[],"paper":{"arxiv_id":"2012.11147","last_updated":"2020-12-21T06:58:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:57:05.658639Z","submitted_at":"2020-12-21T06:58:38Z","title":"Hop-Hop Relation-aware Graph Neural Networks"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2012.11147."}