{"as_of":"2026-08-07T22:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29de7c4ff03cea4931e6a5f628da7fe6b33c42d1cf5e1a4465838612fb313356","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-07T06:34:17.273281+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-06T13:29:58.152162Z","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-05-10T09:38:43.015967Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.03798","last_updated":"2021-05-18T13:06:26Z","snapshot_observed_at":"2026-08-07T18:35:04.904773Z","submitted_at":"2020-11-07T16:09:03Z","title":"PairRE: Knowledge Graph Embeddings via Paired Relation Vectors","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.03798","snapshot_observed_at":"2026-08-06T13:29:58.152162Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20620","last_updated":"2025-07-28T08:35:11Z","snapshot_observed_at":"2026-08-06T13:29:57.446848Z","submitted_at":"2025-07-28T08:35:11Z","title":"Complementarity-driven Representation Learning for Multi-modal Knowledge Graph Completion","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T13:29:58.152162Z"},"links":{"cited_paper":"/paper/2011.03798","citing_paper":"/paper/2507.20620"},"observation_digest":"sha256:80bc81ccba7203ee71ff2a55e67d7018867c448da6fb006a4d4c16e110d6deb8","observation_id":"fc788df6-56a9-40fd-8bfb-7a34af532801","resolution":{"observed_at":"2026-08-06T13:29:58.152162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.03798","last_updated":"2021-05-18T13:06:26Z","snapshot_observed_at":"2026-08-07T18:35:04.904773Z","submitted_at":"2020-11-07T16:09:03Z","title":"PairRE: Knowledge Graph Embeddings via Paired Relation Vectors","version":3},"cited_work":{"arxiv_id":"2011.03798","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.03798","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pairre: Knowledge graph em- beddings via paired relation vectors","venue":null,"work_id":"0409177a-a614-4e1c-ae0f-cf3ecad99b84","year":2011},"citing_paper":{"arxiv_id":"2604.18344","last_updated":"2026-04-20T14:41:47Z","snapshot_observed_at":"2026-07-06T23:05:13.178333Z","submitted_at":"2026-04-20T14:41:47Z","title":"One Pass for All: A Discrete Diffusion Model for Knowledge Graph Triple Set Prediction","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T05:11:15.653424Z"},"links":{"cited_paper":"/paper/2011.03798","citing_paper":"/paper/2604.18344"},"observation_digest":"sha256:36103a51a07274dc266110e1d6096ddf4c279471765a040e3dd1d12482c8535d","observation_id":"f43d0b9e-9232-42f3-b63b-373ae1f7811c","resolution":{"observed_at":"2026-05-10T09:38:43.018323Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2011.03798/citation-record","integrity":"/paper/2011.03798/integrity","json":"/paper/2011.03798/citation-record.json","paper":"/paper/2011.03798"},"outbound":[],"paper":{"arxiv_id":"2011.03798","last_updated":"2021-05-18T13:06:26Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T18:35:04.904773Z","submitted_at":"2020-11-07T16:09:03Z","title":"PairRE: Knowledge Graph Embeddings via Paired Relation Vectors"},"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 2 inbound Pith citation observations for arXiv:2011.03798."}