{"as_of":"2026-08-18T15:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8363751bc5dcb8209c5cb455248f79daac0f9a3c32476dfd549301b6216a6cd0","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":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":48,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:10:51.853228Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":381,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2010.03496","last_updated":"2026-05-11T14:01:33Z","snapshot_observed_at":"2026-08-14T10:15:01.776948Z","submitted_at":"2020-10-07T16:04:06Z","title":"Inductive Entity Representations from Text via Link Prediction","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-24T14:33:19.150253Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2010.03496"},"observation_digest":"sha256:54c07edc4c68f9ab90197c126cdb0920b2fc39d1ce78fb15f16860d69f5e9b49","observation_id":"2cb7885e-cf4d-4c27-b2b6-acf267d7cbb2","resolution":{"observed_at":"2026-05-24T14:34:34.755865Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-12T21:59:56.830219Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.08165","last_updated":"2025-04-30T12:02:25Z","snapshot_observed_at":"2026-08-17T21:39:53.074512Z","submitted_at":"2024-11-12T20:15:58Z","title":"Retrieval, Reasoning, Re-ranking: A Context-Enriched Framework for Knowledge Graph Completion","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T21:59:56.830219Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2411.08165"},"observation_digest":"sha256:67952e6dc11014160deb323556c0950ac838da938406c1f3f1aa5ab30f450750","observation_id":"f26cd4c9-bc61-4cf5-a115-439761c0df95","resolution":{"observed_at":"2026-08-12T21:59:56.830219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-12T21:49:40.739849Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.08278","last_updated":"2024-11-14T15:49:46Z","snapshot_observed_at":"2026-08-16T04:05:49.959919Z","submitted_at":"2024-11-13T01:33:05Z","title":"Knowledge Bases in Support of Large Language Models for Processing Web News","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T21:49:40.739849Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2411.08278"},"observation_digest":"sha256:7776d1dc9578f4c6a7be3bd86a71c2af85f551be1c65eb3c24a8b3a0d2d19e22","observation_id":"bb20ef12-1d1a-4752-bcce-3591893678f6","resolution":{"observed_at":"2026-08-12T21:49:40.739849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-12T17:19:50.899082Z","title":"KG-BERT: BERT for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2411.12671","last_updated":"2024-11-19T17:23:55Z","snapshot_observed_at":"2026-08-18T00:30:37.181584Z","submitted_at":"2024-11-19T17:23:55Z","title":"Neurosymbolic Graph Enrichment for Grounded World Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T17:19:50.899082Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2411.12671"},"observation_digest":"sha256:563f1debbd48afe3a0be706da974a2fc7be6073e9b4a091f1458a3bf70feb456","observation_id":"731a7723-011b-4e28-acbe-597a5fdd0d05","resolution":{"observed_at":"2026-08-12T17:19:50.899082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-12T14:07:57.787496Z","title":"Kg-bert: Bert for knowledge graph completion","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-15T16:37:02.681992Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.787496Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:4e6dd0975406582ddbb00cfe48b78a070224fdddefe0701d37118526b0e250aa","observation_id":"5c89d46d-05cd-41dd-aeef-237ea7def880","resolution":{"observed_at":"2026-08-12T14:07:57.787496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-12T11:29:40.774455Z","title":"arXiv preprint arXiv:1909.03193 (2019) A survey on cutting-edge relation extraction 49","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.18157","last_updated":"2024-11-27T09:04:47Z","snapshot_observed_at":"2026-08-18T12:47:51.984933Z","submitted_at":"2024-11-27T09:04:47Z","title":"A survey on cutting-edge relation extraction techniques based on language models","version":1},"reference_index":139,"source":"pdf_text","source_observed_at":"2026-08-12T11:29:40.774455Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2411.18157"},"observation_digest":"sha256:78bcabe7326b542ec45a94d247858d527c84231ed035955af07c43379a75e4ee","observation_id":"acb6d09e-c3e2-479a-a856-0e470183076f","resolution":{"observed_at":"2026-08-12T11:29:40.774455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-12T10:37:51.106013Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.19064","last_updated":"2024-11-28T11:24:43Z","snapshot_observed_at":"2026-08-17T06:31:10.639871Z","submitted_at":"2024-11-28T11:24:43Z","title":"Way to Specialist: Closing Loop Between Specialized LLM and Evolving Domain Knowledge Graph","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T10:37:51.106013Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2411.19064"},"observation_digest":"sha256:cf42d5f19d6d8133167c333c76fcfeae98df2209ad5f44c402d3fd27ae2918f8","observation_id":"6eb3dd01-d386-493f-b77d-6e844262ecde","resolution":{"observed_at":"2026-08-12T10:37:51.106013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-11T15:28:02.084721Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11016","last_updated":"2024-12-15T02:03:16Z","snapshot_observed_at":"2026-08-17T06:53:12.944155Z","submitted_at":"2024-12-15T02:03:16Z","title":"A Contextualized BERT model for Knowledge Graph Completion","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T15:28:02.084721Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2412.11016"},"observation_digest":"sha256:675a6e9798322f6830de71fdf4b3902a0a47eabfa5a4d158bef90568bcff3f29","observation_id":"dd3e2736-4200-4683-be60-8d2bfee4ee86","resolution":{"observed_at":"2026-08-11T15:28:02.084721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-10T22:48:53.685650Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.00759","last_updated":"2025-07-10T07:45:30Z","snapshot_observed_at":"2026-08-14T13:08:58.878185Z","submitted_at":"2025-01-01T07:05:32Z","title":"Enhancing Transformers for Generalizable First-Order Logical Entailment","version":3},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T22:48:53.685650Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2501.00759"},"observation_digest":"sha256:c2b81719de49132a707130dae1642eddc9d78612204d137362d0d44405c3f9a1","observation_id":"601fc870-6dc9-48a6-a042-c5503c1a66f8","resolution":{"observed_at":"2026-08-10T22:48:53.685650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-09T12:01:56.694051Z","title":"Kg-bert: Bert for knowledge graph completion","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2502.02501","last_updated":"2025-02-04T17:16:14Z","snapshot_observed_at":"2026-08-10T18:24:01.047181Z","submitted_at":"2025-02-04T17:16:14Z","title":"Graph-based Document Structure Analysis","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T12:01:56.694051Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2502.02501"},"observation_digest":"sha256:79226c146a8d0cbb2c656514ebeef70c5dc52673fa14959b830061c729ddcb98","observation_id":"b080561d-3d5b-4a62-8b9d-8770117e78cd","resolution":{"observed_at":"2026-08-09T12:01:56.694051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-08T16:16:36.669355Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.06257","last_updated":"2025-02-10T08:45:56Z","snapshot_observed_at":"2026-08-17T22:02:53.258159Z","submitted_at":"2025-02-10T08:45:56Z","title":"K-ON: Stacking Knowledge On the Head Layer of Large Language Model","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T16:16:36.669355Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2502.06257"},"observation_digest":"sha256:3af1d01c9b839271beecc9ebf59ad26100bf4b07fa7dbb1fb7bb26ead244b193","observation_id":"808b2086-3abf-420a-b2a7-19f220692445","resolution":{"observed_at":"2026-08-08T16:16:36.669355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2502.08547","last_updated":"2026-04-04T14:27:56Z","snapshot_observed_at":"2026-08-16T23:42:08.493128Z","submitted_at":"2025-02-12T16:29:39Z","title":"Representation learning to advance multi-institutional studies with electronic health record data from US and France","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-23T03:18:08.764541Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2502.08547"},"observation_digest":"sha256:7d5893550d1527201aa4a5a30e90b84d7d49a116f3d3d525ca577d43c3d83157","observation_id":"6a1cd167-53cd-467c-8042-7e91e2dbe162","resolution":{"observed_at":"2026-05-23T03:22:28.169890Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-16T12:10:51.853228Z","title":"Kg-bert: Bert for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2504.13983","last_updated":"2025-04-18T07:54:10Z","snapshot_observed_at":"2026-08-16T12:04:22.514021Z","submitted_at":"2025-04-18T07:54:10Z","title":"QuatE-D: A Distance-Based Quaternion Model for Knowledge Graph Embedding","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:10:51.853228Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2504.13983"},"observation_digest":"sha256:4a0d0263035e9f923962f9065cdf62564ea469d17418911116a6a62b07fa896d","observation_id":"e52f5035-8baf-4dd0-b5db-094eb1663fb9","resolution":{"observed_at":"2026-08-16T12:10:51.853228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T13:23:44.639590Z","title":"Kg-bert: Bert for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.21973","last_updated":"2025-05-28T04:50:58Z","snapshot_observed_at":"2026-08-09T02:29:30.226783Z","submitted_at":"2025-05-28T04:50:58Z","title":"Towards Structure-aware Model for Multi-modal Knowledge Graph Completion","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:23:44.639590Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2505.21973"},"observation_digest":"sha256:789f53fc3ff9b0e4f8c282a52e431c6bb30eb2a16ade3f3b7d73c1563c6ab362","observation_id":"18a8268d-2b36-40e5-9a2b-8121cad9c730","resolution":{"observed_at":"2026-08-07T13:23:44.639590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T12:51:35.033332Z","title":"Kg-bert: Bert for knowledge graph completion.arXiv preprint arXiv:1909.03193,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-17T21:17:14.673037Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.033332Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:e724538bb075c46a2115a68849575497298add29c3db3fb8a839c8eac644f9ce","observation_id":"2c9e7866-a6cb-499a-9e2c-77157afabe79","resolution":{"observed_at":"2026-08-07T12:51:35.033332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T12:40:56.064765Z","title":"arXiv preprint arXiv:1909.03193, 2019","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.24036","last_updated":"2025-05-29T22:15:25Z","snapshot_observed_at":"2026-08-10T08:36:25.548397Z","submitted_at":"2025-05-29T22:15:25Z","title":"GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:40:56.064765Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2505.24036"},"observation_digest":"sha256:334ae2d75c8a93f49b2c6320989d5f43397b4597543542ddc038fddc9393b579","observation_id":"1f92cf71-1887-417d-a165-4000ac713539","resolution":{"observed_at":"2026-08-07T12:40:56.064765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T12:01:08.738415Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.00826","last_updated":"2025-08-08T18:42:44Z","snapshot_observed_at":"2026-08-17T11:15:51.165038Z","submitted_at":"2025-06-01T04:12:25Z","title":"HERGC: Heterogeneous Experts Representation and Generative Completion for Multimodal Knowledge Graphs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T12:01:08.738415Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.00826"},"observation_digest":"sha256:fd575586b0b673d4595d8ebe651622053be2b2e42e9fa8ae739b1f354e07fcc6","observation_id":"81cd670b-0e2d-4a56-92c9-0e13a8a6d176","resolution":{"observed_at":"2026-08-07T12:01:08.738415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T11:04:37.397975Z","title":null,"venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.03576","last_updated":"2025-06-04T04:47:24Z","snapshot_observed_at":"2026-08-10T07:18:13.855710Z","submitted_at":"2025-06-04T04:47:24Z","title":"KG-BiLM: Knowledge Graph Embedding via Bidirectional Language Models","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:37.397975Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.03576"},"observation_digest":"sha256:19e2b82465bdae9f0f1eb5e47bcd209dea87fbad26c3463a627f96c5f2b1eba5","observation_id":"41cc3616-ca8c-4a16-8e55-f78c77761802","resolution":{"observed_at":"2026-08-07T11:04:37.397975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T10:18:55.796546Z","title":"Kg-bert: Bert for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.05626","last_updated":"2025-06-29T19:40:42Z","snapshot_observed_at":"2026-08-16T08:33:10.595904Z","submitted_at":"2025-06-05T22:59:39Z","title":"Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods","version":2},"reference_index":169,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:55.796546Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.05626"},"observation_digest":"sha256:e6c7427e641e253a594d59b8d1e107b3cec8c11daab3a01206d5bf38b9d8cd3d","observation_id":"bc6ca306-6159-4d3b-84c1-2eb21a504cc0","resolution":{"observed_at":"2026-08-07T10:18:55.796546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-16T06:02:34.600552Z","title":"Kg-bert: Bert for knowledge graph completion,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11012","last_updated":"2025-04-27T09:42:09Z","snapshot_observed_at":"2026-08-18T10:58:49.589137Z","submitted_at":"2025-04-27T09:42:09Z","title":"A Survey of Task-Oriented Knowledge Graph Reasoning: Status, Applications, and Prospects","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T06:02:34.600552Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.11012"},"observation_digest":"sha256:2b9ca3e7772435fae974b7efc95aeda3af6af55842b5bc57801500fc0fc1ae93","observation_id":"95520a33-676e-44f8-942c-d108d8de1391","resolution":{"observed_at":"2026-08-16T06:02:34.600552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T06:05:19.712126Z","title":"KG-BERT: BERT for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.11099","last_updated":"2025-06-06T13:30:36Z","snapshot_observed_at":"2026-08-09T13:15:35.854323Z","submitted_at":"2025-06-06T13:30:36Z","title":"Knowledge Graph Embeddings with Representing Relations as Annular Sectors","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:19.712126Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.11099"},"observation_digest":"sha256:2af08cbdb21d65b53b91a8add374f3312056e935bbd0c5ebf120e9a094ad838d","observation_id":"cc9819f0-73e4-407f-b302-d88944dd6eab","resolution":{"observed_at":"2026-08-07T06:05:19.712126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-15T18:36:09.715585Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19661","last_updated":"2025-06-24T14:24:20Z","snapshot_observed_at":"2026-08-15T18:26:28.760835Z","submitted_at":"2025-06-24T14:24:20Z","title":"Higher-Order Graph Databases","version":1},"reference_index":184,"source":"pdf_text","source_observed_at":"2026-08-15T18:36:09.715585Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.19661"},"observation_digest":"sha256:cbecacf9142ae2c13b6016f9f2d1d1e4dc7de4c1e713f952e55fafa1f5b02051","observation_id":"b0e190c0-39df-41ad-ad53-9846b8cbc115","resolution":{"observed_at":"2026-08-15T18:36:09.715585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-06T22:19:15.122284Z","title":"Kg-bert: Bert for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.22036","last_updated":"2026-07-13T03:35:11Z","snapshot_observed_at":"2026-08-17T08:32:42.131424Z","submitted_at":"2025-06-27T09:32:58Z","title":"Hyper-modal Imputation Diffusion Embedding with Dual-Distillation for Federated Multimodal Knowledge Graph Completion","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T22:19:15.122284Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.22036"},"observation_digest":"sha256:6adcceab261335423c4ac610b83ab26b15d6444df626d401776b30b61f033c19","observation_id":"e023905d-3a18-47cb-976e-a5fb65c6f53e","resolution":{"observed_at":"2026-08-06T22:19:15.122284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-06T21:55:58.091668Z","title":"Kg-bert: Bert for knowledge graph completion,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.23137","last_updated":"2025-08-30T20:56:07Z","snapshot_observed_at":"2026-08-16T04:11:11.002564Z","submitted_at":"2025-06-29T08:22:04Z","title":"Flow-Modulated Scoring for Semantic-Aware Knowledge Graph Completion","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:55:58.091668Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2506.23137"},"observation_digest":"sha256:da90fc8925a137d44c5d8533cee08f87a3dc08d9e0b171bb299a288814d76bb8","observation_id":"3d6e647e-f24a-46d8-9cb7-7d45cf31e2f6","resolution":{"observed_at":"2026-08-06T21:55:58.091668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-06T16:14:13.230913Z","title":"CoRR abs/1909.03193 (2019), http://arxiv.org/abs/1909.03193","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.14334","last_updated":"2025-07-18T19:26:16Z","snapshot_observed_at":"2026-08-07T17:08:10.212205Z","submitted_at":"2025-07-18T19:26:16Z","title":"Language Models as Ontology Encoders","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:14:13.230913Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2507.14334"},"observation_digest":"sha256:18b32474496b47fe521329d840b478c080dd5d31f9b69302346d1946bf1023e8","observation_id":"d12f0e82-9737-44d7-abbb-3abbb4641363","resolution":{"observed_at":"2026-08-06T16:14:13.230913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-06T15:58:46.886276Z","title":null,"venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2507.14468","last_updated":"2025-07-22T04:03:12Z","snapshot_observed_at":"2026-08-13T12:56:43.278723Z","submitted_at":"2025-07-19T04:03:42Z","title":"BioGraphFusion: Graph Knowledge Embedding for Biological Completion and Reasoning","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T15:58:46.886276Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2507.14468"},"observation_digest":"sha256:44845df4bd4209211fde91a96365f535d80573c361c9da5ac9f9b5fe9ef7e3e8","observation_id":"78ec93d0-133b-4e9f-a5aa-f26cef855831","resolution":{"observed_at":"2026-08-06T15:58:46.886276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-06T15:25:50.880973Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.16011","last_updated":"2025-07-21T19:11:31Z","snapshot_observed_at":"2026-08-16T11:37:44.724381Z","submitted_at":"2025-07-21T19:11:31Z","title":"mRAKL: Multilingual Retrieval-Augmented Knowledge Graph Construction for Low-Resourced Languages","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T15:25:50.880973Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2507.16011"},"observation_digest":"sha256:6c44e96856117c07258990efc84aa6f8b7cd684b5b8e5d2cb2f21fc2bee42701","observation_id":"acf37294-238f-4e25-9c80-f689a745b8df","resolution":{"observed_at":"2026-08-06T15:25:50.880973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-06T13:25:20.952739Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20738","last_updated":"2025-07-28T11:42:17Z","snapshot_observed_at":"2026-08-09T15:42:10.162641Z","submitted_at":"2025-07-28T11:42:17Z","title":"Dark Side of Modalities: Reinforced Multimodal Distillation for Multimodal Knowledge Graph Reasoning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T13:25:20.952739Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2507.20738"},"observation_digest":"sha256:ec3af29134de1be7d9805a7c86d307dd1e00a8c83056dfaf6fe0c66f92bf3c31","observation_id":"4839a078-e7c9-4111-bc22-e89c0c699a90","resolution":{"observed_at":"2026-08-06T13:25:20.952739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T12:53:33.009885Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.01166","last_updated":"2025-09-01T06:38:11Z","snapshot_observed_at":"2026-08-18T07:25:36.462429Z","submitted_at":"2025-09-01T06:38:11Z","title":"Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T12:53:33.009885Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2509.01166"},"observation_digest":"sha256:3b4cd7a455e9619b2a8c088a6788a19a275a2862d437a7a3741ee05b4f754a44","observation_id":"e5750814-3785-4959-84d3-6e36455e166d","resolution":{"observed_at":"2026-08-05T12:53:33.009885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-04T23:34:45.246047Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.06531","last_updated":"2025-09-08T10:36:49Z","snapshot_observed_at":"2026-08-10T11:51:18.389713Z","submitted_at":"2025-09-08T10:36:49Z","title":"SLiNT: Structure-aware Language Model with Injection and Contrastive Training for Knowledge Graph Completion","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T23:34:45.246047Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2509.06531"},"observation_digest":"sha256:dd3f4d5db0036122e75c6fc83d863bda80ed058ad83752d78a319cc62a2beffb","observation_id":"bfd5eeb8-6eef-485c-822b-b701d0fd18f9","resolution":{"observed_at":"2026-08-04T23:34:45.246047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-15T16:22:08.128749Z","title":"Mao, and Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.06576","last_updated":"2025-09-08T11:45:59Z","snapshot_observed_at":"2026-08-16T23:43:11.048410Z","submitted_at":"2025-09-08T11:45:59Z","title":"Automated Hierarchical Graph Construction for Multi-source Electronic Health Records","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T16:22:08.128749Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2509.06576"},"observation_digest":"sha256:32bbbcf6fd3ac4ec58fc6da036527802cc7fd021a5cade5a1731a8a3e2bd501e","observation_id":"44b4db2b-8935-4e77-a2a9-dc676102bfc8","resolution":{"observed_at":"2026-08-15T16:22:08.128749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-15T16:12:15.484847Z","title":"Yongmin Yoo, Dongjin Lim, and Kyungsun Kim","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2509.07860","last_updated":"2025-09-09T15:40:23Z","snapshot_observed_at":"2026-08-15T16:07:14.141194Z","submitted_at":"2025-09-09T15:40:23Z","title":"KLIPA: A Knowledge Graph and LLM-Driven QA Framework for IP Analysis","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T16:12:15.484847Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2509.07860"},"observation_digest":"sha256:7f165640c50196f584767b4d615e847c42b8625317c69741f24a442071ba69f8","observation_id":"461b3ac7-c4c8-4fa4-8c1b-85314aa0e446","resolution":{"observed_at":"2026-08-15T16:12:15.484847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-04T19:01:18.591936Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09522","last_updated":"2025-09-11T15:02:54Z","snapshot_observed_at":"2026-08-14T17:45:25.374756Z","submitted_at":"2025-09-11T15:02:54Z","title":"Towards Explainable Job Title Matching: Leveraging Semantic Textual Relatedness and Knowledge Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T19:01:18.591936Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2509.09522"},"observation_digest":"sha256:1d019c553ed29a3ffbab6a6592f88222937af7db501dda6c5b3593482f8bbbb4","observation_id":"0751cfde-6a05-4ab2-a5eb-29105eead7d6","resolution":{"observed_at":"2026-08-04T19:01:18.591936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2509.26383","last_updated":"2026-05-22T06:49:31Z","snapshot_observed_at":"2026-08-15T06:02:30.042052Z","submitted_at":"2025-09-30T15:14:24Z","title":"Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement Learning","version":5},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-25T07:44:05.582003Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2509.26383"},"observation_digest":"sha256:4488513621ecff49cf3df7ed31bcb7a4a091736bf0653b386d5e17785c2ca3ff","observation_id":"412cf095-209b-4013-a90d-55ca35f2cc8d","resolution":{"observed_at":"2026-05-25T07:45:28.901747Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2510.21828","last_updated":"2026-04-29T06:52:53Z","snapshot_observed_at":"2026-08-13T10:45:59.391947Z","submitted_at":"2025-10-22T02:23:40Z","title":"Structured and Abstractive Reasoning on Multi-modal Relational Knowledge Images","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T04:32:54.811976Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2510.21828"},"observation_digest":"sha256:b919e8a51a2fefbd5257e5f3df36eb5be1e0267c6e8038c7b0e5f5f6c8f41498","observation_id":"7976e287-672b-4f5b-814a-40a3348f4406","resolution":{"observed_at":"2026-05-18T04:35:52.556140Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-04T06:26:37.331580Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.10485","last_updated":"2026-08-02T18:15:20Z","snapshot_observed_at":"2026-08-18T02:45:59.074499Z","submitted_at":"2026-01-15T15:06:56Z","title":"Panning for Gold: Expanding Domain-Specific Knowledge Graphs with General Knowledge","version":4},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-04T06:26:37.331580Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2601.10485"},"observation_digest":"sha256:cbbc4ce1028d4159a71481e8f09ca24d12cceae262982a046cee6f8f5d53b7c3","observation_id":"9a3841a1-1ef7-4991-a172-1d9523a01d6b","resolution":{"observed_at":"2026-08-04T06:26:37.331580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2602.14335","last_updated":"2026-04-10T20:53:16Z","snapshot_observed_at":"2026-08-14T23:18:07.977911Z","submitted_at":"2026-02-15T23:07:10Z","title":"Predicting New Concept-Object Associations in Astronomy by Mining the Literature","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-15T21:30:43.680054Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2602.14335"},"observation_digest":"sha256:ee43065df338c393853f64505d256790676cb6267d1066874deb8a22d019f789","observation_id":"3f0f4a82-f779-4d37-9958-1dca7102bf26","resolution":{"observed_at":"2026-05-15T21:31:39.429545Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2604.21649","last_updated":"2026-04-23T13:13:37Z","snapshot_observed_at":"2026-08-13T18:51:10.723583Z","submitted_at":"2026-04-23T13:13:37Z","title":"GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-09T22:13:43.200886Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2604.21649"},"observation_digest":"sha256:8c0b6acd6d55d2f70e37f2b39590846910d3151a4cb564ea414ffb1987ded433","observation_id":"097ce6ad-6298-4092-ae8b-655f52cfbef6","resolution":{"observed_at":"2026-05-09T22:49:16.146828Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2604.25693","last_updated":"2026-07-20T12:20:22Z","snapshot_observed_at":"2026-08-05T21:48:11.083839Z","submitted_at":"2026-04-28T14:21:03Z","title":"RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-07T16:25:52.326625Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2604.25693"},"observation_digest":"sha256:efba9a73458cbc7a1f3c0b3fc94c970f1df0415a649751d0e770c3268751f612","observation_id":"afaebf95-ffc3-42ff-b55c-4e9fd4c25a9f","resolution":{"observed_at":"2026-05-11T23:41:19.130438Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-02T15:27:29.459793Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2604.25693","last_updated":"2026-07-20T12:20:22Z","snapshot_observed_at":"2026-08-05T21:48:11.083839Z","submitted_at":"2026-04-28T14:21:03Z","title":"RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T15:27:29.459793Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2604.25693"},"observation_digest":"sha256:042c661485e742633ae4a94da6bc08d25f98c80148bcf8e292cde92365489b5d","observation_id":"cdf18e27-10de-424b-95a0-eba831b2c3f8","resolution":{"observed_at":"2026-08-02T15:27:29.459793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2605.10317","last_updated":"2026-05-11T10:17:52Z","snapshot_observed_at":"2026-08-17T02:43:11.351651Z","submitted_at":"2026-05-11T10:17:52Z","title":"Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-12T03:46:55.809501Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2605.10317"},"observation_digest":"sha256:b17059b78b03efd82e89d41482380f0f5dbe4f1a7332a93f6cd39101354dc4e3","observation_id":"becdec5a-d7a3-4c18-a5db-e25a2a4f205e","resolution":{"observed_at":"2026-05-12T06:56:31.180299Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2605.10488","last_updated":"2026-05-11T12:48:31Z","snapshot_observed_at":"2026-08-15T06:11:29.812924Z","submitted_at":"2026-05-11T12:48:31Z","title":"DeepRefine: Agent-Compiled Knowledge Refinement via Reinforcement Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-12T04:19:01.836535Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2605.10488"},"observation_digest":"sha256:531e395c36755216a9aa6236a6dcbb5f3b7439d523c99bf3035112a81aaa5043","observation_id":"351e7c83-7d6d-4e6b-8915-f342794b22a2","resolution":{"observed_at":"2026-05-12T06:26:23.591946Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2605.11159","last_updated":"2026-05-11T19:07:14Z","snapshot_observed_at":"2026-08-15T05:01:06.733748Z","submitted_at":"2026-05-11T19:07:14Z","title":"CORE: Cyclic Orthotope Relation Embedding for Knowledge Graph Completion","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-13T06:18:22.310443Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2605.11159"},"observation_digest":"sha256:16144a3d4400252ba20531627c14ca7c3e5202fb9e62a920a742121231e3a7e8","observation_id":"a49ee589-8edf-4022-b1c9-50447a3c6675","resolution":{"observed_at":"2026-05-13T06:22:23.459757Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2605.18768","last_updated":"2026-04-13T10:07:03Z","snapshot_observed_at":"2026-08-12T13:35:23.529258Z","submitted_at":"2026-04-13T10:07:03Z","title":"ClinQueryAgent: A Conversational Agent for Population Health Management","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-05-21T01:31:07.031424Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2605.18768"},"observation_digest":"sha256:0296321c8e07db4ea89fca24464b8e4cd18603d3c146bf67794ece057dbc5c3b","observation_id":"121260e8-ef1a-41a9-9b39-ba187815e3dc","resolution":{"observed_at":"2026-05-21T01:33:56.208985Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2606.08658","last_updated":"2026-06-07T14:56:13Z","snapshot_observed_at":"2026-08-14T07:16:33.050356Z","submitted_at":"2026-06-07T14:56:13Z","title":"Extending Ontologies: From Dense Embeddings to Hybrid Quantum-Fuzzy Systems","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-27T18:44:15.043757Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2606.08658"},"observation_digest":"sha256:1d723b933cf4d550fc72f0e3658f1534b9f952a56c77f7fd079f7ac4fec80f8c","observation_id":"e10fe723-8746-4a4c-9bcf-e87be896852a","resolution":{"observed_at":"2026-07-02T22:37:26.309498Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"1909.03193","doi":"10.48550/arxiv.1909.03193","metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kg-bert: Bert for knowledge graph completion","venue":"arXiv (Cornell University)","work_id":"55ce3e38-1f8c-4c0b-a592-50a2b8e0e00d","year":1909},"citing_paper":{"arxiv_id":"2606.11560","last_updated":"2026-06-10T01:39:41Z","snapshot_observed_at":"2026-08-14T14:41:48.630129Z","submitted_at":"2026-06-10T01:39:41Z","title":"LLMs+Graphs: Toward Graph-Native, Synergistic AI Systems","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-27T08:00:38.559294Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2606.11560"},"observation_digest":"sha256:0def1f3266de6a2f3783481a32d20dbf6fb8696fc3a67a1c7076079d3bdfb301","observation_id":"9f52be08-d6c2-4135-9d52-b0f2d0815297","resolution":{"observed_at":"2026-07-03T13:28:19.028141Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-01T11:35:16.084016Z","title":"Kg-bert: Bert for knowledge graph completion.arXiv preprint arXiv:1909.03193, 2019","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2607.19845","last_updated":"2026-07-22T07:30:39Z","snapshot_observed_at":"2026-08-18T12:45:41.365902Z","submitted_at":"2026-07-22T07:30:39Z","title":"Sentence Splitter: Uncovering Latent Factual Structure for Self-Supervised Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T11:35:16.084016Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2607.19845"},"observation_digest":"sha256:1cc32dab2031b42b3d2b744cf03c3a27310f596b49db378288e0163edea6c059","observation_id":"c220c043-e9ae-4212-8ef7-56590c17322d","resolution":{"observed_at":"2026-08-01T11:35:16.084016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-01T00:10:52.630731Z","title":"KG-BERT : BERT for knowledge graph completion","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2607.26346","last_updated":"2026-07-28T23:40:49Z","snapshot_observed_at":"2026-08-14T01:40:24.408420Z","submitted_at":"2026-07-28T23:40:49Z","title":"Toward a Unified Statistical Theory of Unsupervised Pretraining and Supervised Neural Knowledge Graph Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T00:10:52.630731Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2607.26346"},"observation_digest":"sha256:e1d409db7c5e4629336674d29b54d3c1276daef10c44f35d8846aa18fe72acc4","observation_id":"f87f1c74-e5b3-45db-9632-d09cddbc13f0","resolution":{"observed_at":"2026-08-01T00:10:52.630731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1909.03193/citation-record","integrity":"/paper/1909.03193/integrity","json":"/paper/1909.03193/citation-record.json","paper":"/paper/1909.03193"},"outbound":[],"paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T08:11:28.014412Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 48 inbound Pith citation observations for arXiv:1909.03193."}