{"as_of":"2026-08-19T10:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb7056862aaf3c7429602a424093b2f093a5d444ef5187aab72fe4470a8fcec7","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:12:56.003168Z","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-25T14:30:54.850002Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.02166","last_updated":"2020-04-20T20:52:11Z","snapshot_observed_at":"2026-08-19T00:39:21.785023Z","submitted_at":"2019-01-08T05:33:56Z","title":"K-Core Minimization: A Game Theoretic Approach","version":2},"cited_work":{"arxiv_id":"1901.02166","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.02166","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"093c126a-9cba-4934-9c4c-b6420c593fac","year":2019},"citing_paper":{"arxiv_id":"1906.12334","last_updated":"2019-06-27T05:31:38Z","snapshot_observed_at":"2026-08-19T02:41:41.105205Z","submitted_at":"2019-06-27T05:31:38Z","title":"K-Core Maximization through Edge Additions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T14:28:17.969591Z"},"links":{"cited_paper":"/paper/1901.02166","citing_paper":"/paper/1906.12334"},"observation_digest":"sha256:7a9e1a4438982e03b460ad491771c88060f47a8ea214962690361deb7582e913","observation_id":"3697caa6-1cd1-4eca-b356-189536f6aba2","resolution":{"observed_at":"2026-05-25T14:30:54.855938Z","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":"1901.02166","last_updated":"2020-04-20T20:52:11Z","snapshot_observed_at":"2026-08-19T00:39:21.785023Z","submitted_at":"2019-01-08T05:33:56Z","title":"K-Core Minimization: A Game Theoretic Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.02166","snapshot_observed_at":"2026-08-14T10:12:56.003168Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-14T10:04:44.747836Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.003168Z"},"links":{"cited_paper":"/paper/1901.02166","citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:6a42a149af575fac2264bc035f497e7711928d0cccb91daea00f165966f527e0","observation_id":"5372a1ad-8f4f-4c98-a556-2223a2984919","resolution":{"observed_at":"2026-08-14T10:12:56.003168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1901.02166/citation-record","integrity":"/paper/1901.02166/integrity","json":"/paper/1901.02166/citation-record.json","paper":"/paper/1901.02166"},"outbound":[],"paper":{"arxiv_id":"1901.02166","last_updated":"2020-04-20T20:52:11Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-19T00:39:21.785023Z","submitted_at":"2019-01-08T05:33:56Z","title":"K-Core Minimization: A Game Theoretic 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-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 2 inbound Pith citation observations for arXiv:1901.02166."}