{"as_of":"2026-08-13T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6af2f9bbf5bf7a406393871ac17b2edc9b7705def6cc59ac32c0bb1ce52e9c86","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:52:40.078129Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"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.14858/citation-record","integrity":"/paper/2411.14858/integrity","json":"/paper/2411.14858/citation-record.json","paper":"/paper/2411.14858"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:39.965350Z","title":"Rashid, Anisa Rula, Lukas Schmelzeisen, Juan Sequeda, Steffen Staab, and Antoine Zimmermann","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.965350Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:998b861d202df0083336b6d8d7821ca6a95a463aa8f29a201c2f83dde61f2684","observation_id":"5cb633e4-becd-44f6-88e6-4346c6d2ac8a","resolution":{"observed_at":"2026-08-12T14:52:39.965350Z","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:52:39.969014Z","title":"Knowledge vault: a web-scale approach to probabilis- tic knowledge fusion","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.969014Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:ba4da798db58427d06800c5314ef42441797e95f2e3b90ce4b8afb945af7b1aa","observation_id":"c5d76941-20e2-4d0c-b1c7-187f5d5b4546","resolution":{"observed_at":"2026-08-12T14:52:39.969014Z","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:52:40.800981Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":"2a40b0c0-f34f-4cce-9257-ecc3741dba2a","year":null},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.971955Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:f312fc810a0edef0dc24b8547d9c15fc9fc6649f2253339356f6b96441d201cb","observation_id":"3e84b6f3-e19d-4393-b724-3d2a680b97fe","resolution":{"observed_at":"2026-08-12T14:52:40.804064Z","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:52:39.978159Z","title":"Factorizing Y AGO: scalable machine learning for linked data","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.978159Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:37f30380d88561685b35a3eced1a0441f1cbd949a9825250780537c1149a8cbb","observation_id":"b914d3b8-0f49-46dd-80b8-9ccbaa310564","resolution":{"observed_at":"2026-08-12T14:52:39.978159Z","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:52:40.781130Z","title":"Comprehensive analysis of negative sampling in knowledge graph representation learning","venue":null,"work_id":"7944e864-0231-4b95-9298-2b5c66e172d7","year":2022},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.981370Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:e8d8743ca8a5de85d49681c6ac6de960cc4056acfac4320c140b820eb06e1e7e","observation_id":"5ceb0ea3-0e53-4d41-9110-daa8db889856","resolution":{"observed_at":"2026-08-12T14:52:40.784347Z","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.19195","last_updated":"2024-10-21T02:30:50Z","snapshot_observed_at":"2026-08-06T00:28:55.780894Z","submitted_at":"2024-02-29T14:26:20Z","title":"Negative Sampling in Knowledge Graph Representation Learning: A Review","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19195","snapshot_observed_at":"2026-08-12T14:52:39.984338Z","title":"Negative sampling in knowledge graph representation learning: A review","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.984338Z"},"links":{"cited_paper":"/paper/2402.19195","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:0a6df642b120944ebee0d8d52f6965a2526a073e83ea9900734acce7de3e839d","observation_id":"ce882abc-d145-4670-a007-f6bbd617147d","resolution":{"observed_at":"2026-08-12T14:52:39.984338Z","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":"10.1007/978-3-319-25007-6_","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:40.771553Z","title":"Type-constrained representation learning in knowledge graphs","venue":null,"work_id":"a71b0d99-9401-4363-ac4a-f2e3c62c346a","year":2015},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.987910Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:898ae1af63eb545abbd73040d34b0c49846a75b0aea20dbfe9b14032be7dc869","observation_id":"b1cc0783-7dcd-4dc8-ab43-a22ef123bd9f","resolution":{"observed_at":"2026-08-12T14:52:40.775579Z","resolver_source":"doi","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:52:40.761985Z","title":"You CAN teach an old dog new tricks! on training knowledge graph embeddings","venue":null,"work_id":"896cc959-a496-4e31-a734-c92ce1c92987","year":2020},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.990576Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:fb74d63e1b6f2864e6bdeda886cb01203d9f6fcf71f857566d5003143a71dfd1","observation_id":"27f8f36b-7edd-42d3-b13c-0b1cc8a2edf5","resolution":{"observed_at":"2026-08-12T14:52:40.765939Z","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:52:39.993287Z","title":"Convolutional 2d knowledge graph embeddings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.993287Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:c4adb3c2045d81a536cf1039fdd1e2c77fa5e02097fc65902ce585de1216fdca","observation_id":"631836d4-d14a-4feb-8f58-6599b5091260","resolution":{"observed_at":"2026-08-12T14:52:39.993287Z","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:52:39.995917Z","title":"Knowledge graph embedding: A survey from the perspective of representation spaces","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.995917Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:832519baa23a5316b8e683804e16032306e456de80af1285889d0c177e484040","observation_id":"94e2e4cd-dc13-4625-ae7e-ec50b4b8369b","resolution":{"observed_at":"2026-08-12T14:52:39.995917Z","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:52:40.748212Z","title":"Investigations on knowledge base embedding for relation prediction and extraction, 2018","venue":null,"work_id":"cb401025-9d18-4746-83ed-f520daef7f9b","year":2018},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.998567Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:2b62ec14ecf409924600a71c7548f866ccb4dcbe72a38c598fb6d4fd85e83850","observation_id":"9344acb1-27ed-4e45-8322-820e358a0eca","resolution":{"observed_at":"2026-08-12T14:52:40.751220Z","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:52:40.739725Z","title":"Pytorch-biggraph: A large scale graph embedding system","venue":null,"work_id":"10240619-fe5c-4bc0-a7de-a2fea9517b07","year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.001302Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:963374839648849a5f9cd80fc701d5ad81c42f06037d658f8f4be91deb85f234","observation_id":"dbdc6802-e367-408d-a142-78750b86e1a0","resolution":{"observed_at":"2026-08-12T14:52:40.742724Z","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:52:40.004163Z","title":"Knowledge graph embedding by translating on hyperplanes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.004163Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:7bb0dff820036052c6dab9001cc7cc78d7ff1eb70f49b09fbd72f67e903722d2","observation_id":"adb901ae-9f8d-40b4-bc2e-81ffbc32e9ff","resolution":{"observed_at":"2026-08-12T14:52:40.004163Z","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:52:40.730840Z","title":null,"venue":null,"work_id":"783f0ac5-0fd1-4c6f-bd98-b9e44bcef84a","year":2017},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.006866Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:dac60579626d75b8872f6e1dcb7c661e2152c098a463c0159c7572265b08625f","observation_id":"ecae6a88-5c54-4e0a-ae72-127c3306cbc6","resolution":{"observed_at":"2026-08-12T14:52:40.733817Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:40.722271Z","title":"A novel negative sample generating method for knowledge graph embedding","venue":null,"work_id":"6c3b50d8-e8cd-455d-a4bf-2ed1d8ea57ad","year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.012382Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:49ca27949e802da2982ad7345debca38f9f6a8cc422fd89529f0502c7d4ebbd4","observation_id":"eab78df0-30db-4d41-9ee2-7e4b0c6c8122","resolution":{"observed_at":"2026-08-12T14:52:40.725389Z","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":"9589.2068","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:40.538693Z","title":"A novel negative sampling based on frequency of relational association entities for knowledge graph embedding","venue":null,"work_id":"b1f9e05f-082b-4a39-93ed-c5ce108ea150","year":2021},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.015018Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:ceba82a59cbef4c8b7de30ae2d9e49a44eeb8c0bf899b40786b1b7a0ceb750dc","observation_id":"6baef5ea-3001-48f8-ad14-8dcc81c13659","resolution":{"observed_at":"2026-08-12T14:52:40.543455Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:40.017836Z","title":"Enhancing knowledge graph embedding with probabilistic negative sampling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.017836Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:6a1c5e6b19ced6a1423c9e5721fea25185b30362178349313e2c27d3c6dc8007","observation_id":"813ae72f-5ed7-41d5-bd31-ad0391b1d0e5","resolution":{"observed_at":"2026-08-12T14:52:40.017836Z","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-05T01:37:10.468134Z","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-12T14:52:40.020628Z","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":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.020628Z"},"links":{"cited_paper":"/paper/1708.06816","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:5207076a2e39c74b1b3bcf38ae678d9b2aabf08d90217a896c092d2f021b2bdd","observation_id":"3aec8c6e-e3f4-4fe8-9ae5-19078878b00e","resolution":{"observed_at":"2026-08-12T14:52:40.020628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.04703","last_updated":"2022-10-15T08:32:59Z","snapshot_observed_at":"2026-07-06T12:45:58.100504Z","submitted_at":"2022-03-09T13:27:47Z","title":"LEMON: LanguagE ModeL for Negative Sampling of Knowledge Graph Embeddings","version":3},"cited_work":{"arxiv_id":"2203.04703","doi":"10.48550/arxiv.2203.04703","metadata_source":"pith","pith_arxiv_id":"2203.04703","snapshot_observed_at":"2026-08-12T18:16:22.223912Z","title":"LEMON: LanguagE ModeL for Negative Sampling of Knowledge Graph Embeddings","venue":"cs.AI","work_id":"ba8f7d1c-4032-4b7b-ab12-ba1ff035733e","year":2022},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.023830Z"},"links":{"cited_paper":"/paper/2203.04703","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:d61a79c3f205ef106a8b834c5c6bc3cdf501491992eb982267b2b42ff4c31060","observation_id":"41c184fa-0a0c-4739-af6d-03f171296150","resolution":{"observed_at":"2026-08-12T14:52:40.139943Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"10.1016/j.patrec.2022.04.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:40.124258Z","title":null,"venue":null,"work_id":"ebc925c2-5448-48d2-886e-82c93d940e56","year":2022},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.026719Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:ad0436021da0114ed0f58bab4e6cd55e7f0fa38c4f5f2b1a9edb06eaeadb1182","observation_id":"330cecef-22ef-4853-b687-4a6518794717","resolution":{"observed_at":"2026-08-12T14:52:40.127350Z","resolver_source":"doi","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":"10.1007/978-981-15-1956-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:52:40.113721Z","title":"Incorporating domain and range of relations for knowledge graph completion","venue":null,"work_id":"07de84be-f416-48fc-bcc1-652cc049afb9","year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.029685Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:03e1f9e0af8b9203676c98c3381f8bc129e17b56ca6ce554c2ebc2cb50bd7625","observation_id":"28130e6e-8a38-49b5-9946-71b9172023ec","resolution":{"observed_at":"2026-08-12T14:52:40.118405Z","resolver_source":"doi","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:52:40.713226Z","title":"Conditional constraints for knowledge graph embeddings","venue":null,"work_id":"717bde16-fc0d-4917-bfa3-9973b60f97af","year":2020},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.032692Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:7825e929cad13dd8968e76d160ea4a10f7d8a94a53303b419b76f7f3c2b90416","observation_id":"75f118e9-1fb5-46e8-8535-6440e13a9b97","resolution":{"observed_at":"2026-08-12T14:52:40.716566Z","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:52:40.704192Z","title":"Rotate: Knowledge graph em- bedding by relational rotation in complex space","venue":null,"work_id":"46f22df6-9ebb-4822-9482-e1d2f75a492b","year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.035358Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:26ce6600f638d9a6e5a1e2130735ba97ffe980786bfdddb5732e61d087196bab","observation_id":"059177b4-1ccb-43d0-9bc5-f512160dae2b","resolution":{"observed_at":"2026-08-12T14:52:40.707529Z","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:52:40.038090Z","title":"Confidence-aware negative sampling method for noisy knowledge graph embedding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.038090Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:b8fe31dbf81272e5803af178519ebf9f9d8c600048647d157fb7b465623bacf6","observation_id":"34aa2bb3-d2fc-4a01-83d2-809b4b928d3c","resolution":{"observed_at":"2026-08-12T14:52:40.038090Z","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:52:40.040732Z","title":"Nscaching: Simple and efficient negative sampling for knowledge graph embedding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.040732Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:18f5f64d7712da2b24faf608d1ef81f31e9d2a1c8bc6ea9e7f1c93cd13cb8b4f","observation_id":"13183617-f1c7-4f72-b5c9-c29a4db41ea2","resolution":{"observed_at":"2026-08-12T14:52:40.040732Z","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:52:40.043467Z","title":"Adversarial knowledge representation learning without external model","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.043467Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:d9c77132828b9e6b5d00a086184b9447aac87c58474aa5aa9b9d3254bb7fdca1","observation_id":"465e2512-3ff0-4177-a8d2-b0cce99adbab","resolution":{"observed_at":"2026-08-12T14:52:40.043467Z","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:52:40.695086Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C","venue":null,"work_id":"27fd187f-c590-48ef-bc45-d2e3428f34a8","year":2014},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.046206Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:e1cff4aef4280eeb1d86fca87384c907214061da762787f67865ae2750f013be","observation_id":"f398361c-cc90-4bf4-8c22-a0de26c344dc","resolution":{"observed_at":"2026-08-12T14:52:40.698221Z","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:52:40.686357Z","title":"Reconciling competing sampling strategies of network embedding","venue":null,"work_id":"f6b129e3-aa1a-464f-a877-f47045279ad4","year":2023},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.049064Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:8abbc4e217d4567491384198d2cb68d32d34e51060093cfdf555d12dfa69901a","observation_id":"131f6c17-3fed-4316-bd81-c43b439a0049","resolution":{"observed_at":"2026-08-12T14:52:40.689520Z","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:52:40.051862Z","title":"Observed versus latent features for knowledge base and text inference","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.051862Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:7cab08f315e1b38565d19932742c2706099121e6d7d08fa915cd48d8f9fd77af","observation_id":"e3694f62-d94e-4d13-a835-9c2c029dd219","resolution":{"observed_at":"2026-08-12T14:52:40.051862Z","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:52:40.054699Z","title":"Systematic integration of biomedical knowledge prioritizes drugs for repurposing","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.054699Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:0a0a98f64b5bf8d8da282ebd3891d0cdee8f85a5b51cb51108a8ba8d0dfb7939","observation_id":"2eb7215c-7937-47d7-840d-cc67c0dfe955","resolution":{"observed_at":"2026-08-12T14:52:40.054699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10488","last_updated":"2022-05-23T10:55:45Z","snapshot_observed_at":"2026-07-06T11:11:42.215331Z","submitted_at":"2021-05-17T11:39:54Z","title":"Understanding the Performance of Knowledge Graph Embeddings in Drug Discovery","version":4},"cited_work":{"arxiv_id":"2105.10488","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.10488","snapshot_observed_at":"2026-08-12T14:52:40.202233Z","title":"Understanding the Performance of Knowledge Graph Embeddings in Drug Discovery","venue":"q-bio.BM","work_id":"a2c99f94-a107-4ae9-9eac-7029f142bf7d","year":2021},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.057607Z"},"links":{"cited_paper":"/paper/2105.10488","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:f56a7baa94d6e4c999dd632fd01aec79379cada94ea2e1791d8b66da99d68a1e","observation_id":"8e7ec21c-051d-4a2e-93f8-d1ce6462c7a9","resolution":{"observed_at":"2026-08-12T14:52:40.205621Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-12T14:52:40.060666Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.060666Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:4bfbe6c4cb6c70de04ac82fbf59b3a3466adc014479cd1b8dc5bafe5ffac778c","observation_id":"014d9907-9d5f-4852-a038-0e67d06daf2f","resolution":{"observed_at":"2026-08-12T14:52:40.060666Z","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:52:40.063647Z","title":"Embedding entities and relations for learning and inference in knowledge bases","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.063647Z"},"links":{"cited_paper":"/paper/1412.6575","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:03c3a86ca0ba6b5d6dd7eb5a0bf0a1fa86d841dc7bf315c094a4c0d39fc3c53f","observation_id":"c4125100-6937-455e-b895-926244745ef8","resolution":{"observed_at":"2026-08-12T14:52:40.063647Z","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:52:40.677525Z","title":"Complex embeddings for simple link prediction","venue":null,"work_id":"8d77e716-9ee5-4967-b4eb-a4beba5f4709","year":2016},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.066764Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:08e64dd733576b5d92207454d89e7651a99f4bacebfb5d714dee4ce64c8de09a","observation_id":"63fdf4b1-ddfb-42a3-9e5c-ff58afcac8e2","resolution":{"observed_at":"2026-08-12T14:52:40.680758Z","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:52:40.668414Z","title":"Canonical tensor decomposition for knowledge base completion","venue":null,"work_id":"477d5e47-1338-4c96-b605-f6e99e2cb4c5","year":2018},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.069562Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:28060c2f0b6e9dc935bd1a1bd8b3b3460dec4181cc014948aadd1d43bce7c9d0","observation_id":"87a23c46-9e42-4342-abbf-d0aff3cd64ab","resolution":{"observed_at":"2026-08-12T14:52:40.671708Z","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:52:40.658812Z","title":"Tucker: Tensor factorization for knowledge graph completion","venue":null,"work_id":"dc5447a3-333c-4537-a3f7-8ab76d6bd9bf","year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.072263Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:deec53317ee06d119a35156bdad661e28c2c951dbc5aa94a37780114fd65194b","observation_id":"0ee7e238-73b7-407c-a792-bec642c6624e","resolution":{"observed_at":"2026-08-12T14:52:40.662114Z","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":"2206.04798","last_updated":"2023-11-08T21:56:56Z","snapshot_observed_at":"2026-08-11T05:24:04.149018Z","submitted_at":"2022-06-07T01:01:36Z","title":"A*Net: A Scalable Path-based Reasoning Approach for Knowledge Graphs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04798","snapshot_observed_at":"2026-08-12T14:52:40.075098Z","title":"A*net: A scalable path-based reasoning approach for knowledge graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.075098Z"},"links":{"cited_paper":"/paper/2206.04798","citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:67037aa27269bddb2124c7b17e93b15964308297e457d10a7971d860f91a9ef8","observation_id":"fe79c214-26e8-44b0-9e0e-5821f57cd15e","resolution":{"observed_at":"2026-08-12T14:52:40.075098Z","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:52:40.078129Z","title":"AmpliGraph: a Library for Representation Learning on Knowledge Graphs, March 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.078129Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:024010b12be1c68e594b36f588c556fe737660ec8400b0f00e1dd49dfe98f12c","observation_id":"5d5731fe-3ac1-4dd5-a7d4-b634b2a4c2dd","resolution":{"observed_at":"2026-08-12T14:52:40.078129Z","resolver_source":null,"status":"malformed_identifier"},"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:52:40.009613Z","title":"doi: 10.18653/V1/P17-1088","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":962,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:40.009613Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:e699cb04f5463ae86b08f5ce1f36d1f8b849f183bdf70f251cf65eeb8de93d7a","observation_id":"8eb555ef-be5f-4109-91cd-b7ae21b599c2","resolution":{"observed_at":"2026-08-12T14:52:40.009613Z","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:52:40.790478Z","title":null,"venue":null,"work_id":"0829a44b-ed8d-48a8-aecd-c30152e1973b","year":2013},"citing_paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:39.975152Z"},"links":{"citing_paper":"/paper/2411.14858"},"observation_digest":"sha256:2ee420129b3aa6a89849268418aea0a41717de9f243a4ff93246f0bd29011c52","observation_id":"7f8f6e8b-2ecf-4acd-ac4b-5c26e29a8c86","resolution":{"observed_at":"2026-08-12T14:52:40.794156Z","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"}}],"paper":{"arxiv_id":"2411.14858","last_updated":"2024-11-22T11:17:32Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T14:45:05.431335Z","submitted_at":"2024-11-22T11:17:32Z","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":20,"verified_exact":4,"verified_fuzzy":13},"total_outbound_references":40},"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 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2411.14858."}