{"as_of":"2026-08-18T03:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18aa8eeae1e9b3e5cecaac828c67e31b6b4851acae55b7d3b87b11eabbc760e1","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:42:23.771502Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.13377/citation-record","integrity":"/paper/2411.13377/integrity","json":"/paper/2411.13377/citation-record.json","paper":"/paper/2411.13377"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.740107Z","title":"Network decomposition and locality in distributed computation","venue":null,"work_id":"92906454-3ccd-415b-a30b-7eb645728fe4","year":1989},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.529439Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:307cb72832ac34e034904ca59b6989d292c14f473b69e37649495b774b825ac8","observation_id":"ea45d217-b209-4315-bd3b-e2aff42fced3","resolution":{"observed_at":"2026-08-12T16:42:24.748726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.697216Z","title":"Lower bounds for maximal matchings and maximal independent sets","venue":null,"work_id":"2a2cba7d-d133-496d-8ce8-ddbc967bcce2","year":2021},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.543251Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:b098a1ba1f284b5a846e2fc839fb11636de1111c0cf21a61de6a63217e9c4a17","observation_id":"56e125ec-035b-42fd-bf43-f9692586f88c","resolution":{"observed_at":"2026-08-12T16:42:24.711906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:23.552226Z","title":"Distributed Maximal Matching and Maximal Independent Set on Hypergraphs , pages 2632--2676","venue":null,"work_id":null,"year":null},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.552226Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:f5348c55e60928a06f22c924e09a438f807b585ad538d88970715665e1eef52a","observation_id":"16270d89-e2b7-4e0d-9523-d7ea45fa04a8","resolution":{"observed_at":"2026-08-12T16:42:23.552226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.654284Z","title":"Improved distributed lower bounds for mis and bounded (out-) degree dominating sets in trees","venue":null,"work_id":"ca1c7dba-60af-4c3d-85d9-4c4de314187b","year":2021},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.562317Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:3796bc5b9ed42696064f3879b5034c616369b69d1d0026c07f9e0f45c1760757","observation_id":"fd8caa73-7168-42e8-b552-13c0900e19a2","resolution":{"observed_at":"2026-08-12T16:42:24.673213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.598813Z","title":"Distributed lower bounds for ruling sets","venue":null,"work_id":"494a2d93-a669-4783-b8dd-ffd5a7b253ff","year":2022},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.570804Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:fb261f5edacd74649baab800cee31f6ebb4d5007b6c89b56fb7dcedcfa70c37f","observation_id":"ddb269a6-db2e-44b7-b78b-9b0da56d4fd2","resolution":{"observed_at":"2026-08-12T16:42:24.606280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.551138Z","title":"Distributed ( + 1)-coloring in linear (in ) time","venue":null,"work_id":"22e647a0-ce52-4a9d-b538-b9c4ec6c52f8","year":2009},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.578708Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:dc20e1fd28e554f15b2959f36a9b3ac37d4bfbc41e015868aa26840d4e22f13e","observation_id":"da79b1a0-293b-41e0-b92a-2d7d943faadd","resolution":{"observed_at":"2026-08-12T16:42:24.570868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.495468Z","title":"The locality of distributed symmetry breaking","venue":null,"work_id":"d838bea2-ef63-4472-bb99-e522c0526f5d","year":2016},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.589677Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:57b90fc08872287ebe935666bb67fb049638a38f5cdceff9a75f9b67cd9af552","observation_id":"fab80251-1160-494e-b97e-0733fa10af16","resolution":{"observed_at":"2026-08-12T16:42:24.506023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.449178Z","title":"An automatic speedup theorem for distributed problems","venue":null,"work_id":"c40e89cb-8fe8-4171-9e48-6f732cdf520d","year":2019},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.602628Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:4b9e4560c073120bc34712dccfe02ee92256a7b952a06081f70939b306d3a3ca","observation_id":"b7a01b03-12ca-4c52-b977-14999d24d7c8","resolution":{"observed_at":"2026-08-12T16:42:24.457299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.415543Z","title":"A lower bound for the distributed lov \\'a sz local lemma","venue":null,"work_id":"9c71561b-6139-4586-9b3e-d2ccde0afe45","year":2016},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.610354Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:cf69aedcc89c1e7655c6f1007443d6b5b824c6abb1798569e4db9cdc82ab630a","observation_id":"cce78aff-a0d1-490f-b86e-52639557d949","resolution":{"observed_at":"2026-08-12T16:42:24.425874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.380062Z","title":"Problems and results on 3-chromatic hypergraphs and some related questions","venue":null,"work_id":"a49db341-ff19-427e-b29d-2a45361013e9","year":1975},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.620874Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:25a52d5451cabbad5b6e5a14bf06b0e8d65e609e3362611b918073722a3d8e40","observation_id":"444be50c-dd25-4182-a082-3a828af26e12","resolution":{"observed_at":"2026-08-12T16:42:24.388863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.344773Z","title":"An improved distributed algorithm for maximal independent set","venue":null,"work_id":"7dd0f00d-e125-414c-848c-9446ca037be8","year":2016},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.636524Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:4c980c9889839cddb59a3ddd6cfbab0e74c688fa67932eaf8e586fb2fa4722af","observation_id":"3a119e9b-7e1d-465a-81d7-cb2d88492502","resolution":{"observed_at":"2026-08-12T16:42:24.356966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.299726Z","title":"Improved deterministic network decomposition","venue":null,"work_id":"4da81a91-c019-49a5-83f0-4bed99a036e3","year":2021},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.664398Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:32232109e176c80c9eb6318df3cf284002589f077e354b3c1801ceaac0264585","observation_id":"7d47855a-379d-47f4-af9c-530d5fb49569","resolution":{"observed_at":"2026-08-12T16:42:24.314211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1805.03357","last_updated":"2018-05-09T03:04:45Z","snapshot_observed_at":"2026-08-14T19:17:20.834582Z","submitted_at":"2018-05-09T03:04:45Z","title":"Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs","version":1},"cited_work":{"arxiv_id":"1805.03357","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.03357","snapshot_observed_at":"2026-08-12T16:42:24.077153Z","title":"Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs","venue":"cs.DC","work_id":"3a7504c9-c255-491d-9830-cae6bd662e4a","year":2018},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.684544Z"},"links":{"cited_paper":"/paper/1805.03357","citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:ba9b20cb145c0bf9635a0abb5be391eca1616284ce5ecdd4f5ffe3518e965191","observation_id":"62075179-bd00-4149-8922-fecdd9fff850","resolution":{"observed_at":"2026-08-12T16:42:24.089658Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.265025Z","title":"Distributed symmetry breaking in hypergraphs","venue":null,"work_id":"638f976e-9679-4668-a497-933903d5e386","year":2014},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.697425Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:5d9950af9b127ce9a7e2134eee2740a4b71ecd49b849e60b2abbe97cdd09ba66","observation_id":"ba2f8d66-5a92-4b6d-ba24-f6a23474e14e","resolution":{"observed_at":"2026-08-12T16:42:24.273956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.220375Z","title":"Distributive graph algorithms global solutions from local data","venue":null,"work_id":"b2319986-2f37-4924-9f9e-799c6b93b3a7","year":1987},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.707219Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:3f757b1bc4b0b514c5a11f07e31c78d175ab1e7b067214bb0f5f6301e695a045","observation_id":"cc245548-b5bd-4ade-b5e2-b30160b01ebc","resolution":{"observed_at":"2026-08-12T16:42:24.235825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:23.714131Z","title":"Locality in distributed graph algorithms","venue":null,"work_id":null,"year":1992},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.714131Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:88f0dc8995b84875e89394a0be0ca9daff00a0bb6a2b3d368d0e2acfa25094ae","observation_id":"f15aa435-c1ad-4e6c-aa42-9b3670c4185a","resolution":{"observed_at":"2026-08-12T16:42:23.714131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:23.731624Z","title":"Distributed graph coloring made easy","venue":null,"work_id":null,"year":2023},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.731624Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:7779c69ca8e42dbe6cf397e4e6928119a1f2abfb642cc8a37f30fe43e0d506c8","observation_id":"f500e6b9-e88a-4374-8f07-069a1b5e2bca","resolution":{"observed_at":"2026-08-12T16:42:23.731624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.15251","last_updated":"2020-07-30T06:18:23Z","snapshot_observed_at":"2026-08-13T10:48:08.878431Z","submitted_at":"2020-07-30T06:18:23Z","title":"Local Conflict Coloring Revisited: Linial for Lists","version":1},"cited_work":{"arxiv_id":"2007.15251","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.15251","snapshot_observed_at":"2026-08-12T16:42:24.021487Z","title":"Local Conflict Coloring Revisited: Linial for Lists","venue":"cs.DS","work_id":"36b29dbc-b7f5-4666-b388-73d55e705f87","year":2020},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.743023Z"},"links":{"cited_paper":"/paper/2007.15251","citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:d2d294ebcd575c9bb87ae308450e9f459517b4348cf9f6dcac122b20071a58df","observation_id":"1e35b2a2-63ba-4ad2-bc87-d450d817b583","resolution":{"observed_at":"2026-08-12T16:42:24.032189Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.166489Z","title":"Chernoff Bounds , page 61–89","venue":null,"work_id":"867216c7-d728-474f-98b0-06c346413ca6","year":2005},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.753400Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:8a0cfff7620207f683a4314536cf6b90282ad5371b3d6bfa848c384a51d5a8d0","observation_id":"1692cebd-e281-4355-a383-9adb0b6d8396","resolution":{"observed_at":"2026-08-12T16:42:24.173056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:23.765383Z","title":"Moser and Gábor Tardos","venue":null,"work_id":null,"year":2010},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.765383Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:2d040ade6055045373c6ba79b01e4bd85a38342c925fd47d9fb4e85bb662b9f1","observation_id":"8e9c4ac2-314e-44b4-bc37-13ea5515c332","resolution":{"observed_at":"2026-08-12T16:42:23.765383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:42:24.141531Z","title":"Some simple distributed algorithms for sparse networks","venue":null,"work_id":"00b9405e-3f2a-4e18-85ce-1aa0ca27bc2c","year":2001},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-12T16:42:23.771502Z"},"links":{"citing_paper":"/paper/2411.13377"},"observation_digest":"sha256:a4f756d878654d6655c31de7a16cb90839938aaf04db8065ae8aa75e0bf8a44b","observation_id":"79a95a62-2d00-4481-a16d-0399d29d9e9c","resolution":{"observed_at":"2026-08-12T16:42:24.147342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2411.13377","last_updated":"2024-11-20T14:58:47Z","latest_version":1,"primary_category":"cs.DC","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"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":15},"total_outbound_references":22},"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 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2411.13377."}