{"as_of":"2026-08-16T14:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1c9ec09371b03f73fc26aaa4f121c49733102f9f5fb2d3d754fc90ae6186832","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:02:38.372805Z","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-14T13:02:38.437467Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1310.5111","last_updated":"2014-03-06T18:47:40Z","snapshot_observed_at":"2026-08-14T23:58:27.110647Z","submitted_at":"2013-10-18T17:56:28Z","title":"Complexity of Word Collocation Networks: A Preliminary Structural Analysis","version":5},"cited_work":{"arxiv_id":"1310.5111","doi":null,"metadata_source":"pith","pith_arxiv_id":"1310.5111","snapshot_observed_at":"2026-08-14T13:02:38.437467Z","title":"Complexity of Word Collocation Networks: A Preliminary Structural Analysis","venue":"cs.SI","work_id":"03a25663-118d-4123-bb3e-0eca4c36242d","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-16T03:00:29.308710Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.372805Z"},"links":{"cited_paper":"/paper/1310.5111","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:1133e77aaf8ab05fd59e6e15d808e3099a39ba4d6238905693e45c34388a6b62","observation_id":"f5ee1d36-2c50-4d84-b83c-d0c8e7ed1cb7","resolution":{"observed_at":"2026-08-14T13:02:38.442133Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1310.5111/citation-record","integrity":"/paper/1310.5111/integrity","json":"/paper/1310.5111/citation-record.json","paper":"/paper/1310.5111"},"outbound":[],"paper":{"arxiv_id":"1310.5111","last_updated":"2014-03-06T18:47:40Z","latest_version":5,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-14T23:58:27.110647Z","submitted_at":"2013-10-18T17:56:28Z","title":"Complexity of Word Collocation Networks: A Preliminary Structural Analysis"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1310.5111."}