{"as_of":"2026-08-08T21:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17b482c8219561747f6891ac42739433ff85bf91c24a325341ebce6c9f20404b","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-06T20:04:03.036858Z","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-06T20:04:07.713857Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.04914","last_updated":"2019-05-13T08:53:31Z","snapshot_observed_at":"2026-07-06T07:52:32.758734Z","submitted_at":"2019-05-13T08:53:31Z","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"1905.04914","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.04914","snapshot_observed_at":"2026-08-06T20:04:07.713857Z","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","venue":"cs.AI","work_id":"6af674a1-5cb0-4816-b544-417c3fc403e1","year":2019},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-08T16:54:24.903914Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.036858Z"},"links":{"cited_paper":"/paper/1905.04914","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:248e0585373d2eff57e4625fa42eb01c508fa762b5dca9636276bc229ba7bd55","observation_id":"57af573e-0117-40b1-9503-cb10ec44e4f2","resolution":{"observed_at":"2026-08-06T20:04:07.836575Z","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/1905.04914/citation-record","integrity":"/paper/1905.04914/integrity","json":"/paper/1905.04914/citation-record.json","paper":"/paper/1905.04914"},"outbound":[],"paper":{"arxiv_id":"1905.04914","last_updated":"2019-05-13T08:53:31Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T07:52:32.758734Z","submitted_at":"2019-05-13T08:53:31Z","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs"},"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:1905.04914."}