{"as_of":"2026-08-21T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3645a9ee4208b078dd1a3e4f565fd6c4a6b15378e2350adaf8b3595bcea7a23a","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-21T06:32:19.484+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-12T20:07:22.916569Z","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-11T09:00:59.665799Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.05185","last_updated":"2024-10-30T15:18:14Z","snapshot_observed_at":"2026-08-17T13:00:22.845676Z","submitted_at":"2023-10-08T14:47:13Z","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05185","snapshot_observed_at":"2026-08-12T20:07:22.916569Z","title":"Text2nkg: Fine-grained n-ary relation extraction for n-ary relational knowledge graph construction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-19T12:45:16.824689Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.916569Z"},"links":{"cited_paper":"/paper/2310.05185","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:325305dece7c5f86478286a45180d0bd52b02453a74c3a209ac8f0320241a943","observation_id":"f5ea60c7-ba94-4ba7-9118-79bd8b410d8c","resolution":{"observed_at":"2026-08-12T20:07:22.916569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05185","last_updated":"2024-10-30T15:18:14Z","snapshot_observed_at":"2026-08-17T13:00:22.845676Z","submitted_at":"2023-10-08T14:47:13Z","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction","version":3},"cited_work":{"arxiv_id":"2310.05185","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.05185","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction, October 2024","venue":null,"work_id":"e49c6cbe-6df8-4c96-a48e-cf8b5da14a86","year":2024},"citing_paper":{"arxiv_id":"2604.12185","last_updated":"2026-04-14T01:31:35Z","snapshot_observed_at":"2026-08-20T12:29:38.175788Z","submitted_at":"2026-04-14T01:31:35Z","title":"Knowledge Is Not Static: Order-Aware Hypergraph RAG for Language Models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T16:20:31.981340Z"},"links":{"cited_paper":"/paper/2310.05185","citing_paper":"/paper/2604.12185"},"observation_digest":"sha256:d7dba830f7404a64a68891c3da0c8e3f6f910bf58d6d4f3c8105df185bb60e48","observation_id":"76f78138-4e8d-4b65-88e7-355db8a72372","resolution":{"observed_at":"2026-05-11T09:00:59.667956Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.05185/citation-record","integrity":"/paper/2310.05185/integrity","json":"/paper/2310.05185/citation-record.json","paper":"/paper/2310.05185"},"outbound":[],"paper":{"arxiv_id":"2310.05185","last_updated":"2024-10-30T15:18:14Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T13:00:22.845676Z","submitted_at":"2023-10-08T14:47:13Z","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.05185."}