{"as_of":"2026-08-07T10:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d768c9ee157b9e209d04969e9c286f0ed5c71ac1836be67e659dde3550e8e484","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:06:37.711552Z","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-06-30T19:15:01.252267Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.12058","last_updated":"2020-02-16T04:27:14Z","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T21:58:46Z","title":"Inductive Matrix Completion Based on Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12058","snapshot_observed_at":"2026-08-07T05:06:37.711552Z","title":"arXiv preprint arXiv:1904.12058 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08743","last_updated":"2025-06-10T12:38:24Z","snapshot_observed_at":"2026-08-07T05:00:39.497514Z","submitted_at":"2025-06-10T12:38:24Z","title":"Bridging RDF Knowledge Graphs with Graph Neural Networks for Semantically-Rich Recommender Systems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:06:37.711552Z"},"links":{"cited_paper":"/paper/1904.12058","citing_paper":"/paper/2506.08743"},"observation_digest":"sha256:a219ab38fb878021b57de173f3465ae39f9cbaf86fad07979d722e50762e12cf","observation_id":"b9d2ef6f-aafc-491a-8919-f90aed1f18c3","resolution":{"observed_at":"2026-08-07T05:06:37.711552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12058","last_updated":"2020-02-16T04:27:14Z","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T21:58:46Z","title":"Inductive Matrix Completion Based on Graph Neural Networks","version":3},"cited_work":{"arxiv_id":"1904.12058","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.12058","snapshot_observed_at":"2026-06-30T19:15:01.252267Z","title":"arXiv preprint arXiv:1904.12058 , year=","venue":null,"work_id":"7cfe9184-116e-4ecb-a717-97afe2a5e826","year":1904},"citing_paper":{"arxiv_id":"2605.07075","last_updated":"2026-05-08T00:49:05Z","snapshot_observed_at":"2026-07-06T23:19:30.387067Z","submitted_at":"2026-05-08T00:49:05Z","title":"ModelLens: Finding the Best for Your Task from Myriads of Models","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-11T01:55:57.223673Z"},"links":{"cited_paper":"/paper/1904.12058","citing_paper":"/paper/2605.07075"},"observation_digest":"sha256:79af969d447a37892c8b1066733e712bee774ce57b6e5328544903a1201c8aae","observation_id":"39a4453f-ef4d-440e-bd72-df22ad0f1dae","resolution":{"observed_at":"2026-05-11T04:05:59.465781Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12058","last_updated":"2020-02-16T04:27:14Z","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T21:58:46Z","title":"Inductive Matrix Completion Based on Graph Neural Networks","version":3},"cited_work":{"arxiv_id":"1904.12058","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.12058","snapshot_observed_at":"2026-06-30T19:15:01.252267Z","title":"arXiv preprint arXiv:1904.12058 , year=","venue":null,"work_id":"7cfe9184-116e-4ecb-a717-97afe2a5e826","year":1904},"citing_paper":{"arxiv_id":"2605.15721","last_updated":"2026-05-15T08:17:21Z","snapshot_observed_at":"2026-08-03T02:20:03.310384Z","submitted_at":"2026-05-15T08:17:21Z","title":"Contexting as Recommendation: Evolutionary Collaborative Filtering for Context Engineering","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-20T19:05:58.638818Z"},"links":{"cited_paper":"/paper/1904.12058","citing_paper":"/paper/2605.15721"},"observation_digest":"sha256:42961ce91d6d893f51d6938bc1ab536a84639ee0356f6d4301703dccfbc170e8","observation_id":"d37317e1-bb2b-4037-80c2-053b6d10733f","resolution":{"observed_at":"2026-05-20T19:08:54.408339Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12058","last_updated":"2020-02-16T04:27:14Z","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T21:58:46Z","title":"Inductive Matrix Completion Based on Graph Neural Networks","version":3},"cited_work":{"arxiv_id":"1904.12058","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.12058","snapshot_observed_at":"2026-06-30T19:15:01.252267Z","title":"arXiv preprint arXiv:1904.12058 , year=","venue":null,"work_id":"7cfe9184-116e-4ecb-a717-97afe2a5e826","year":1904},"citing_paper":{"arxiv_id":"2605.17189","last_updated":"2026-06-09T02:46:33Z","snapshot_observed_at":"2026-08-02T14:26:15.767422Z","submitted_at":"2026-05-16T23:10:10Z","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","version":1},"reference_index":181,"source":"arxiv_source","source_observed_at":"2026-05-20T14:04:44.364824Z"},"links":{"cited_paper":"/paper/1904.12058","citing_paper":"/paper/2605.17189"},"observation_digest":"sha256:69eb3d0477199c1511938de7192b65cfe4338634fd19920032516f687563f4e2","observation_id":"472103e2-76be-4456-ad52-21a0b47d43f5","resolution":{"observed_at":"2026-05-20T14:08:21.051818Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12058","last_updated":"2020-02-16T04:27:14Z","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T21:58:46Z","title":"Inductive Matrix Completion Based on Graph Neural Networks","version":3},"cited_work":{"arxiv_id":"1904.12058","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.12058","snapshot_observed_at":"2026-06-30T19:15:01.252267Z","title":"arXiv preprint arXiv:1904.12058 , year=","venue":null,"work_id":"7cfe9184-116e-4ecb-a717-97afe2a5e826","year":1904},"citing_paper":{"arxiv_id":"2605.17189","last_updated":"2026-06-09T02:46:33Z","snapshot_observed_at":"2026-08-02T14:26:15.767422Z","submitted_at":"2026-05-16T23:10:10Z","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T18:55:27.301795Z"},"links":{"cited_paper":"/paper/1904.12058","citing_paper":"/paper/2605.17189"},"observation_digest":"sha256:57a68a54a26d4805e23286045eaa18d0ba97bb0a5618ea6315129670eb7cd3b5","observation_id":"24258151-97ab-4ec5-b2ad-c740f7014ca1","resolution":{"observed_at":"2026-06-30T19:15:01.253833Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.12058/citation-record","integrity":"/paper/1904.12058/integrity","json":"/paper/1904.12058/citation-record.json","paper":"/paper/1904.12058"},"outbound":[],"paper":{"arxiv_id":"1904.12058","last_updated":"2020-02-16T04:27:14Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T21:58:46Z","title":"Inductive Matrix Completion Based on 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1904.12058."}