{"as_of":"2026-08-20T09:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a57662a21c50a6a8f3618cc2f484495ee278ba7aa6395637531a965e6db11acf","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-20T06:33:59.587034+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-14T05:04:31.670568Z","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-07T00:55:30.738430Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1809.10185","last_updated":"2018-09-26T18:49:07Z","snapshot_observed_at":"2026-08-14T18:23:05.314781Z","submitted_at":"2018-09-26T18:49:07Z","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10185","snapshot_observed_at":"2026-08-14T05:04:31.670568Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1909.02177","last_updated":"2020-01-15T23:02:14Z","snapshot_observed_at":"2026-08-19T14:36:36.094528Z","submitted_at":"2019-09-05T01:50:14Z","title":"NERO: A Neural Rule Grounding Framework for Label-Efficient Relation Extraction","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T05:04:31.670568Z"},"links":{"cited_paper":"/paper/1809.10185","citing_paper":"/paper/1909.02177"},"observation_digest":"sha256:86cd899c32b1f6a8ea5abdc055ff0b585b7f85117149810cea8a4c7407626ded","observation_id":"a8d12a2d-d4e5-41e6-a26f-4e9ad29334bb","resolution":{"observed_at":"2026-08-14T05:04:31.670568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10185","last_updated":"2018-09-26T18:49:07Z","snapshot_observed_at":"2026-08-14T18:23:05.314781Z","submitted_at":"2018-09-26T18:49:07Z","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","version":1},"cited_work":{"arxiv_id":"1809.10185","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.10185","snapshot_observed_at":"2026-08-07T00:55:30.738430Z","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","venue":"cs.CL","work_id":"ccc3294a-e1da-4013-946a-241ed12422c0","year":2018},"citing_paper":{"arxiv_id":"2506.12452","last_updated":"2025-06-14T11:12:34Z","snapshot_observed_at":"2026-08-16T16:48:03.338043Z","submitted_at":"2025-06-14T11:12:34Z","title":"A Pluggable Multi-Task Learning Framework for Sentiment-Aware Financial Relation Extraction","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T00:55:30.559726Z"},"links":{"cited_paper":"/paper/1809.10185","citing_paper":"/paper/2506.12452"},"observation_digest":"sha256:44b5c0939a6cb458d8b5f970e005947182e08d22ea156d632d9d52540833ef6b","observation_id":"a4ed8145-eb8b-4791-ae75-655a72fb6cb3","resolution":{"observed_at":"2026-08-07T00:55:30.742439Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1809.10185/citation-record","integrity":"/paper/1809.10185/integrity","json":"/paper/1809.10185/citation-record.json","paper":"/paper/1809.10185"},"outbound":[],"paper":{"arxiv_id":"1809.10185","last_updated":"2018-09-26T18:49:07Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T18:23:05.314781Z","submitted_at":"2018-09-26T18:49:07Z","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1809.10185."}