{"as_of":"2026-08-06T19:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39ef625cb6fc33f767dfa8e8e06a84934fa874a14bd936b3a66440057530fdb7","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T23:33:30.802691Z","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-06-29T11:43:23.268890Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-17T02:33:38.686468Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2105.14491"},"observation_digest":"sha256:240b851e866124d7f2d0ff7deb84eea8361ee28b5695215fa0ae66bff45b7553","observation_id":"cc24e965-6a01-43cd-9cad-697f7755b290","resolution":{"observed_at":"2026-05-17T02:33:38.733013Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-08-02T23:33:30.802691Z","title":null,"venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2602.13697","last_updated":"2026-06-04T09:11:11Z","snapshot_observed_at":"2026-08-05T22:24:52.932696Z","submitted_at":"2026-02-14T09:38:57Z","title":"No Need to Train Your RDB Foundation Model","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-02T23:33:30.802691Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2602.13697"},"observation_digest":"sha256:00f3fbf1e83f4be26643cdac626b7152b4c02bf7882dd1e20f2a8b3e10669d42","observation_id":"3b9c2f98-4661-4f29-a39f-65f211044391","resolution":{"observed_at":"2026-08-02T23:33:30.802691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2603.04300","last_updated":"2026-04-08T05:23:14Z","snapshot_observed_at":"2026-07-06T22:47:50.848191Z","submitted_at":"2026-03-04T17:20:08Z","title":"LUMINA: Foundation Models for Topology Transferable ACOPF","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T16:39:39.123809Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2603.04300"},"observation_digest":"sha256:7fd276cd6901367ebd126d8f8a1028340f813f0a317026be3f631159c6c85a15","observation_id":"6498dd2d-63ca-4e5a-9244-7ea92d9b1ea1","resolution":{"observed_at":"2026-05-15T16:40:10.496478Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2604.07891","last_updated":"2026-04-09T07:01:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T07:01:16Z","title":"AFGNN: API Misuse Detection using Graph Neural Networks and Clustering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:13.654133Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2604.07891"},"observation_digest":"sha256:2b3d62e2688c7ee1eb821dc8544bdf11ff920476eab98d31e263b394b16bbf45","observation_id":"9429e092-d03d-420c-b83a-bb826ee2fde3","resolution":{"observed_at":"2026-05-11T00:25:52.665965Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2604.19171","last_updated":"2026-04-21T07:29:52Z","snapshot_observed_at":"2026-07-06T23:05:53.378585Z","submitted_at":"2026-04-21T07:29:52Z","title":"FOCAL-Attention for Heterogeneous Multi-Label Prediction","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-10T02:58:23.470417Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2604.19171"},"observation_digest":"sha256:7830dd07c092bb3ce4d059b551833582836c4e482fd48fbfe8fb089adf2ad728","observation_id":"59d3f466-cd7c-41ae-ad3a-b913fa993d74","resolution":{"observed_at":"2026-05-11T12:46:21.327933Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2605.08679","last_updated":"2026-05-09T04:33:14Z","snapshot_observed_at":"2026-08-02T13:27:25.888990Z","submitted_at":"2026-05-09T04:33:14Z","title":"Attention-based graph neural networks: a survey","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-12T01:07:43.805485Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2605.08679"},"observation_digest":"sha256:8ae57fc6b11cc6ea0810e96d9f3403bdc79b7c59111026c30023be086b8d0b73","observation_id":"0a3c8714-df39-4b33-a41e-585fb361ee14","resolution":{"observed_at":"2026-05-12T08:26:24.958736Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2605.12671","last_updated":"2026-05-12T19:21:23Z","snapshot_observed_at":"2026-08-02T21:44:59.407489Z","submitted_at":"2026-05-12T19:21:23Z","title":"All Circuits Lead to Rome: Rethinking Functional Anisotropy in Circuit and Sheaf Discovery for LLMs","version":1},"reference_index":126,"source":"arxiv_source","source_observed_at":"2026-05-14T20:52:47.074893Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2605.12671"},"observation_digest":"sha256:50c55c6ed1b3035e8e0fbe98d9034ac71ca46b000c573519317f200006148aa2","observation_id":"327b03f8-19fe-467c-bb74-fb8b072a55b5","resolution":{"observed_at":"2026-05-14T20:52:57.544401Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2605.18211","last_updated":"2026-05-18T10:56:14Z","snapshot_observed_at":"2026-08-03T10:14:56.025888Z","submitted_at":"2026-05-18T10:56:14Z","title":"Leveraging Graph Structure in Seq2Seq Models for Knowledge Graph Link Prediction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T10:43:58.622509Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2605.18211"},"observation_digest":"sha256:c2013105cba6a0061fbc78a48299eb17ab4caddc3426fa18f6b1710aae560b32","observation_id":"3880cb5c-d7c2-407c-ac01-ac7b4d4ffa5e","resolution":{"observed_at":"2026-05-20T10:48:13.029083Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks","version":1},"cited_work":{"arxiv_id":"1904.05811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05811","snapshot_observed_at":"2026-06-29T11:43:23.268890Z","title":"Relational Graph Attention Networks","venue":"cs.LG","work_id":"ec20b149-773f-49e9-a4c7-dc9aa5a8448f","year":2019},"citing_paper":{"arxiv_id":"2605.27880","last_updated":"2026-05-27T03:04:12Z","snapshot_observed_at":"2026-08-02T08:21:55.801171Z","submitted_at":"2026-05-27T03:04:12Z","title":"Confident Learning-based Network for Detecting Bug-Inducing Commits on SZZ with Noisy Labels","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T11:42:04.849077Z"},"links":{"cited_paper":"/paper/1904.05811","citing_paper":"/paper/2605.27880"},"observation_digest":"sha256:e5b4347ad3ec2646f5f42d483373438f51a59f1d78145b6821e06aefc1d3f994","observation_id":"93c9b85a-3013-4ce0-8a85-6a5911da3d57","resolution":{"observed_at":"2026-06-29T11:43:23.270230Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.05811/citation-record","integrity":"/paper/1904.05811/integrity","json":"/paper/1904.05811/citation-record.json","paper":"/paper/1904.05811"},"outbound":[],"paper":{"arxiv_id":"1904.05811","last_updated":"2019-04-11T16:11:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:45:31.284589Z","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention 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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:1904.05811."}