{"as_of":"2026-08-09T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:37c90c0b2ea949369c55d0d8dca0bce39d95bcf78f05f2ed20a6c03e6fc52ec2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T12:26:55.810039Z","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-05T12:26:57.610497Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.06799","last_updated":"2018-11-16T13:33:39Z","snapshot_observed_at":"2026-07-06T07:15:10.452888Z","submitted_at":"2018-11-16T13:33:39Z","title":"Progressive Algorithms for Domination and Independence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.06799","snapshot_observed_at":"2026-08-01T07:31:27.288256Z","title":"Progressive algorithms for domination and independence","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21474","last_updated":"2026-07-23T16:16:48Z","snapshot_observed_at":"2026-08-06T08:58:18.332848Z","submitted_at":"2026-07-23T16:16:48Z","title":"Fatness and Flatness","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T07:31:27.288256Z"},"links":{"cited_paper":"/paper/1811.06799","citing_paper":"/paper/2607.21474"},"observation_digest":"sha256:05f6d6729ff2a7f37ef67a5350e3848f8ca27309516b8f9a1d1ae8cbcb56d1ef","observation_id":"d5afd00e-0119-459c-a884-4ea931b2f54c","resolution":{"observed_at":"2026-08-01T07:31:27.288256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06799","last_updated":"2018-11-16T13:33:39Z","snapshot_observed_at":"2026-07-06T07:15:10.452888Z","submitted_at":"2018-11-16T13:33:39Z","title":"Progressive Algorithms for Domination and Independence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.06799","snapshot_observed_at":"2026-08-01T05:04:35.896532Z","title":"Progressive algo- rithms for domination and independence.CoRR, abs/1811.06799, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-06T06:30:55.043891Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.896532Z"},"links":{"cited_paper":"/paper/1811.06799","citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:4aed4a19bd18a8c242a283291b0c0eb53e0a58c2dd0dc0bb473811ece9c3de35","observation_id":"4bb41c9c-9c20-4b38-be38-ed96efa71458","resolution":{"observed_at":"2026-08-01T05:04:35.896532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06799","last_updated":"2018-11-16T13:33:39Z","snapshot_observed_at":"2026-07-06T07:15:10.452888Z","submitted_at":"2018-11-16T13:33:39Z","title":"Progressive Algorithms for Domination and Independence","version":1},"cited_work":{"arxiv_id":"1811.06799","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.06799","snapshot_observed_at":"2026-08-05T12:26:57.610497Z","title":"Progressive Algorithms for Domination and Independence","venue":"cs.LO","work_id":"1e1bb479-d9c2-4c46-a319-fa13fbc9afa2","year":2018},"citing_paper":{"arxiv_id":"2608.03801","last_updated":"2026-08-04T15:15:02Z","snapshot_observed_at":"2026-08-09T13:49:28.813881Z","submitted_at":"2026-08-04T15:15:02Z","title":"Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-05T12:26:55.810039Z"},"links":{"cited_paper":"/paper/1811.06799","citing_paper":"/paper/2608.03801"},"observation_digest":"sha256:5c3c2d394647bfcef27a1759a2526fc4e760d9a3a1f49fc7853fc002d1316c30","observation_id":"6359e191-e7ec-4e1a-a7a2-db59ae595118","resolution":{"observed_at":"2026-08-05T12:26:57.614648Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1811.06799/citation-record","integrity":"/paper/1811.06799/integrity","json":"/paper/1811.06799/citation-record.json","paper":"/paper/1811.06799"},"outbound":[],"paper":{"arxiv_id":"1811.06799","last_updated":"2018-11-16T13:33:39Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-07-06T07:15:10.452888Z","submitted_at":"2018-11-16T13:33:39Z","title":"Progressive Algorithms for Domination and Independence"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1811.06799."}