{"as_of":"2026-08-16T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c54248e4ab88350cf1ebe38dfc8a82d7edec8ccefb695aa22ec04f28c41b23a","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-15T15:56:21.257047Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1101.1232","last_updated":"2011-01-06T15:07:37Z","snapshot_observed_at":"2026-08-16T07:08:27.237966Z","submitted_at":"2011-01-06T15:07:37Z","title":"Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1101.1232","snapshot_observed_at":"2026-08-15T15:56:21.257047Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.10697","last_updated":"2025-09-12T21:25:25Z","snapshot_observed_at":"2026-08-15T23:27:20.931208Z","submitted_at":"2025-09-12T21:25:25Z","title":"A Survey on Retrieval And Structuring Augmented Generation with Large Language Models","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T15:56:21.257047Z"},"links":{"cited_paper":"/paper/1101.1232","citing_paper":"/paper/2509.10697"},"observation_digest":"sha256:8ea93fa8d5a8cb0f50a96dd4d60c8319589e7d8aa17e1b4cd451cc861685fcfa","observation_id":"2903ffb7-d8c9-4dda-bd5e-9ce32090c3fa","resolution":{"observed_at":"2026-08-15T15:56:21.257047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1101.1232/citation-record","integrity":"/paper/1101.1232/integrity","json":"/paper/1101.1232/citation-record.json","paper":"/paper/1101.1232"},"outbound":[],"paper":{"arxiv_id":"1101.1232","last_updated":"2011-01-06T15:07:37Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T07:08:27.237966Z","submitted_at":"2011-01-06T15:07:37Z","title":"Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved 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-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:1101.1232."}