{"as_of":"2026-08-20T09:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94b422017d2ec29b44b8b10b1fac4e3bd4d062f04efa49c0416a3180d0919ad5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-14T12:56:02.492250Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T20:47:22.378498Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1506.00379","last_updated":"2015-08-15T09:28:49Z","snapshot_observed_at":"2026-08-14T22:46:20.462378Z","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.00379","snapshot_observed_at":"2026-08-14T12:56:02.492250Z","title":"Modeling relation paths for representation learning of knowledge bases","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.06178","last_updated":"2019-08-16T21:12:37Z","snapshot_observed_at":"2026-08-15T10:06:00.135890Z","submitted_at":"2019-08-16T21:12:37Z","title":"Distributional Negative Sampling for Knowledge Base Completion","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:56:02.492250Z"},"links":{"cited_paper":"/paper/1506.00379","citing_paper":"/paper/1908.06178"},"observation_digest":"sha256:a54ac9bde1d5080320c594c9c9d3b805b9283a23838b14d81f4b525b588a42bc","observation_id":"9fe971a7-2b44-4c89-8b91-e2e5adc14f65","resolution":{"observed_at":"2026-08-14T12:56:02.492250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.00379","last_updated":"2015-08-15T09:28:49Z","snapshot_observed_at":"2026-08-14T22:46:20.462378Z","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.00379","snapshot_observed_at":"2026-08-14T05:54:36.877291Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1909.00519","last_updated":"2019-10-10T08:58:05Z","snapshot_observed_at":"2026-08-14T12:34:47.938586Z","submitted_at":"2019-09-02T03:10:14Z","title":"Toward Understanding The Effect Of Loss function On Then Performance Of Knowledge Graph Embedding","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T05:54:36.877291Z"},"links":{"cited_paper":"/paper/1506.00379","citing_paper":"/paper/1909.00519"},"observation_digest":"sha256:f4222bf59351c055cce3aef69dc7491fef3d7d8796bef2e159266aa9f48b7547","observation_id":"c29f9bf5-fd3b-4570-acf3-80a76be62b52","resolution":{"observed_at":"2026-08-14T05:54:36.877291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.00379","last_updated":"2015-08-15T09:28:49Z","snapshot_observed_at":"2026-08-14T22:46:20.462378Z","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","version":2},"cited_work":{"arxiv_id":"1506.00379","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.00379","snapshot_observed_at":"2026-07-02T20:47:22.378498Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","venue":"cs.CL","work_id":"840ae1a0-57b9-4496-aaa3-dc8742047755","year":2015},"citing_paper":{"arxiv_id":"2606.29860","last_updated":"2026-07-01T02:01:59Z","snapshot_observed_at":"2026-08-14T21:44:04.130518Z","submitted_at":"2026-06-29T06:54:40Z","title":"Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T06:37:44.220400Z"},"links":{"cited_paper":"/paper/1506.00379","citing_paper":"/paper/2606.29860"},"observation_digest":"sha256:133042143802edd9736f81f90844d69b926c6526fe14b7edeb2ade74b3a2c578","observation_id":"ea902b4a-af79-4f0a-b5c8-7c3f46d30125","resolution":{"observed_at":"2026-06-30T06:44:19.450174Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.00379","last_updated":"2015-08-15T09:28:49Z","snapshot_observed_at":"2026-08-14T22:46:20.462378Z","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","version":2},"cited_work":{"arxiv_id":"1506.00379","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.00379","snapshot_observed_at":"2026-07-02T20:47:22.378498Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","venue":"cs.CL","work_id":"840ae1a0-57b9-4496-aaa3-dc8742047755","year":2015},"citing_paper":{"arxiv_id":"2606.29860","last_updated":"2026-07-01T02:01:59Z","snapshot_observed_at":"2026-08-14T21:44:04.130518Z","submitted_at":"2026-06-29T06:54:40Z","title":"Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-02T20:45:25.064006Z"},"links":{"cited_paper":"/paper/1506.00379","citing_paper":"/paper/2606.29860"},"observation_digest":"sha256:08a76fd4eb2411abd3948c244dc857cbad55c165bb4d9a5d326c0ea0a5fe4b32","observation_id":"c8755521-8935-4d45-848a-4694ca5bb405","resolution":{"observed_at":"2026-07-02T20:47:22.379670Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1506.00379/citation-record","integrity":"/paper/1506.00379/integrity","json":"/paper/1506.00379/citation-record.json","paper":"/paper/1506.00379"},"outbound":[],"paper":{"arxiv_id":"1506.00379","last_updated":"2015-08-15T09:28:49Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T22:46:20.462378Z","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1506.00379."}