{"as_of":"2026-08-08T08:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8ec708456fcc28a0b5f59c56038714016ed25e89296a669ccd107a78aa15ea3","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:19:02.072230Z","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-08-07T05:01:36.914221Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.08167","last_updated":"2021-04-16T15:26:41Z","snapshot_observed_at":"2026-08-08T07:48:14.259012Z","submitted_at":"2021-04-16T15:26:41Z","title":"Improving Hyper-Relational Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08167","snapshot_observed_at":"2026-08-07T10:19:02.072230Z","title":"Improving hyper-relational knowledge graph completion,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05626","last_updated":"2025-06-29T19:40:42Z","snapshot_observed_at":"2026-08-08T03:19:25.880206Z","submitted_at":"2025-06-05T22:59:39Z","title":"Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods","version":2},"reference_index":207,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:02.072230Z"},"links":{"cited_paper":"/paper/2104.08167","citing_paper":"/paper/2506.05626"},"observation_digest":"sha256:3c4c7e23db30848407954a4f85f80c6cbd49c840bf4ffdd13c0cfb985aa8ef85","observation_id":"ae568da9-d3ce-4414-9c0f-c7b481829c8a","resolution":{"observed_at":"2026-08-07T10:19:02.072230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08167","last_updated":"2021-04-16T15:26:41Z","snapshot_observed_at":"2026-08-08T07:48:14.259012Z","submitted_at":"2021-04-16T15:26:41Z","title":"Improving Hyper-Relational Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":"2104.08167","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.08167","snapshot_observed_at":"2026-08-07T05:01:36.914221Z","title":"Improving Hyper-Relational Knowledge Graph Completion","venue":"cs.LG","work_id":"0af40946-d35b-4b6d-959f-f77264c301a7","year":2021},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.862449Z"},"links":{"cited_paper":"/paper/2104.08167","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:0862fa9f80b185fa47ade51be5a0891efa045dd5ac38727094a81c59c05b1965","observation_id":"04e9d117-4027-4063-b783-4673f3c5adf5","resolution":{"observed_at":"2026-08-07T05:01:36.918359Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2104.08167/citation-record","integrity":"/paper/2104.08167/integrity","json":"/paper/2104.08167/citation-record.json","paper":"/paper/2104.08167"},"outbound":[],"paper":{"arxiv_id":"2104.08167","last_updated":"2021-04-16T15:26:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T07:48:14.259012Z","submitted_at":"2021-04-16T15:26:41Z","title":"Improving Hyper-Relational Knowledge Graph Completion"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2104.08167."}