{"as_of":"2026-08-18T23:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:86a93fb8bd363d5cbb01d89fe1e6f8ea9124dd22cf0562e642ffff58d8cab08b","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:02:47.997430Z","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-07-04T13:09:51.228324Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.08236","last_updated":"2022-01-16T05:43:49Z","snapshot_observed_at":"2026-08-16T17:28:06.351551Z","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-10T15:39:17.992342Z","title":"Temporal knowl- edge graph completion: A survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13763","last_updated":"2025-02-08T11:06:44Z","snapshot_observed_at":"2026-08-17T01:08:33.699604Z","submitted_at":"2025-01-23T15:45:29Z","title":"Integrating Causality with Neurochaos Learning: Proposed Approach and Research Agenda","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T15:39:17.992342Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2501.13763"},"observation_digest":"sha256:b3a3c3c0b51b6cd1e2f1c445a37915c9d21f95348546a19d7aa0bc27bc0d74f5","observation_id":"7edbfd29-1738-4f3c-b332-857b31dc8198","resolution":{"observed_at":"2026-08-10T15:39:17.992342Z","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-16T17:28:06.351551Z","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-15T22:02:47.997430Z","title":"arXiv preprint arXiv:220108236 doi:10.48550/arXiv.2201.08236","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08330","last_updated":"2025-05-13T08:10:41Z","snapshot_observed_at":"2026-08-18T22:10:04.131144Z","submitted_at":"2025-05-13T08:10:41Z","title":"Structural-Temporal Coupling Anomaly Detection with Dynamic Graph Transformer","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T22:02:47.997430Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2505.08330"},"observation_digest":"sha256:3886236a8869039a5818b1a17f25f410924433130550a4c2053a6e9bd70d0f74","observation_id":"a1c9facb-202b-44c1-bee1-e70c6017bcfb","resolution":{"observed_at":"2026-08-15T22:02:47.997430Z","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-16T17:28:06.351551Z","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-17T21:17:14.673037Z","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:e54e346098d4b69c1181c17714fd8044eae275c12c47db64d3674ca478d0626a","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":{"arxiv_id":"2201.08236","last_updated":"2022-01-16T05:43:49Z","snapshot_observed_at":"2026-08-16T17:28:06.351551Z","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-05T21:11:50.489060Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.14080","last_updated":"2025-08-12T19:43:44Z","snapshot_observed_at":"2026-08-18T07:26:19.993323Z","submitted_at":"2025-08-12T19:43:44Z","title":"KnowDR-REC: A Benchmark for Referring Expression Comprehension with Real-World Knowledge","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T21:11:50.489060Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2508.14080"},"observation_digest":"sha256:e822c87cb0a24061ad8c099d7fa9cca922d8a7f702dc4110bfc48c26d58bacf0","observation_id":"e5a046f0-baa5-4d80-bda4-ba0aa1101d94","resolution":{"observed_at":"2026-08-05T21:11:50.489060Z","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-16T17:28:06.351551Z","submitted_at":"2022-01-16T05:43:49Z","title":"Temporal Knowledge Graph Completion: A Survey","version":1},"cited_work":{"arxiv_id":"2201.08236","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.08236","snapshot_observed_at":"2026-07-04T13:09:51.228324Z","title":"arXiv preprint arXiv:2201.08236 , year =","venue":null,"work_id":"0d6093bd-b92c-4f1d-b16a-19c9f8447b3c","year":null},"citing_paper":{"arxiv_id":"2606.26511","last_updated":"2026-06-25T01:31:53Z","snapshot_observed_at":"2026-08-14T01:13:56.383103Z","submitted_at":"2026-06-25T01:31:53Z","title":"Temporal Validity in Retrieval Memory: Eliminating Stale-Fact Errors for AI Agents over Evolving Knowledge","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-26T05:26:34.543601Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2606.26511"},"observation_digest":"sha256:f2a84e9db8ca6c157718d4166833bc355cff30ea681a8401dd3f3d3da6c38b76","observation_id":"5e864cbf-1e93-49cc-ade4-df5a8e35238e","resolution":{"observed_at":"2026-07-04T13:09:51.229849Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.08236","last_updated":"2022-01-16T05:43:49Z","snapshot_observed_at":"2026-08-16T17:28:06.351551Z","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-01T10:14:43.047511Z","title":"Temporal knowledge graph completion: A survey.arXiv preprint arXiv:2201.08236, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-15T16:38:07.039933Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.047511Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:1ef65b1e33c960829fa922ce75a1973b66ce9fa4dc09c93296bd4ff3e47de213","observation_id":"c57ec377-e4b1-42e3-a134-5f94e096ae2b","resolution":{"observed_at":"2026-08-01T10:14:43.047511Z","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-16T17:28:06.351551Z","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-06T05:27:14.847767Z","title":"arXiv preprint arXiv:2201.08236 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05095","last_updated":"2026-08-05T17:32:43Z","snapshot_observed_at":"2026-08-16T11:54:55.086359Z","submitted_at":"2026-08-05T17:32:43Z","title":"Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T05:27:14.847767Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2608.05095"},"observation_digest":"sha256:3fd32cac65ef4f309a07257d47952bc2c94b602ac1328ecbbb8080af369655e3","observation_id":"ecff0cde-fca2-4ab6-b0ff-8521c845dbe7","resolution":{"observed_at":"2026-08-06T05:27:14.847767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.08236/citation-record","integrity":"/paper/2201.08236/integrity","json":"/paper/2201.08236/citation-record.json","paper":"/paper/2201.08236"},"outbound":[],"paper":{"arxiv_id":"2201.08236","last_updated":"2022-01-16T05:43:49Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T17:28:06.351551Z","submitted_at":"2022-01-16T05:43:49Z","title":"Temporal Knowledge Graph Completion: A Survey"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2201.08236."}