{"as_of":"2026-08-19T19:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8feda541a05080a31f332409454295f6d89e2c5f909a464ea4691c687add887f","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:56:02.527511Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-16T06:02:34.883131Z","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-05T23:17:25.589001Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.06178","snapshot_observed_at":"2026-08-16T06:02:34.883131Z","title":"Distributional negative sampling for knowl- edge base 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":132,"source":"pdf_text","source_observed_at":"2026-08-16T06:02:34.883131Z"},"links":{"cited_paper":"/paper/1908.06178","citing_paper":"/paper/2506.11012"},"observation_digest":"sha256:1a398c14f256e33ab5333a66e8fdb05fbcad4226d89c28d852479ae391c071d6","observation_id":"b3b5ce7a-9749-4a7c-92fe-5e66d61dc9e2","resolution":{"observed_at":"2026-08-16T06:02:34.883131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"cited_work":{"arxiv_id":"1908.06178","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06178","snapshot_observed_at":"2026-08-05T23:17:25.589001Z","title":"Distributional Negative Sampling for Knowledge Base Completion","venue":"cs.LG","work_id":"00f9b9a7-4674-4814-a78a-7a9db07facb6","year":2019},"citing_paper":{"arxiv_id":"2508.05587","last_updated":"2025-08-07T17:24:34Z","snapshot_observed_at":"2026-08-10T10:36:41.804677Z","submitted_at":"2025-08-07T17:24:34Z","title":"Enhancing PyKEEN with Multiple Negative Sampling Solutions for Knowledge Graph Embedding Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T23:17:25.106722Z"},"links":{"cited_paper":"/paper/1908.06178","citing_paper":"/paper/2508.05587"},"observation_digest":"sha256:3eee16074defa6cc9c0466d41273b00b5a78e9987de51702d0fc7452ad9cec2c","observation_id":"1ae30416-7e25-4f89-bd13-4661bdf034c9","resolution":{"observed_at":"2026-08-05T23:17:25.593977Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.06178/citation-record","integrity":"/paper/1908.06178/integrity","json":"/paper/1908.06178/citation-record.json","paper":"/paper/1908.06178"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.758438Z","title":"Freebase: a collaboratively created graph database for structuring human knowledge","venue":null,"work_id":"d8b120b0-0537-4212-99fb-b72bf2dc82f4","year":2008},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.458718Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:2811fa87d61c9b7d7ae4c752b2a8bbe2bb63642dcf85c5ddda80e33a1a211905","observation_id":"4af9ffd4-c47d-42bb-98d0-a33437584d5a","resolution":{"observed_at":"2026-08-14T12:56:02.761979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.747379Z","title":"Learning structured embeddings of knowledge bases","venue":null,"work_id":"f64b1c71-267e-4220-8769-95ccde193971","year":2011},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.463088Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:fd4384368bb1482236a5b66c9cf8b0666d77dd34e150f4ab15c827561aba58b3","observation_id":"ea0cfc08-a298-408c-96f5-872abb69a75d","resolution":{"observed_at":"2026-08-14T12:56:02.751272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.466733Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.466733Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:d34d0692ae7879f9697c4a7b5d178f6d07caea87e666661125f8822eab41baf7","observation_id":"ebab2618-5ffa-4991-be50-0ea049b0f93c","resolution":{"observed_at":"2026-08-14T12:56:02.466733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.729697Z","title":"Special issue on learning from imbalanced data sets","venue":null,"work_id":"b1c69eaf-87a4-4037-846a-c7508d9fdf74","year":2004},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.471017Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:57ac39a0458c103315ba51da4a3726afd5dec53d620e4d723681f3bfc28b9fa8","observation_id":"9dcb11d7-177d-480e-9743-406e48b389c0","resolution":{"observed_at":"2026-08-14T12:56:02.733926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.01476","last_updated":"2018-07-04T09:53:46Z","snapshot_observed_at":"2026-08-14T20:49:30.127080Z","submitted_at":"2017-07-05T17:18:17Z","title":"Convolutional 2D Knowledge Graph Embeddings","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.01476","snapshot_observed_at":"2026-08-14T12:56:02.475518Z","title":"Convolutional 2d knowledge graph embeddings","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.475518Z"},"links":{"cited_paper":"/paper/1707.01476","citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:12ea057c0b6a504f06198b4b02a722fda9cedc0bf5236304ab470f4869dba13f","observation_id":"ea36215a-0661-4297-a3d6-865ea30478ad","resolution":{"observed_at":"2026-08-14T12:56:02.475518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.719360Z","title":"Distributional structure","venue":null,"work_id":"4a89cded-441b-453b-b5b0-3254f3b14a97","year":1954},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.479963Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:1f0ead6fff8cc9fe278d8adf1cc557a0c8b2af91372f11b4b7970017d93a9cbb","observation_id":"fec4d957-7bab-4148-83e5-fd650920df4e","resolution":{"observed_at":"2026-08-14T12:56:02.722718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T12:56:02.484129Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.484129Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:cb7e0a4b2896c4dd31d7fe205505ebe5184beda1b376222fe970ae9ab453cead","observation_id":"bf982b50-23e8-4384-b344-4c5b723139e6","resolution":{"observed_at":"2026-08-14T12:56:02.484129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.06816","last_updated":"2018-03-02T12:27:10Z","snapshot_observed_at":"2026-08-14T20:39:49.559848Z","submitted_at":"2017-08-22T20:53:29Z","title":"Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.06816","snapshot_observed_at":"2026-08-14T12:56:02.487983Z","title":"Analysis of the impact of negative sampling on link prediction in knowledge graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.487983Z"},"links":{"cited_paper":"/paper/1708.06816","citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:0fcafe011fda92a12b83e7a5c3d7ed09641d48100275423e77dacb5eef4db1e7","observation_id":"a2b0e66f-872d-401d-b504-ec09f01cac27","resolution":{"observed_at":"2026-08-14T12:56:02.487983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.00379","last_updated":"2015-08-15T09:28:49Z","snapshot_observed_at":"2026-08-14T22:46:20.462378Z","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.00379","snapshot_observed_at":"2026-08-14T12:56:02.492250Z","title":"Modeling relation paths for representation learning of knowledge bases","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.492250Z"},"links":{"cited_paper":"/paper/1506.00379","citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:a54ac9bde1d5080320c594c9c9d3b805b9283a23838b14d81f4b525b588a42bc","observation_id":"9fe971a7-2b44-4c89-8b91-e2e5adc14f65","resolution":{"observed_at":"2026-08-14T12:56:02.492250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.496079Z","title":"Wordnet: a lexical database for english","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.496079Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:66d0c53e2743ca741717ad8d6da436258c8489de9fa3fc0dc4ee82eedb11ffe5","observation_id":"fbc02e42-e4c7-4827-bd7d-043e58eb8bc6","resolution":{"observed_at":"2026-08-14T12:56:02.496079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.701791Z","title":"A three-way model for collective learning on multi-relational data","venue":null,"work_id":"2394b2fb-a7ad-4d0e-b5d3-9cdb3c997999","year":2011},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.499479Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:3152f662102d1e2988a99d32cc0608e50c7703d1738ab64c673d62d356986ab5","observation_id":"d6fac352-72d6-4006-8551-3b0dc1c78170","resolution":{"observed_at":"2026-08-14T12:56:02.705700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.690281Z","title":"A review of relational machine learning for knowledge graphs","venue":null,"work_id":"76e926b8-2b46-4178-83a8-4b9635a78a07","year":2016},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.502844Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:36b66c02a35e55b686143ec3eb461257247acc656eb8fe83fb4e46f0e0aead16","observation_id":"ebfc68fe-a63d-46f1-a848-07a0f0fe9930","resolution":{"observed_at":"2026-08-14T12:56:02.695015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.678664Z","title":"Holographic embeddings of knowledge graphs","venue":null,"work_id":"897fa762-a2a4-4d24-b408-0c0a3ef56130","year":1955},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.507307Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:9ef6b3ee5920a957649d3adb40ca64ea17a832f12e9de90c32809031a2750511","observation_id":"cfc4ebb1-e7d2-43e0-97df-04c59ca2b958","resolution":{"observed_at":"2026-08-14T12:56:02.682854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.667182Z","title":"Proje: Embedding projection for knowledge graph completion","venue":null,"work_id":"9eab56a7-81ba-45cb-b0ec-6737e6033894","year":2017},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.510395Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:e8511c8c65bc8601038643d64a7e2a73ac4dfca7b2b2ce628f200ec9f52f6327","observation_id":"97421247-afaa-44bf-b0ba-476b2b6c827a","resolution":{"observed_at":"2026-08-14T12:56:02.670794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.656032Z","title":"Reasoning with neural tensor networks for knowledge base completion","venue":null,"work_id":"42c6d476-c274-4c31-871f-2bc790e12cf0","year":2013},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.513928Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:f2079aeaf309927efa1ed4c30358ef8ccbc901b674595a637ff80557e1d0bd28","observation_id":"a8929856-4bb4-43de-80b0-862dcdb20e73","resolution":{"observed_at":"2026-08-14T12:56:02.659904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.644555Z","title":"Observed versus latent features for knowledge base and text inference","venue":null,"work_id":"92197341-dd31-439a-b7b6-1d31faaae7e9","year":2015},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.517337Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:34c57d8f3e39b1acbbf01008126f275a0be97dc8d7bf1d17031da31c7550d0e0","observation_id":"4753c600-7411-423d-9f4e-ba304332be72","resolution":{"observed_at":"2026-08-14T12:56:02.648844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.632066Z","title":"Complex embeddings for simple link prediction","venue":null,"work_id":"d310aa7d-0df0-47e9-a8e4-24b172ea10f3","year":2016},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.520725Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:e26a39af416088ee82d35d40124c24f9a7fafa650baa9d6a5274565d010cfcaa","observation_id":"679e9678-10fa-4677-a46c-5d8404923fe2","resolution":{"observed_at":"2026-08-14T12:56:02.636263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:56:02.618981Z","title":"Knowledge graph embedding by translating on hyperplanes","venue":null,"work_id":"7c81d7a1-5396-44ce-97ae-0c9b63d7afeb","year":2014},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.523939Z"},"links":{"citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:43d4af5aa38cc4a4456fb161f86f2c8adcebe5f48290c1f16e3bce1fddaa6eda","observation_id":"37558a63-dd9f-4bff-9d66-df3446b5199b","resolution":{"observed_at":"2026-08-14T12:56:02.623225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.05908","last_updated":"2017-05-03T05:20:09Z","snapshot_observed_at":"2026-08-14T21:05:58.141532Z","submitted_at":"2017-04-19T19:35:54Z","title":"An Interpretable Knowledge Transfer Model for Knowledge Base Completion","version":2},"cited_work":{"arxiv_id":"1704.05908","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.05908","snapshot_observed_at":"2026-08-14T12:56:02.558763Z","title":"An Interpretable Knowledge Transfer Model for Knowledge Base Completion","venue":"cs.CL","work_id":"77e5eabf-57de-40e6-a44d-336b317a2540","year":2017},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.527511Z"},"links":{"cited_paper":"/paper/1704.05908","citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:6430a8405995a09641f29d9e52222bd63778e044e25cd7166635c106f41203d5","observation_id":"75e58f9e-08fe-49ea-af60-7e316fbda730","resolution":{"observed_at":"2026-08-14T12:56:02.565106Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":12},"total_outbound_references":19},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 2 inbound Pith citation observations for arXiv:1908.06178."}