{"as_of":"2026-08-20T23:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28be584444d2674faf7edf4fa31f1f15922254fa25f4efc072125787fee93d84","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-20T06:33:59.587034+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-14T10:23:44.332774Z","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-14T10:23:44.404631Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.04673","last_updated":"2018-06-12T13:01:51Z","snapshot_observed_at":"2026-08-20T18:46:39.480038Z","submitted_at":"2018-06-12T13:01:51Z","title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs","version":1},"cited_work":{"arxiv_id":"1806.04673","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.04673","snapshot_observed_at":"2026-08-14T10:23:44.404631Z","title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs","venue":"math.CO","work_id":"25d4f6ac-48e9-4a2b-9b4a-f6a614dfdac6","year":2018},"citing_paper":{"arxiv_id":"1909.00019","last_updated":"2021-01-14T08:38:40Z","snapshot_observed_at":"2026-08-20T16:19:06.223019Z","submitted_at":"2019-08-30T18:14:52Z","title":"Enumeration and Extensions of Word-representants","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:23:44.332774Z"},"links":{"cited_paper":"/paper/1806.04673","citing_paper":"/paper/1909.00019"},"observation_digest":"sha256:d60df239914b4384815121b8c720501bc0cae17730c7ccb6fcc2e609a4445bd1","observation_id":"78e79f3e-e1e2-47f1-bbfa-d6fed0242c61","resolution":{"observed_at":"2026-08-14T10:23:44.411814Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1806.04673/citation-record","integrity":"/paper/1806.04673/integrity","json":"/paper/1806.04673/citation-record.json","paper":"/paper/1806.04673"},"outbound":[],"paper":{"arxiv_id":"1806.04673","last_updated":"2018-06-12T13:01:51Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-20T18:46:39.480038Z","submitted_at":"2018-06-12T13:01:51Z","title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1806.04673."}