{"as_of":"2026-08-07T19:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e5e296aa0a85fe801ea95a30f1dccaacd8e9af69789257b5e4a9553ef2e06c4","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:51:37.554302Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:29:55.161033Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T20:33:17.213734Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23442","snapshot_observed_at":"2026-08-07T11:29:55.161033Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.02492","last_updated":"2025-06-03T06:13:19Z","snapshot_observed_at":"2026-08-07T11:20:24.050983Z","submitted_at":"2025-06-03T06:13:19Z","title":"Co-Evidential Fusion with Information Volume for Medical Image Segmentation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:29:55.161033Z"},"links":{"cited_paper":"/paper/2505.23442","citing_paper":"/paper/2506.02492"},"observation_digest":"sha256:b66506d2e4abac4622962204251b08ff8293acde6456d4b49d81a552b9de676c","observation_id":"e45db884-221d-4a64-a272-29a54398619e","resolution":{"observed_at":"2026-08-07T11:29:55.161033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23442","snapshot_observed_at":"2026-08-06T13:29:58.316255Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20620","last_updated":"2025-07-28T08:35:11Z","snapshot_observed_at":"2026-08-06T13:29:57.446848Z","submitted_at":"2025-07-28T08:35:11Z","title":"Complementarity-driven Representation Learning for Multi-modal Knowledge Graph Completion","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T13:29:58.316255Z"},"links":{"cited_paper":"/paper/2505.23442","citing_paper":"/paper/2507.20620"},"observation_digest":"sha256:5a68d0918d87bfa9ad5e72e94bac4d94d2aaa02c471fa71bf631628ee2a128b2","observation_id":"49299608-0ae5-40b9-91c2-96c37e6c5704","resolution":{"observed_at":"2026-08-06T13:29:58.316255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23442","snapshot_observed_at":"2026-08-06T13:29:15.085459Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20641","last_updated":"2025-07-28T08:58:25Z","snapshot_observed_at":"2026-08-07T05:38:09.029167Z","submitted_at":"2025-07-28T08:58:25Z","title":"Adaptive Fuzzy Time Series Forecasting via Partially Asymmetric Convolution and Sub-Sliding Window Fusion","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T13:29:15.085459Z"},"links":{"cited_paper":"/paper/2505.23442","citing_paper":"/paper/2507.20641"},"observation_digest":"sha256:6276c9660b44af23653ffb405136e9613bb96460cac70ac0e7beaafdb18a17a5","observation_id":"c6b850ec-952b-42e5-b023-86bb30d693c6","resolution":{"observed_at":"2026-08-06T13:29:15.085459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":"2505.23442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.23442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5247efb1-abd9-4873-84df-8099207d2760","year":2025},"citing_paper":{"arxiv_id":"2604.02778","last_updated":"2026-08-05T07:50:58Z","snapshot_observed_at":"2026-08-07T19:16:34.650454Z","submitted_at":"2026-04-03T06:40:04Z","title":"When Modalities Remember: Continual Learning for Multimodal Knowledge Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T20:28:15.113759Z"},"links":{"cited_paper":"/paper/2505.23442","citing_paper":"/paper/2604.02778"},"observation_digest":"sha256:41a5cc2d9a30cba5ace132af5b6178af3b511ecd15e18ebeed1355f2b50a8c8d","observation_id":"2c1d386d-5534-4ddb-9322-da5e60c97a20","resolution":{"observed_at":"2026-05-13T20:33:17.214979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.23442/citation-record","integrity":"/paper/2505.23442/integrity","json":"/paper/2505.23442/citation-record.json","paper":"/paper/2505.23442"},"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-07T12:51:38.133954Z","title":null,"venue":null,"work_id":"77294120-1b97-422e-b1e5-208b6d34a30a","year":2006},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:37.554302Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:92710dee2cad32eb557a8fb69ebb2de709a73187a394816ce34afe8a90a3f428","observation_id":"7a0191a2-a776-49b2-b37e-492a88fabae9","resolution":{"observed_at":"2026-08-07T12:51:38.306300Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03193","last_updated":"2019-09-11T06:03:30Z","snapshot_observed_at":"2026-07-06T08:19:51.929437Z","submitted_at":"2019-09-07T06:09:25Z","title":"KG-BERT: BERT for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03193","snapshot_observed_at":"2026-08-07T12:51:35.033332Z","title":"Kg-bert: Bert for knowledge graph completion.arXiv preprint arXiv:1909.03193,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.033332Z"},"links":{"cited_paper":"/paper/1909.03193","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:12b82c98ce1429cc86fc905e7baac35ae45c547509f460b92f7453a16c0fc341","observation_id":"2c9e7866-a6cb-499a-9e2c-77157afabe79","resolution":{"observed_at":"2026-08-07T12:51:35.033332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:51:39.436372Z","title":null,"venue":null,"work_id":"5cb0a826-b813-4ea4-88d4-0c21285fdf42","year":2018},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.934927Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:5978f40d1d3ea621a0108e53d8da687ec944ddafd5f9801859345924b850efcd","observation_id":"a2767549-4a55-4a0b-8887-89e7d6824f5d","resolution":{"observed_at":"2026-08-07T12:51:39.539964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:51:39.097276Z","title":"No Reg\") quickly achieved near-perfect scores on training data (MRR and Hits@1 close to 1.0). However, their performance on validation set data (","venue":null,"work_id":"fbd7ba29-4da0-4d33-910b-f01a29d0d3b2","year":2000},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:37.075496Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:c0eacf94e9aa58e580dd1d7b14970f9308ff3d949b8861376d176ebf0f1c6eb5","observation_id":"4fd76b43-abb0-401d-be5c-ce97d179f137","resolution":{"observed_at":"2026-08-07T12:51:39.245102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.03202","last_updated":"2018-09-10T09:17:04Z","snapshot_observed_at":"2026-07-06T07:00:07.140150Z","submitted_at":"2018-09-10T09:17:04Z","title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.03202","snapshot_observed_at":"2026-08-07T12:51:36.267063Z","title":"Hge: embedding temporal knowledge graphs in a product space of heterogeneous geometric subspaces","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.267063Z"},"links":{"cited_paper":"/paper/1809.03202","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:f97079cfeff1fa6e735d3d12d53c7925d938377f62fd8ccde63362660957e33b","observation_id":"11a9b2c4-5304-4ad2-a227-b5ec9d8cea27","resolution":{"observed_at":"2026-08-07T12:51:36.267063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01538","last_updated":"2024-01-22T02:39:17Z","snapshot_observed_at":"2026-07-06T16:14:01.852423Z","submitted_at":"2023-09-04T11:38:02Z","title":"ChatRule: Mining Logical Rules with Large Language Models for Knowledge Graph Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01538","snapshot_observed_at":"2026-08-07T12:51:36.375183Z","title":"Chatrule: Mining logical rules with large language models for knowledge graph reasoning.arXiv preprint arXiv:2309.01538, 2023b","venue":null,"work_id":null,"year":1929},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.375183Z"},"links":{"cited_paper":"/paper/2309.01538","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:b7e09cef62baa6f3da40bcb9f7fc7edfa4a256b187522923c8edcb199b0d8092","observation_id":"c1901ace-00d4-4270-9dd7-9dc333cdd178","resolution":{"observed_at":"2026-08-07T12:51:36.375183Z","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-07T12:51:39.905799Z","title":"close\" to the embedding vector of the tail entity t. Mathematically, it can be expressed as ei +r k ≈e j. The","venue":null,"work_id":"ed166581-7a5d-4636-acbb-bfc0bb5a04da","year":2024},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.542330Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:54911f579f6187bf1fe1335e906b82a253f95ad85383c1555aec61eb2a7a96a4","observation_id":"d61c0c2a-a6c1-4c1c-afee-232afa049b52","resolution":{"observed_at":"2026-08-07T12:51:39.996779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:51:39.700878Z","title":null,"venue":null,"work_id":"8263b273-30ef-4b19-b558-22071ba70bf0","year":1927},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.754661Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:903b6348ba1c101fba917f883db1da26fdfde8dce551dc02ca4c2e2c512fb494","observation_id":"c7cd989f-51ab-4272-a434-c76c6d707998","resolution":{"observed_at":"2026-08-07T12:51:39.787824Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:51:38.797648Z","title":null,"venue":null,"work_id":"cef01e00-0bf6-4efd-ac74-bd6657e5be34","year":2014},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:37.243170Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:bbe034573365a31c88d5a1f965323fd622e44e7e645b7a7fa0bc23f6e4de310b","observation_id":"1d2f1f0c-b30b-4d14-9b04-19076c3c9407","resolution":{"observed_at":"2026-08-07T12:51:38.953773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:51:38.490823Z","title":null,"venue":null,"work_id":"ff345738-0cd0-410f-b5b6-e23436744705","year":2014},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:37.412646Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:6241e3a436e21f8d2fc99391d290153ba371e54cb9a204ce60c7a7b5b92e0cdb","observation_id":"f8d3cf05-ae2a-44cf-9ab2-03e41ea843ae","resolution":{"observed_at":"2026-08-07T12:51:38.606951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6575","last_updated":"2015-08-29T15:08:45Z","snapshot_observed_at":"2026-07-06T04:04:18.621124Z","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-07T12:51:35.627489Z","title":"Embedding entities and relations for learning and inference in knowledge bases.arXiv preprint arXiv:1412.6575,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":1927,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.627489Z"},"links":{"cited_paper":"/paper/1412.6575","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:61c63d5cac29ededcf0065310541d3918741e4167005007d4602adc43a746f4f","observation_id":"dd574905-7d0d-42d5-bca4-816b36edf142","resolution":{"observed_at":"2026-08-07T12:51:35.627489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.02457","last_updated":"2023-08-04T16:49:54Z","snapshot_observed_at":"2026-08-03T21:39:56.945784Z","submitted_at":"2023-08-04T16:49:54Z","title":"A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.02457","snapshot_observed_at":"2026-08-07T12:51:36.109822Z","title":"A survey on temporal knowledge graph completion: Taxonomy, progress, and prospects","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.109822Z"},"links":{"cited_paper":"/paper/2308.02457","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:f5a3afe22691984fe1f594fd93dd63c1ef074ac1d24d7da98554606425ee9015","observation_id":"37c38bd4-a4ae-400a-8bca-53c70f963eb9","resolution":{"observed_at":"2026-08-07T12:51:36.109822Z","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-07T12:51:35.155247Z","title":"Embedding entities and relations for learning and inference in knowledge bases","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.155247Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:650d6c4bd00ac7adde7300df0f1f15b0e3cbf92981188b3923160504555a01bd","observation_id":"259aec86-de19-44b8-a59a-6c5c77a63100","resolution":{"observed_at":"2026-08-07T12:51:35.155247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-07-06T16:26:26.426279Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T12:51:34.903463Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning.arXiv preprint arXiv:2310.01061, 2023a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:34.903463Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:edc72fc89d538d0d90f3ef198300b659cec9787accba2e6dd8a1d11ce1a48e15","observation_id":"af906bb3-7a1b-4ad8-85a8-365302b35c68","resolution":{"observed_at":"2026-08-07T12:51:34.903463Z","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-07T12:51:40.117803Z","title":"Complex embed- dings for simple link prediction","venue":null,"work_id":"38301f13-532a-489e-a765-57d024d8b2bb","year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.770318Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:3ea57783343c14638bbd458c53799b08d1c47101025e8e9e9d58e4a613927b3a","observation_id":"6549f0da-2120-4055-b31a-d9b5d2cb7790","resolution":{"observed_at":"2026-08-07T12:51:40.183469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10197","last_updated":"2019-02-26T20:15:09Z","snapshot_observed_at":"2026-08-06T13:43:56.202740Z","submitted_at":"2019-02-26T20:15:09Z","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10197","snapshot_observed_at":"2026-08-07T12:51:35.326379Z","title":"Rotate: Knowledge graph embedding by relational rotation in complex space.arXiv preprint arXiv:1902.10197,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.326379Z"},"links":{"cited_paper":"/paper/1902.10197","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:42c14c22eb66729ef3336dff7a7c79a010eadf96f7d95345734451a6030c770e","observation_id":"39335d69-a406-4c0d-9d0b-c5d68bbf6433","resolution":{"observed_at":"2026-08-07T12:51:35.326379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T12:51:35.898851Z","title":"Tucker: Tensor factorization for knowledge graph completion.arXiv preprint arXiv:1901.09590,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.898851Z"},"links":{"cited_paper":"/paper/1901.09590","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:ae58687a37711ef2da9a7ff67d1c5c4c2adf7c45a19d0152f0211dbc0b19db30","observation_id":"79133c1e-4cf3-44f0-b0ac-42da50491c17","resolution":{"observed_at":"2026-08-07T12:51:35.898851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00545","last_updated":"2020-05-01T18:00:02Z","snapshot_observed_at":"2026-08-05T01:03:21.419855Z","submitted_at":"2020-05-01T18:00:02Z","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00545","snapshot_observed_at":"2026-08-07T12:51:35.463272Z","title":"Learning hierarchy-aware knowledge graph embeddings for link prediction","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.463272Z"},"links":{"cited_paper":"/paper/2005.00545","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:d734a0a54c927e5d4f37708b44e867262b90cef471101dc2b357de3be5f74c23","observation_id":"a07914d2-90b6-4e6e-a9af-7f03ac3e44fc","resolution":{"observed_at":"2026-08-07T12:51:35.463272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2653","last_updated":"2012-05-09T15:01:22Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T15:01:22Z","title":"L2 Regularization for Learning Kernels","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2653","snapshot_observed_at":"2026-08-07T12:51:35.975270Z","title":"L2 regularization for learning kernels.arXiv preprint arXiv:1205.2653,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:35.975270Z"},"links":{"cited_paper":"/paper/1205.2653","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:ff7a8eeb51d77cb011ee2245de09cd9bcfeeade75b5051af28bdbc2ea2b43fc8","observation_id":"4d1bb185-c677-4918-a669-837c4b840cfe","resolution":{"observed_at":"2026-08-07T12:51:35.975270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.08236","last_updated":"2022-01-16T05:43:49Z","snapshot_observed_at":"2026-08-03T07:37:46.835328Z","submitted_at":"2022-01-16T05:43:49Z","title":"Temporal Knowledge Graph Completion: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.08236","snapshot_observed_at":"2026-08-07T12:51:36.171822Z","title":"Temporal knowledge graph completion: A survey.arXiv preprint arXiv:2201.08236,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:36.171822Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:acf0a6f13d87601b1f5bbcfeacf809f18f106804094706e99d4adff8374ffd7d","observation_id":"56b88883-536c-46a9-9df3-c67aa1b02360","resolution":{"observed_at":"2026-08-07T12:51:36.171822Z","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-07T12:51:40.295294Z","title":"Mole-bert: Rethinking pre-training graph neural networks for molecules","venue":null,"work_id":"2499a3c7-2772-4eed-b6f5-da079b756005","year":2008},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:34.771260Z"},"links":{"citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:42d7beb56f327063dfae44e624d4222fc293c3f4276c2ac7bdf0d380f5750199","observation_id":"a7a10e2a-fa63-4ae7-86c5-37e8ca06f608","resolution":{"observed_at":"2026-08-07T12:51:40.339466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:43:30.914923Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 4 inbound Pith citation observations for arXiv:2505.23442."}