{"as_of":"2026-08-08T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5b255c557adb89f9f73317d3db9fff02b9510729f94fa615269faf815b3ceea","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:18:39.234249Z","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.939447Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.08476","last_updated":"2021-05-18T12:40:35Z","snapshot_observed_at":"2026-08-07T03:32:43.184124Z","submitted_at":"2021-05-18T12:40:35Z","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.08476","snapshot_observed_at":"2026-08-07T10:18:39.234249Z","title":"Link prediction on n-ary relational facts: A graph-based approach,","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":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:39.234249Z"},"links":{"cited_paper":"/paper/2105.08476","citing_paper":"/paper/2506.05626"},"observation_digest":"sha256:baa3a37054d19d1fbb55f812a8f9b098f87703cf0786dc2980d1e4293398bd36","observation_id":"2c83e428-9447-419f-b4c1-aacec83b5946","resolution":{"observed_at":"2026-08-07T10:18:39.234249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08476","last_updated":"2021-05-18T12:40:35Z","snapshot_observed_at":"2026-08-07T03:32:43.184124Z","submitted_at":"2021-05-18T12:40:35Z","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach","version":1},"cited_work":{"arxiv_id":"2105.08476","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.08476","snapshot_observed_at":"2026-08-07T05:01:36.939447Z","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach","venue":"cs.AI","work_id":"f52d13a7-89a0-4806-bb1c-ef2f6ed8bf92","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":2017,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.856769Z"},"links":{"cited_paper":"/paper/2105.08476","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:92b5087b09581f58c37db60df45504e3a4207be0d19b14fe4cde08266020223f","observation_id":"0abd50ca-6dbe-4291-b91a-adb0d8f16c6c","resolution":{"observed_at":"2026-08-07T05:01:36.942741Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2105.08476/citation-record","integrity":"/paper/2105.08476/integrity","json":"/paper/2105.08476/citation-record.json","paper":"/paper/2105.08476"},"outbound":[],"paper":{"arxiv_id":"2105.08476","last_updated":"2021-05-18T12:40:35Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T03:32:43.184124Z","submitted_at":"2021-05-18T12:40:35Z","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach"},"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:2105.08476."}