{"as_of":"2026-08-13T01:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4ffb7500987fbf8f118602bc9c1480eb73ae9add680b4a3633786172940fda3","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:07:57.832986Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.15694/citation-record","integrity":"/paper/2411.15694/integrity","json":"/paper/2411.15694/citation-record.json","paper":"/paper/2411.15694"},"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-12T14:07:59.325192Z","title":"Mixed membership stochastic blockmodels","venue":null,"work_id":"5f8aa30d-2691-4b09-a0c7-016be92592e4","year":2008},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.302932Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:6b8186af6143a1f41aa48be22593a4f4f19901a9c154c64e90ef887aec20f48c","observation_id":"c76a4f91-4281-4117-8061-b5d2d2638ec0","resolution":{"observed_at":"2026-08-12T14:07:59.333336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.296540Z","title":"Dbpedia: A nucleus for a web of open data","venue":null,"work_id":"41183b58-9192-4ba0-9af8-b3bea4233050","year":2007},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.312273Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:1464fcb3faba09415fe2949c7bf7a4688148181aab8548fad110f20f3c3c1078","observation_id":"6af2e037-4670-4e51-be44-532f8069cd77","resolution":{"observed_at":"2026-08-12T14:07:59.303630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09590","last_updated":"2019-08-24T15:36:04Z","snapshot_observed_at":"2026-07-06T07:29:22.932462Z","submitted_at":"2019-01-28T10:42:26Z","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09590","snapshot_observed_at":"2026-08-12T14:07:57.323010Z","title":"Tucker: Tensor factorization for knowledge graph completion","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.323010Z"},"links":{"cited_paper":"/paper/1901.09590","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:8c7be1f0af87d8e8c7e6ea12af733e5abd8c2c5f9d87030ea4bfded39cf65726","observation_id":"d044f9f7-377f-48b4-9166-be5b3bb1e99b","resolution":{"observed_at":"2026-08-12T14:07:57.323010Z","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-12T14:07:59.274564Z","title":"Reverse engineering self-supervised learning","venue":null,"work_id":"a00fc998-00da-43de-a170-9cae4520b745","year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.335071Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:1a7176d928a7dde1b8bd32e2c94f596ecf891c5d5411d04c08426f13a5d75bb8","observation_id":"98da3117-9164-4a0c-b4b6-971891056276","resolution":{"observed_at":"2026-08-12T14:07:59.280692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.341830Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.341830Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:bfd432fc87f425744f18b843ebdaaa06b74db16a2641de8ea281d8dc5ceee2a6","observation_id":"e2f1e313-d2bf-4ff3-a027-35a16c516657","resolution":{"observed_at":"2026-08-12T14:07:57.341830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06349","last_updated":"2016-05-12T20:51:23Z","snapshot_observed_at":"2026-08-05T16:42:28.278134Z","submitted_at":"2015-11-19T20:38:45Z","title":"Generating Sentences from a Continuous Space","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06349","snapshot_observed_at":"2026-08-12T14:07:57.349940Z","title":"Generating sentences from a continuous space","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.349940Z"},"links":{"cited_paper":"/paper/1511.06349","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:edda37939eca8a530024eaf4520c624b5af15c9a39fc2f015e7224db29346578","observation_id":"6e226234-58f4-498f-b4e6-bfb44ee71ea2","resolution":{"observed_at":"2026-08-12T14:07:57.349940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07299","last_updated":"2022-09-16T08:15:55Z","snapshot_observed_at":"2026-08-12T22:59:16.897495Z","submitted_at":"2022-09-15T13:49:40Z","title":"Knowledge Is Flat: A Seq2Seq Generative Framework for Various Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.07299","snapshot_observed_at":"2026-08-12T14:07:57.357965Z","title":"Knowledge is flat: A seq2seq generative framework for various knowledge graph completion","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.357965Z"},"links":{"cited_paper":"/paper/2209.07299","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:a1c6cc600608ec46f0c763037529785786bae362abaf152c4022b9919582bfd6","observation_id":"d8a36955-b135-448a-abaa-b336a84adfd0","resolution":{"observed_at":"2026-08-12T14:07:57.357965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01709","last_updated":"2023-07-04T13:24:04Z","snapshot_observed_at":"2026-08-13T00:30:46.203559Z","submitted_at":"2023-07-04T13:24:04Z","title":"Dipping PLMs Sauce: Bridging Structure and Text for Effective Knowledge Graph Completion via Conditional Soft Prompting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.01709","snapshot_observed_at":"2026-08-12T14:07:57.366324Z","title":"Dipping plms sauce: Bridging structure and text for effective knowledge graph completion via conditional soft prompting","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.366324Z"},"links":{"cited_paper":"/paper/2307.01709","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:153d473b1f122ae47d661b1a176bdd2c4c21e54df1302e72b1b0ea7ca9b44bbb","observation_id":"a8224b9f-ec21-470e-94d2-00fe4fd4c96a","resolution":{"observed_at":"2026-08-12T14:07:57.366324Z","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-12T14:07:59.242535Z","title":"HittER: Hierarchical transformers for knowledge graph embeddings","venue":null,"work_id":"59bd8f8a-c845-4b96-9143-25d3a7190968","year":2021},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.373419Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:647a8eca397dbdc149e05545ab6da2833344de254eedcc3afee70641d3f7f521","observation_id":"843a0525-b94c-447c-9f03-d1d492e8739d","resolution":{"observed_at":"2026-08-12T14:07:59.248767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.225155Z","title":"A simple frame- work for contrastive learning of visual representations","venue":null,"work_id":"4c477596-3859-4bfb-a6d0-806d2f8c4ece","year":2020},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.379728Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:be7d80b2e9a487edfebd1f59978994b07ecdcff48dba234d980c1722c3aa251f","observation_id":"8db26c54-ab6b-401a-93ea-dc29c7ba6050","resolution":{"observed_at":"2026-08-12T14:07:59.231361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.206936Z","title":"A direct formulation for sparse pca using semidefinite programming","venue":null,"work_id":"1316afd2-181d-4410-ab03-6035af232a23","year":2004},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.390841Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:e62642d4415e6cce1a9b2ddb71e2562fabdeed98529ec4e378d5a121220bf846","observation_id":"ed2ec9c4-81cb-4f9b-97f5-05a89da7dfc2","resolution":{"observed_at":"2026-08-12T14:07:59.213104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.186269Z","title":"Inductive entity representations from text via link prediction","venue":null,"work_id":"5287c877-42fc-4895-aab8-f387a2f3de18","year":2021},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.399683Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:71300b4fc200e686425e63eda3a3cf07f80836f50c0a2752f3211194893da4d4","observation_id":"ba360ca8-4358-4639-8db4-59911b521c8b","resolution":{"observed_at":"2026-08-12T14:07:59.191807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.408213Z","title":"Convolutional 2d knowledge graph embeddings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.408213Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:9faf36847ff0cd3c54a74fdb33c3f024c91c87c5b6b713c3838bd790d3d44770","observation_id":"0293d121-b2c1-4713-82cf-db6e4a3055e0","resolution":{"observed_at":"2026-08-12T14:07:57.408213Z","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-12T14:07:59.155442Z","title":"BERT: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":"1558a784-55d1-4ed3-a815-f4ae6a44d2b5","year":2019},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.414115Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:e8e3e4482980cfa0c0fa03da3d96d9ba830f66b1ad8929cc8ee777972a57286e","observation_id":"aaf061ed-7792-4f8f-b496-1cf595eb8193","resolution":{"observed_at":"2026-08-12T14:07:59.162163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.129810Z","title":"Knowledge vault: A web-scale approach to proba- bilistic knowledge fusion","venue":null,"work_id":"e36da646-352f-44ea-9318-bae7f31d9bbe","year":2014},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.420644Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:e64ab92b906d665305146824084d2121691bb319ce81050f7988e4bb15913a99","observation_id":"21aa8318-577d-4e21-a297-edcd8eb85f75","resolution":{"observed_at":"2026-08-12T14:07:59.138186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.431941Z","title":"Implicit reparameterization gradients","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.431941Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:f523697bdea3536d6c28b5370212223db6d61e39c67b6b33707927513cb98e6c","observation_id":"e2133dcb-ad03-4c36-90c7-706fbc5dbc33","resolution":{"observed_at":"2026-08-12T14:07:57.431941Z","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-12T14:07:59.088770Z","title":"Infinite latent feature models and the indian buffet process","venue":null,"work_id":"ed62913c-7c2b-4dca-aab3-6b1e4a1494d7","year":2005},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.438925Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:31ec215d41cc5a9953a28d1319f65fb9b7c8c4e4e55b87d37514b7cda2d4d5b1","observation_id":"e7f34773-6545-49b9-b47a-c58b6fdedf62","resolution":{"observed_at":"2026-08-12T14:07:59.096512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.068654Z","title":"The indian buffet process: An introduction and review","venue":null,"work_id":"6d7a1271-ddf7-4b13-9d2f-b7ef2bcb9366","year":2011},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.445866Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:2a322b5fcc8f97f108de8fa4215de3fb9bb01396542bd8e6c9fff4e5b7d2e4d6","observation_id":"0a2e783a-8385-489e-ad78-0b012bdcf650","resolution":{"observed_at":"2026-08-12T14:07:59.076185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:59.050445Z","title":"Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics","venue":null,"work_id":"010a259b-011a-4c2f-996b-7847e46e2c32","year":2012},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.452397Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:9d991e3d401003ba4aad787375fa3086c1f358dce004e9209d573481caa9265c","observation_id":"cd5187a1-3447-49d2-b202-780ef22ac3bf","resolution":{"observed_at":"2026-08-12T14:07:59.055486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.457988Z","title":"beta-vae: Learning basic visual concepts with a constrained variational framework","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.457988Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:91bef69ac3ec5276f8e0dc831d77b34c6f08bbc119e581ef179212c5bd87f000","observation_id":"22d585ae-7292-441a-9f1f-fb11a7368b16","resolution":{"observed_at":"2026-08-12T14:07:57.457988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06670","last_updated":"2019-02-22T18:38:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-08-20T19:52:51Z","title":"Learning deep representations by mutual information estimation and maximization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06670","snapshot_observed_at":"2026-08-12T14:07:57.468843Z","title":"Learning deep representations by mutual information estimation and maximization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.468843Z"},"links":{"cited_paper":"/paper/1808.06670","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:d1c0f887d4bfaec9de26432eedd49266706257a4c0270b93377612050595fcd1","observation_id":"3ba42529-b899-4ca0-bf8e-2348ebba0b6a","resolution":{"observed_at":"2026-08-12T14:07:57.468843Z","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-12T14:07:57.485109Z","title":"Stochastic blockmodels: First steps","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.485109Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:28c13fe245c4bf735e127f72dc8fb1f33ff7a045faa5bf151ac25f96e8bc3bcc","observation_id":"e5d8ac82-561d-49c3-b874-e6b9abb138c7","resolution":{"observed_at":"2026-08-12T14:07:57.485109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-01T18:34:23.156273Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-12T14:07:57.493179Z","title":"Categorical reparameterization with gumbel-softmax","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.493179Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:8c3fc0e41567e9296ffe2de8a3e637b10eae38fb5fe8020c54f8245f3845a3ba","observation_id":"6b9e383a-bc13-4d97-90bc-a8006f4f8846","resolution":{"observed_at":"2026-08-12T14:07:57.493179Z","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-12T14:07:59.001144Z","title":"A modified principal component technique based on the lasso","venue":null,"work_id":"4887b7ca-0ea6-41d5-a288-44242938ae39","year":2003},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.499975Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:7fbeca7e68bc1784abcb4ababe15ee04deb3d1b7253b775c10f633da690848ae","observation_id":"6a7cabb4-eb53-4b13-abe7-462766a46448","resolution":{"observed_at":"2026-08-12T14:07:59.007628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.506372Z","title":"Supervised contrastive learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.506372Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:4649db32d783cd49471aa4b3989e74b7bc9393c00d063aa99f637e087b02b669","observation_id":"8f5dfb43-f7c8-4096-89d5-9d6114d0d59d","resolution":{"observed_at":"2026-08-12T14:07:57.506372Z","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-12T14:07:58.967123Z","title":"Multi-task learning for knowl- edge graph completion with pre-trained language models","venue":null,"work_id":"4f72fa16-e7ec-48ec-b00e-ae814c865db3","year":2020},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.514143Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:cbae0ba4b7ffdb13bce04f78f161e2d6320847e6455636104baf108f58d08b72","observation_id":"6d65232b-69dc-4b4c-ae1a-cc0d81b9a17e","resolution":{"observed_at":"2026-08-12T14:07:58.973114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-12T14:07:57.519671Z","title":"Auto-encoding variational bayes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.519671Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:ac3c972404bfa52e2aa11a8578a1fe1e5d7886d7189a93831f6085f7c14e2959","observation_id":"d37aaec4-32a5-4464-8f4b-8b5a5893dc4f","resolution":{"observed_at":"2026-08-12T14:07:57.519671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-12T14:07:57.525499Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.525499Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:45204f5489fa8e9511e27c7b435e880c8e8e96a31427630d52c889af1a0fe916","observation_id":"f424b7ff-67c9-4cb5-b63f-8108ad25e413","resolution":{"observed_at":"2026-08-12T14:07:57.525499Z","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-12T14:07:58.950044Z","title":"Statistical predicate invention","venue":null,"work_id":"13e3a9f7-675d-4022-bdb2-d03996783cf7","year":2007},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.531930Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:9e881ae40de4955955c03e8bcc7e3348feaeaa1a959f3d08428b5f49622817a0","observation_id":"9104574d-919e-4f69-88f9-ec0b10c98e1c","resolution":{"observed_at":"2026-08-12T14:07:58.955638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.04616","last_updated":"2019-03-22T03:08:01Z","snapshot_observed_at":"2026-08-09T01:11:50.005164Z","submitted_at":"2018-12-10T20:00:36Z","title":"Von Mises-Fisher Loss for Training Sequence to Sequence Models with Continuous Outputs","version":3},"cited_work":{"arxiv_id":"1812.04616","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.04616","snapshot_observed_at":"2026-08-12T14:07:58.157186Z","title":"Von Mises-Fisher Loss for Training Sequence to Sequence Models with Continuous Outputs","venue":"cs.CL","work_id":"86bd52c6-3b39-4013-8490-bff91c9b1575","year":2018},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.538125Z"},"links":{"cited_paper":"/paper/1812.04616","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:14b22ed8a8b79ed3ee0360df45995063fac4df27410997a86cfcd3fb32be83c3","observation_id":"696c9292-a718-4b78-8ea1-f082e79c557a","resolution":{"observed_at":"2026-08-12T14:07:58.163390Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.927539Z","title":"Bayesian methods for graph clustering","venue":null,"work_id":"d2975b4e-85a4-4beb-a68e-63d5b8df3957","year":2008},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.544892Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:ac787a878ebb8d65ec3d58580b51fa4e49d0a3055f00439cd81508b66d88d6ab","observation_id":"31c22cb7-37f0-4e8e-af40-488c4d1f66f8","resolution":{"observed_at":"2026-08-12T14:07:58.934273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.906403Z","title":"Overlapping stochastic block models with application to the french political blogosphere","venue":null,"work_id":"384022a5-0ae7-4c08-ae44-6058a8e62d12","year":2011},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.552931Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:0c427256bf68f76bb60bc89822b179652451e020d4a102251e0927d05ce866bc","observation_id":"0db8b9db-69dc-49cf-9c86-c756b25781f1","resolution":{"observed_at":"2026-08-12T14:07:58.913668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14770","last_updated":"2025-04-07T03:07:25Z","snapshot_observed_at":"2026-08-12T12:00:46.546911Z","submitted_at":"2023-09-26T09:03:25Z","title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14770","snapshot_observed_at":"2026-08-12T14:07:57.563334Z","title":"Kermit: Knowledge graph completion of enhanced relation modeling with inverse transformation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.563334Z"},"links":{"cited_paper":"/paper/2309.14770","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:de1e5747ea3baac75ca3d2182bc6b042546e5d1c4316549be87a28f3b9a135c8","observation_id":"cf2d9ce7-6614-438c-bfdb-d7c9725628be","resolution":{"observed_at":"2026-08-12T14:07:57.563334Z","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-12T14:07:58.875589Z","title":null,"venue":null,"work_id":"fd7e09f0-c49b-4013-9215-fac9506f1e55","year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.570395Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:cb5fad8344b5a18a2cdb12ddeb2da82829fdd8d4152f0cb8711d4db9833eec47","observation_id":"3f9c986f-603e-419e-8255-72765903b4ee","resolution":{"observed_at":"2026-08-12T14:07:58.882170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.576572Z","title":"Learning entity and relation embeddings for knowledge graph completion","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.576572Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:d19b2abd5f634359bb38cd81cf87d80fa7ebdd1e15c5af46b655169738afd555","observation_id":"405e01db-fdc2-4574-8eb2-8f3d86a303e5","resolution":{"observed_at":"2026-08-12T14:07:57.576572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.00712","last_updated":"2017-03-05T16:59:44Z","snapshot_observed_at":"2026-08-10T10:56:51.922083Z","submitted_at":"2016-11-02T18:25:40Z","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.00712","snapshot_observed_at":"2026-08-12T14:07:57.586699Z","title":"The concrete distribution: A continuous relaxation of discrete random variables","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.586699Z"},"links":{"cited_paper":"/paper/1611.00712","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:7981994e12180d82b735fc985dbd535404d008862fb3e63a271a08ad6d471875","observation_id":"da6c46a3-9103-4d3d-ae06-f483eb7c728b","resolution":{"observed_at":"2026-08-12T14:07:57.586699Z","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-12T14:07:57.591833Z","title":"A* sampling.Advances in neural information processing systems, 27, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.591833Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:f1a3bbe133dcc71f5cf79b48bf02abfba5271329ebf994463e6912373c22887a","observation_id":"14aeb47f-8c72-4128-9bd0-37c2a5220e22","resolution":{"observed_at":"2026-08-12T14:07:57.591833Z","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-12T14:07:58.813251Z","title":"Stochastic blockmodels meet graph neural networks","venue":null,"work_id":"c39cd70b-b207-496d-943d-be322141f849","year":2019},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.599710Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:3a08a901fdf66915335a0f8ca04875451851c76e5ee33c7d9defea4e6d174429","observation_id":"d8dbed17-f0f0-4125-9c67-ebaf34ab58e5","resolution":{"observed_at":"2026-08-12T14:07:58.820293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.789984Z","title":"Nonparametric latent feature models for link prediction","venue":null,"work_id":"f41c6249-2a28-4ec3-b527-a433420d88db","year":2009},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.605830Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:132ece6abd5ed13a7fa71b0d66169bf7db70ddded65fe13aeccdd2a973087919","observation_id":"efaaa29c-390a-49c9-b16c-f2ef6739b4ec","resolution":{"observed_at":"2026-08-12T14:07:58.796396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.06197","last_updated":"2017-04-03T22:36:33Z","snapshot_observed_at":"2026-08-03T11:53:30.208076Z","submitted_at":"2016-05-20T02:20:13Z","title":"Stick-Breaking Variational Autoencoders","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.06197","snapshot_observed_at":"2026-08-12T14:07:57.614542Z","title":"Stick-breaking variational autoencoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.614542Z"},"links":{"cited_paper":"/paper/1605.06197","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:50a1498b3cd75eebb827586fe021dd8570ce35c598d8cd9a29bb7dc11ff4493a","observation_id":"9ff25a3a-d98e-4262-b42c-2cef8cd05743","resolution":{"observed_at":"2026-08-12T14:07:57.614542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01195","last_updated":"2019-06-04T04:59:08Z","snapshot_observed_at":"2026-08-09T06:14:01.235519Z","submitted_at":"2019-06-04T04:59:08Z","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01195","snapshot_observed_at":"2026-08-12T14:07:57.620230Z","title":"Learning attention-based embeddings for relation prediction in knowledge graphs","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.620230Z"},"links":{"cited_paper":"/paper/1906.01195","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:ca5c8a665025893ee8ce28a5d2b47e8d6d54fd22d7e3485afe942352cb1d8ef8","observation_id":"e3b4ce15-6271-4acb-89be-3f9a257b2780","resolution":{"observed_at":"2026-08-12T14:07:57.620230Z","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-12T14:07:58.766278Z","title":"Communities in networks","venue":null,"work_id":"37862819-c56d-49f5-aa36-6e2d878937a0","year":2009},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.625341Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:15966e99c20ba2d6e8610ca2992e977ef713cc8a1176ede4178ae1ca7bb30fd6","observation_id":"0ef94036-76b4-43a2-9121-b7356111fbcb","resolution":{"observed_at":"2026-08-12T14:07:58.772820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.743031Z","title":"Improving knowledge graph completion with generative hard negative mining","venue":null,"work_id":"f4760346-d773-4906-831b-f5abf94efbd1","year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.631642Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:55145719ebe777e20b50e1c709cbb9cd034b34bb502039233fb0d7da4cd6cd1e","observation_id":"d6f90500-0a7c-48ec-a3e9-1b083cc2f15a","resolution":{"observed_at":"2026-08-12T14:07:58.751965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.638610Z","title":"Variational inference with normalizing flows","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.638610Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:6f2aaba1defda8860d5c40c0ee65b9dbcdb7fba60b53b435903ec4aee2252ce0","observation_id":"0bef2dcd-69c4-456e-b3a3-5e306b0511b8","resolution":{"observed_at":"2026-08-12T14:07:57.638610Z","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-12T14:07:57.644261Z","title":"Modeling relational data with graph convolutional networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.644261Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:b54bb27e723f50d482efede6df578cc9a0b75b3c1c5315d94bd9934c66ef7463","observation_id":"88f67b23-e747-46a9-93b6-c40c5b012205","resolution":{"observed_at":"2026-08-12T14:07:57.644261Z","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-12T14:07:57.654029Z","title":"Reasoning with neural tensor networks for knowledge base completion","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.654029Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:8e2c920581bc42829b854781515491c0df0c7a1f3f11459f905951e4a381f202","observation_id":"228acbf0-57ca-459a-bde4-9ccec61e04b3","resolution":{"observed_at":"2026-08-12T14:07:57.654029Z","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-12T14:07:58.686585Z","title":"Stochas- tic block models with multiple continuous attributes","venue":null,"work_id":"0168cd5a-8d0c-4758-96a2-a315510757a5","year":2019},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.662385Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:c548b969687a68ccdd2a0ed28d1e29ac1297801c51cd1aa6f984d79046c01c34","observation_id":"f3a85480-c285-4291-b005-8c05d7557e7f","resolution":{"observed_at":"2026-08-12T14:07:58.692617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.669623Z","title":"Rotate: Knowledge graph em- bedding by relational rotation in complex space","venue":null,"work_id":"cfd6105c-7a13-4e83-b5ac-fbc39fea560b","year":2019},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.668311Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:58e5ec4d43b39f75627b1f639021b72d8ff5b28721817337190aba0a5a05b81f","observation_id":"5dc71901-7c3a-4b44-a2ee-1b53e6ba548d","resolution":{"observed_at":"2026-08-12T14:07:58.675081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.649934Z","title":"Kracl: Contrastive learning with graph context modeling for sparse knowledge graph completion","venue":null,"work_id":"7eb94d59-b3b7-4b0a-86ff-a12c8367b83d","year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.677272Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:259d5e514c06fcbc06fe87c03283242e90a9d48f948ce9f557932cf44f4ed8c5","observation_id":"15992681-6ce7-4682-a2d5-2f37ca7dd063","resolution":{"observed_at":"2026-08-12T14:07:58.656262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.629749Z","title":"Stick-breaking construction for the indian buffet process","venue":null,"work_id":"13f70606-d2ca-4360-914b-11f509e176d3","year":2007},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.684224Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:01517b370bca35ec2710f6e07acb1e4462bf0832440f6818316bc8fa8f6a5e35","observation_id":"ad80576f-36a7-4280-83fd-b184886bef61","resolution":{"observed_at":"2026-08-12T14:07:58.636081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.604585Z","title":"Representing text for joint embedding of text and knowledge bases","venue":null,"work_id":"249e4ce6-1727-4e88-8ece-e592cca830c7","year":2015},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.690797Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:8555a16e17843943c783d2cd6182877262f637d575638288f6aea022e96b6cc9","observation_id":"23ddcdde-fb2c-4ec5-82b2-251929acb04e","resolution":{"observed_at":"2026-08-12T14:07:58.612387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-08-10T08:41:51.933345Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-12T14:07:57.697201Z","title":"Composition-based multi-relational graph convolutional networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.697201Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:57a09bf9cf281cdf8d4d2c11b844ced94d1f111db8aec3c240f17f39b1f72b6d","observation_id":"5046717f-bfb7-47cc-9757-783f00d1394e","resolution":{"observed_at":"2026-08-12T14:07:57.697201Z","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-12T14:07:57.703340Z","title":"Wikidata: a free collaborative knowledgebase","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.703340Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:7afa9e12ce8f4486ef890b9b11c61b9451f78affdf41a528cf58d5db9fabdf1f","observation_id":"b3b6b53f-c3c0-4118-b4cc-63d4fc4a472d","resolution":{"observed_at":"2026-08-12T14:07:57.703340Z","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-12T14:07:58.573755Z","title":"Structure- augmented text representation learning for efficient knowledge graph completion","venue":null,"work_id":"32befeca-aa1e-4486-994d-90d1f85ee278","year":2021},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.712980Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:af549249fb9513e1ee5a152b4783d9d65a4f72b2f719948687749501ad87eb3c","observation_id":"1a347473-492b-4464-94cb-2706edc8ed65","resolution":{"observed_at":"2026-08-12T14:07:58.580599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.549210Z","title":"Simkgc: Simple contrastive knowledge graph completion with pre-trained language models","venue":null,"work_id":"e124a799-c268-4353-a7b1-7cf4f2bdfe73","year":2022},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.720393Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:621b0440cb220aae23e0a64fce09fd7f8ae4c85b830b41b1e78bb6ea690b5757","observation_id":"01a4448f-edd6-46d0-b265-e7cee5ebb02c","resolution":{"observed_at":"2026-08-12T14:07:58.556490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.528133Z","title":"Kepler: A unified model for knowledge embedding and pre-trained language representation","venue":null,"work_id":"974ac944-473d-4d16-94ec-58f9d7de4725","year":2021},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.730151Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:eada8186f60a21b157ca755e8a2fa6a141e09dc8ba6c85804fb5094173e78da4","observation_id":"0bb263bc-04f4-4e83-b6c2-4a058b0e31fb","resolution":{"observed_at":"2026-08-12T14:07:58.535009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02389","last_updated":"2024-02-23T09:01:44Z","snapshot_observed_at":"2026-07-06T17:25:01.583656Z","submitted_at":"2024-02-04T08:01:07Z","title":"KICGPT: Large Language Model with Knowledge in Context for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02389","snapshot_observed_at":"2026-08-12T14:07:57.742280Z","title":"Kicgpt: Large language model with knowledge in context for knowledge graph completion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.742280Z"},"links":{"cited_paper":"/paper/2402.02389","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:a583eabec553c5095e24e4ec84cdc16a3b4c47ba3b1d63d20d1de3979c752d25","observation_id":"ebb73c37-1618-4f8d-8095-52aab0fccff2","resolution":{"observed_at":"2026-08-12T14:07:57.742280Z","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-12T14:07:57.752663Z","title":"Representation learning of knowledge graphs with entity descriptions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.752663Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:414871abfc4f64b3fe8155670bf2861f62c6a8ce3bd5b689b780f89886dfbf7a","observation_id":"08fd125f-71a8-4074-8fe4-9c4d49ab2dc1","resolution":{"observed_at":"2026-08-12T14:07:57.752663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6575","last_updated":"2015-08-29T15:08:45Z","snapshot_observed_at":"2026-08-10T09:43:27.820941Z","submitted_at":"2014-12-20T01:37:16Z","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6575","snapshot_observed_at":"2026-08-12T14:07:57.760048Z","title":"Embedding entities and relations for learning and inference in knowledge bases","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.760048Z"},"links":{"cited_paper":"/paper/1412.6575","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:d15a5c790956bc0088a379ee3660ace79a4cfbecb5585f923c4490421c6239c4","observation_id":"847bed4a-00d1-445f-a7d4-a9a2a5bee464","resolution":{"observed_at":"2026-08-12T14:07:57.760048Z","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-12T14:07:58.479844Z","title":"Enhancing text-based knowledge graph completion with zero-shot large language models: A focus on semantic enhancement","venue":null,"work_id":"c17506a1-6d56-491b-a640-f94e8bd04251","year":2024},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.768481Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:0028f4eee999d25d1ab9054344cd3a3a0fcfa2c0e7ba2f153e5c57e6eeaaa5c2","observation_id":"dfe171ef-1168-4684-8027-73d0f918db45","resolution":{"observed_at":"2026-08-12T14:07:58.486764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.452598Z","title":"Knowledge graph embedding and completion based on entity community and local importance","venue":null,"work_id":"ce01aad6-d23f-4589-a9b4-f1c15721e9c0","year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.778035Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:25856fca1498fe8162b8b8e01972e8407e0d1b4e891b2875cc77f9a80ed5335d","observation_id":"c42a8f95-8f15-485f-933c-95f55de2b365","resolution":{"observed_at":"2026-08-12T14:07:58.461407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T11:50:45.540872Z","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-12T22:59:02.314750Z","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:2db930c21e52aed8626053f4626ce5ef2872524b5557c489fff467723d292f1b","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":"2308.13916","last_updated":"2025-02-13T10:45:15Z","snapshot_observed_at":"2026-08-12T22:58:37.858768Z","submitted_at":"2023-08-26T16:51:17Z","title":"Exploring Large Language Models for Knowledge Graph Completion","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.13916","snapshot_observed_at":"2026-08-12T14:07:57.794183Z","title":"Exploring large language models for knowledge graph completion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.794183Z"},"links":{"cited_paper":"/paper/2308.13916","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:2e91dffcc517383a4d643727ebf24ef8030035320439437c9dbef824c3797bba","observation_id":"6c1e8f19-2f59-47dd-a3e1-04d298a05388","resolution":{"observed_at":"2026-08-12T14:07:57.794183Z","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-12T14:07:58.427702Z","title":"Native: Multi-modal knowledge graph completion in the wild","venue":null,"work_id":"0740bcb9-12a5-4079-99f0-43032db4b12a","year":2024},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.803296Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:655f7978db8284ba330841a590568fb8f31652a2503be1a8d17bf929b41fc0a9","observation_id":"c757c233-4aca-4a7f-97c9-445fabd6778c","resolution":{"observed_at":"2026-08-12T14:07:58.437707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:57.809572Z","title":"Making large language models perform better in knowledge graph completion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.809572Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:549959b7dc1a457ecfb4864aca998e5f6e2ae853dc45e4868f046e8d248714ef","observation_id":"b01d99e4-de0f-4b5d-88c3-4ff75d9b757b","resolution":{"observed_at":"2026-08-12T14:07:57.809572Z","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-12T14:07:58.386985Z","title":"Rethinking graph convolutional networks in knowledge graph completion","venue":null,"work_id":"bbdfc032-3161-4b15-b464-a3ac2d520df0","year":2022},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.815844Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:4c3e87f5203ae99787f1c9aaf3423326159f1e0631806d08896ebefa5f2ccf76","observation_id":"57359eba-ecfb-44e3-86c3-3b781767fbef","resolution":{"observed_at":"2026-08-12T14:07:58.393797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07428","last_updated":"2016-02-24T08:08:05Z","snapshot_observed_at":"2026-07-06T04:47:10.710916Z","submitted_at":"2016-02-24T08:08:05Z","title":"Max-Margin Nonparametric Latent Feature Models for Link Prediction","version":1},"cited_work":{"arxiv_id":"1602.07428","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.07428","snapshot_observed_at":"2026-08-12T14:07:57.902376Z","title":"Max-Margin Nonparametric Latent Feature Models for Link Prediction","venue":"cs.LG","work_id":"36c5e954-df9c-4dff-94f9-945e7e1a931b","year":2016},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.823668Z"},"links":{"cited_paper":"/paper/1602.07428","citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:b04ba6374055c344bdf53cd992bc222f07da0aa561f841172a5528a894d2534d","observation_id":"967c627b-e970-4219-bb05-bb967fa9f354","resolution":{"observed_at":"2026-08-12T14:07:57.912390Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T14:07:58.361860Z","title":"location-scale","venue":null,"work_id":"62b2a344-0189-4661-9a23-c7a769abc254","year":2000},"citing_paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T14:07:57.832986Z"},"links":{"citing_paper":"/paper/2411.15694"},"observation_digest":"sha256:be31cd20be55d2d21bdaba937d25f78faf8902c5559f2f9a1ddf0f6f831d47e0","observation_id":"e3b10521-3c75-4bf3-825c-66b7eec15f2d","resolution":{"observed_at":"2026-08-12T14:07:58.370935Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.15694","last_updated":"2025-06-13T03:01:26Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T22:59:02.314750Z","submitted_at":"2024-11-24T03:17:37Z","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":2,"verified_fuzzy":33},"total_outbound_references":68},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 0 inbound Pith citation observations for arXiv:2411.15694."}