{"as_of":"2026-08-19T16:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96aaa12f6bb6533813b766705ec0ce4fd92fa4ea425745dcf6f16873137a3ee9","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:20:08.345391Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T08:58:13.118014Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.3091","snapshot_observed_at":"2026-08-11T11:20:08.345391Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.15663","last_updated":"2024-12-20T08:23:52Z","snapshot_observed_at":"2026-08-18T08:50:28.918167Z","submitted_at":"2024-12-20T08:23:52Z","title":"Distance Vector Domination","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T11:20:08.345391Z"},"links":{"cited_paper":"/paper/1201.3091","citing_paper":"/paper/2412.15663"},"observation_digest":"sha256:bf8249afcc57857546d1ccf30f9451f84d3401a076d61d804e819b72dfb32a35","observation_id":"247aff70-f529-4a0e-bca4-3a75cc04eb4e","resolution":{"observed_at":"2026-08-11T11:20:08.345391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.3091","snapshot_observed_at":"2026-08-06T19:38:13.427979Z","title":"Using neighborhood diversity to solve hard problems","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.427979Z"},"links":{"cited_paper":"/paper/1201.3091","citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:afb2393a1af08129175690cd04e4ceba0753d943185ce869e36a2807b021f2b9","observation_id":"38c9025f-33ea-4a46-aaa1-c000735792dd","resolution":{"observed_at":"2026-08-06T19:38:13.427979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems","version":2},"cited_work":{"arxiv_id":"1201.3091","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1201.3091","snapshot_observed_at":"2026-07-04T18:00:21.637406Z","title":"17 Michael R","venue":null,"work_id":"d268e4ec-49c9-40ae-a43f-6eb3a0b64b8f","year":null},"citing_paper":{"arxiv_id":"2604.15274","last_updated":"2026-04-30T11:30:44Z","snapshot_observed_at":"2026-08-13T16:15:17.605331Z","submitted_at":"2026-04-16T17:45:29Z","title":"The Parameterized Complexity of Coloring Mixed Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T08:53:12.103977Z"},"links":{"cited_paper":"/paper/1201.3091","citing_paper":"/paper/2604.15274"},"observation_digest":"sha256:2508408234d47266ca25f0e72d29e18d96dbfb60ceed5f328cfb525adaac63d9","observation_id":"2b98d05a-cd7e-492b-94fc-76ea6923d105","resolution":{"observed_at":"2026-07-04T18:00:21.637406Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.3091","snapshot_observed_at":"2026-07-30T14:22:54.041636Z","title":"Using neighborhood diversity to solve hard problems.arXiv preprint arXiv:1201.3091, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-19T00:43:24.652555Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.041636Z"},"links":{"cited_paper":"/paper/1201.3091","citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:77bc341de12bc1e0570e7187303f8e1b8c7309eee1b853bc70034c52034b5cff","observation_id":"38991b7b-960a-46f4-98cf-4b2f50d9e25a","resolution":{"observed_at":"2026-07-30T14:22:54.041636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1201.3091/citation-record","integrity":"/paper/1201.3091/integrity","json":"/paper/1201.3091/citation-record.json","paper":"/paper/1201.3091"},"outbound":[],"paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1201.3091."}