{"as_of":"2026-08-17T07:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e974ffe526c3becaa143d644d91109f2f754a4c0f9f0a450aaa1fd0ad09000fc","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-17T06:30:58.91139+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-14T15:44:29.864819Z","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-14T15:44:29.973073Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.04894","last_updated":"2020-01-06T16:46:34Z","snapshot_observed_at":"2026-08-17T00:23:49.006743Z","submitted_at":"2017-06-14T13:45:52Z","title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time","version":5},"cited_work":{"arxiv_id":"1706.04894","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.04894","snapshot_observed_at":"2026-08-14T15:44:29.973073Z","title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time","venue":"cs.DM","work_id":"689495da-e01e-483f-9ea6-29a9214b686e","year":2017},"citing_paper":{"arxiv_id":"1908.00978","last_updated":"2020-04-01T12:54:35Z","snapshot_observed_at":"2026-08-16T15:54:54.427856Z","submitted_at":"2019-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:44:29.864819Z"},"links":{"cited_paper":"/paper/1706.04894","citing_paper":"/paper/1908.00978"},"observation_digest":"sha256:68bffa7a509c712471000560cbca69babfbaeab91b9ea1d4e0cdf681066a6a75","observation_id":"6f381fe3-b507-4fb6-8ba7-b82e89981c29","resolution":{"observed_at":"2026-08-14T15:44:29.978458Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1706.04894/citation-record","integrity":"/paper/1706.04894/integrity","json":"/paper/1706.04894/citation-record.json","paper":"/paper/1706.04894"},"outbound":[],"paper":{"arxiv_id":"1706.04894","last_updated":"2020-01-06T16:46:34Z","latest_version":5,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-17T00:23:49.006743Z","submitted_at":"2017-06-14T13:45:52Z","title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1706.04894."}