{"as_of":"2026-08-18T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ef07c31323d0cb75224a8af2400ea53f3527a2d41795db537c45f6a9edfd54d","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-17T06:30:58.91139+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-12T16:42:23.656534Z","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-07-03T13:28:19.213750Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.19516","last_updated":"2024-10-25T12:41:04Z","snapshot_observed_at":"2026-08-16T13:05:57.931512Z","submitted_at":"2024-10-25T12:41:04Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19516","snapshot_observed_at":"2026-08-12T16:42:23.656534Z","title":"Near-optimal deterministic network decomposition and ruling set, and improved mis, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.13377","last_updated":"2024-11-20T14:58:47Z","snapshot_observed_at":"2026-08-12T16:27:06.101585Z","submitted_at":"2024-11-20T14:58:47Z","title":"Distributed weak independent sets in hypergraphs: Upper and lower bounds","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.656534Z"},"links":{"cited_paper":"/paper/2410.19516","citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:b4fa608065cc786f447c5553e0433403c658840733bdaa98e7afc0da1ed5d1ab","observation_id":"10f959d4-7a6f-4f34-91de-a124b66f1e0d","resolution":{"observed_at":"2026-08-12T16:42:23.656534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19516","last_updated":"2024-10-25T12:41:04Z","snapshot_observed_at":"2026-08-16T13:05:57.931512Z","submitted_at":"2024-10-25T12:41:04Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","version":1},"cited_work":{"arxiv_id":"2410.19516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19516","snapshot_observed_at":"2026-07-03T13:28:19.213750Z","title":"GhaffariandC","venue":null,"work_id":"1b7a62ae-d374-4ec4-aa1d-288e289bc229","year":2024},"citing_paper":{"arxiv_id":"2606.11558","last_updated":"2026-07-01T05:58:05Z","snapshot_observed_at":"2026-08-08T04:34:54.901040Z","submitted_at":"2026-06-10T01:35:26Z","title":"Measurable matchings in unbalanced graphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T07:58:19.731645Z"},"links":{"cited_paper":"/paper/2410.19516","citing_paper":"/paper/2606.11558"},"observation_digest":"sha256:5284d969df20b18de565ceee5ec18af6e121b17ae1b8a6f44f615e7e51b34bf0","observation_id":"270ab072-2c23-4a9c-b4e4-6f5739b10300","resolution":{"observed_at":"2026-07-03T13:28:19.215191Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19516","last_updated":"2024-10-25T12:41:04Z","snapshot_observed_at":"2026-08-16T13:05:57.931512Z","submitted_at":"2024-10-25T12:41:04Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","version":1},"cited_work":{"arxiv_id":"2410.19516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19516","snapshot_observed_at":"2026-07-03T13:28:19.213750Z","title":"GhaffariandC","venue":null,"work_id":"1b7a62ae-d374-4ec4-aa1d-288e289bc229","year":2024},"citing_paper":{"arxiv_id":"2606.11558","last_updated":"2026-07-01T05:58:05Z","snapshot_observed_at":"2026-08-08T04:34:54.901040Z","submitted_at":"2026-06-10T01:35:26Z","title":"Measurable matchings in unbalanced graphs","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-02T22:41:26.591332Z"},"links":{"cited_paper":"/paper/2410.19516","citing_paper":"/paper/2606.11558"},"observation_digest":"sha256:904d4674cbc5ee6d87d7c204a54bc9bbc626a16bf38047362fe00dc3b38a207b","observation_id":"a891e4f8-4edc-488d-92a8-ddd7fed93b38","resolution":{"observed_at":"2026-07-02T22:47:25.396625Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19516","last_updated":"2024-10-25T12:41:04Z","snapshot_observed_at":"2026-08-16T13:05:57.931512Z","submitted_at":"2024-10-25T12:41:04Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19516","snapshot_observed_at":"2026-08-12T00:24:40.710836Z","title":"65th IEEE Annual Symposium on Foundations of Computer Science , series =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08296","last_updated":"2026-08-08T19:10:37Z","snapshot_observed_at":"2026-08-16T13:54:03.926492Z","submitted_at":"2026-08-08T19:10:37Z","title":"Truly Work-efficient Parallel Deterministic $(\\Delta+1)$-coloring and Maximal Independent Set","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T00:24:40.710836Z"},"links":{"cited_paper":"/paper/2410.19516","citing_paper":"/paper/2608.08296"},"observation_digest":"sha256:1399943ddd60a3cfb29286688ab79d062f74dc943f2f89eb1ab4cdc7c25c57f9","observation_id":"f9e5227d-a803-408b-a050-a938b76f2ce6","resolution":{"observed_at":"2026-08-12T00:24:40.710836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.19516/citation-record","integrity":"/paper/2410.19516/integrity","json":"/paper/2410.19516/citation-record.json","paper":"/paper/2410.19516"},"outbound":[],"paper":{"arxiv_id":"2410.19516","last_updated":"2024-10-25T12:41:04Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T13:05:57.931512Z","submitted_at":"2024-10-25T12:41:04Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS"},"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 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2410.19516."}