{"as_of":"2026-08-15T20:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ba70f1450e4bfc372c54457f221ad2fcee5e77a3d6a51b76375f447d5acc8c7","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-15T06:32:42.880941+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-11T15:34:47.377120Z","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-11T03:25:57.474720Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.01540","last_updated":"2021-03-29T14:59:30Z","snapshot_observed_at":"2026-08-10T19:11:07.337058Z","submitted_at":"2021-02-02T15:09:18Z","title":"Targeted Branching for the Maximum Independent Set Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.01540","snapshot_observed_at":"2026-08-11T15:34:47.377120Z","title":"Targeted branching for the maximum independent set problem","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14198","last_updated":"2025-03-03T19:08:43Z","snapshot_observed_at":"2026-08-11T15:27:49.752079Z","submitted_at":"2024-12-14T17:25:59Z","title":"Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T15:34:47.377120Z"},"links":{"cited_paper":"/paper/2102.01540","citing_paper":"/paper/2412.14198"},"observation_digest":"sha256:b5ae435597d44f1a6bb9efcdc9614e8536281002260bf6bc6ed259467ab68280","observation_id":"37809c86-5c66-4e8b-b6bd-7946ada1d917","resolution":{"observed_at":"2026-08-11T15:34:47.377120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01540","last_updated":"2021-03-29T14:59:30Z","snapshot_observed_at":"2026-08-10T19:11:07.337058Z","submitted_at":"2021-02-02T15:09:18Z","title":"Targeted Branching for the Maximum Independent Set Problem","version":2},"cited_work":{"arxiv_id":"2102.01540","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.01540","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hespe, S","venue":null,"work_id":"85b0eb25-0691-4035-b0d7-68a3a441338c","year":2021},"citing_paper":{"arxiv_id":"2605.07952","last_updated":"2026-05-08T16:18:09Z","snapshot_observed_at":"2026-08-12T23:57:07.722947Z","submitted_at":"2026-05-08T16:18:09Z","title":"Reducibility of native weighted graphs on Rydberg Arrays","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-05-11T03:22:17.699114Z"},"links":{"cited_paper":"/paper/2102.01540","citing_paper":"/paper/2605.07952"},"observation_digest":"sha256:a43aa3e51685931b8a945d87fd2edeafdb0f4daa09b8597296f90a7c7baabda8","observation_id":"8d855fd2-cad1-4d66-b794-7fa9e68c746e","resolution":{"observed_at":"2026-05-11T03:25:57.477607Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.01540/citation-record","integrity":"/paper/2102.01540/integrity","json":"/paper/2102.01540/citation-record.json","paper":"/paper/2102.01540"},"outbound":[],"paper":{"arxiv_id":"2102.01540","last_updated":"2021-03-29T14:59:30Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T19:11:07.337058Z","submitted_at":"2021-02-02T15:09:18Z","title":"Targeted Branching for the Maximum Independent Set Problem"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2102.01540."}