{"as_of":"2026-08-10T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00f194a9e4bc7a4b2db42855034ca6f6e548a1d0ad19759d1a2cc5c6be1bf85c","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:27:05.910980Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T16:58:46.321102Z","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-11T07:45:58.874397Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"cited_work":{"arxiv_id":"2602.17811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.17811","snapshot_observed_at":"2026-07-31T02:06:18.608137Z","title":"Faster parallel batch-dynamic algorithms for low out-degree orientation.CoRR, abs/2602.17811v1","venue":null,"work_id":"9176f746-6482-452f-954e-2d54088a6d5d","year":null},"citing_paper":{"arxiv_id":"2604.07515","last_updated":"2026-04-08T18:50:31Z","snapshot_observed_at":"2026-07-06T22:55:46.307881Z","submitted_at":"2026-04-08T18:50:31Z","title":"Parallel Batch-Dynamic Maximal Independent Set","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T16:58:46.321102Z"},"links":{"cited_paper":"/paper/2602.17811","citing_paper":"/paper/2604.07515"},"observation_digest":"sha256:752bc319bb4323e3c3acc1c1ec1c6a7f771dab845cf153cdc8432addcc2f5d27","observation_id":"42ad45f8-5e43-4e21-ad73-79fa418be140","resolution":{"observed_at":"2026-07-31T02:06:18.608137Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.17811/citation-record","integrity":"/paper/2602.17811/integrity","json":"/paper/2602.17811/citation-record.json","paper":"/paper/2602.17811"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:27:00.325236Z","title":"Acar, Daniel Anderson, Guy E","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.325236Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:790bf6fbbf69e0148114c542f21dc0f3e9ae7b6eef9b3d4d59639af0410422a2","observation_id":"4b9209ae-c69b-4067-a8ab-fb74ec99bede","resolution":{"observed_at":"2026-08-02T22:27:00.325236Z","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-02T22:27:00.385891Z","title":"Acar, Daniel Anderson, Guy E","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.385891Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:0dc85794badc824ff703ef1885998f52455ede0af723256e15925486bc9dfa12","observation_id":"dda59dfa-771b-43d2-aab3-a4d1b7e8725c","resolution":{"observed_at":"2026-08-02T22:27:00.385891Z","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-02T22:27:00.426883Z","title":"Parallel minimum cuts ino(mlog 2 n) work and low depth","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.426883Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:2aae1f9b7a0ec0de3fb49c352808a848bcff96395c18562257f39234fd0df689","observation_id":"0022df88-6e32-4fba-8a37-b446fa910be7","resolution":{"observed_at":"2026-08-02T22:27:00.426883Z","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-02T22:27:00.561937Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.561937Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:58a30b79b5ef2991b4c618dca285840bb04d5bfcadde3d586626835cb9f7462d","observation_id":"0f670d48-e96c-4910-900c-2f59cf8f6c6e","resolution":{"observed_at":"2026-08-02T22:27:00.561937Z","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-02T22:27:00.674549Z","title":"Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.674549Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:236eb860700e78308c70876fa9a68a943852c9e990f1b01505278b6568741eab","observation_id":"57d2ba13-b535-4f4e-bb34-538afb1bc7eb","resolution":{"observed_at":"2026-08-02T22:27:00.674549Z","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-02T22:27:00.747450Z","title":"A simple greedy algorithm for dynamic graph orientation.Algorithmica, 82(2):245–259, February 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.747450Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:109578718a7c4337d4ee5163c0328dcc0183fbfbe1a5e8db9c5ff818b7249275","observation_id":"20ac1904-03d9-4c2f-88dd-2f998e78a91e","resolution":{"observed_at":"2026-08-02T22:27:00.747450Z","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-02T22:27:00.877737Z","title":"Fully dynamic matching in bipartite graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:00.877737Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:7bdbdfc3214e3c977984afc101911823816c956956e9605de4e6ba1c1e09bc0d","observation_id":"437d9be3-46f9-4329-a5a0-90f100f701b6","resolution":{"observed_at":"2026-08-02T22:27:00.877737Z","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-02T22:27:01.043392Z","title":"Faster fully dynamic matchings with small approximation ratios","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.043392Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:873e00724758c9440aede63ef5f352dcede48f92fafa1b5ab7105127763eeff8","observation_id":"4cae6e3c-7b3d-4d58-a4e7-cf7fcf3013f1","resolution":{"observed_at":"2026-08-02T22:27:01.043392Z","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-02T22:27:01.172921Z","title":"Blelloch and Andrew C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.172921Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:ac222b2dd1271f918eb727b7925e1e888738b2cfa2b9e4852d95573358d39942","observation_id":"8ab3f9a1-3333-4d31-881e-59aef7e93da6","resolution":{"observed_at":"2026-08-02T22:27:01.172921Z","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-02T22:27:01.318051Z","title":"Blelloch, Jeremy T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.318051Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:381a905ef30daa5553c5340a5ad5b42d5b8319ea868402fa4ab3a7a17a66a9dd","observation_id":"81661230-ebe1-44d9-9aa8-5f96555dcb4b","resolution":{"observed_at":"2026-08-02T22:27:01.318051Z","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-02T22:27:01.472996Z","title":"Blelloch, Jeremy T Fineman, and Julian Shun","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.472996Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:2e1fca47533e8c47b8bbca970bb378adf9244a5b1abe35902985ce3bcfa6546d","observation_id":"b8f25a4d-ebc7-4f80-b796-75a92cc9d601","resolution":{"observed_at":"2026-08-02T22:27:01.472996Z","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-02T22:27:01.569717Z","title":"Blumofe and Charles E","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.569717Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:90c7cbba34c35fbb095fbd4750537b3e36a225491e4846c79fe956ab1d437e8b","observation_id":"7b8604fd-fce9-4602-82e2-d88a37304e7b","resolution":{"observed_at":"2026-08-02T22:27:01.569717Z","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-02T22:27:01.710637Z","title":"Dynamic representations of sparse graphs","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.710637Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:24e1ee9228fbe71d0becf61970532e5cbab582313e3fdd238ef2cba71a6cf02c","observation_id":"d40f5abb-02b1-4882-a100-90c035004453","resolution":{"observed_at":"2026-08-02T22:27:01.710637Z","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-02T22:27:01.860146Z","title":"An efficient functional implementation of fifo queues.Information Processing Letters, 14(5):205–206, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.860146Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:772f8d4e5f53c82db904c3b01f1701a6b9a6cb5200556873f2d5bbef8c82be13","observation_id":"5d83097f-af2a-4fbd-a2be-bc7342db74b1","resolution":{"observed_at":"2026-08-02T22:27:01.860146Z","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-02T22:27:01.906097Z","title":"Adaptive out-orientations with applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:01.906097Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:b65368a441c1d9d1d71255dc6557c11d3ba74010b92b1df00a28267ab8077188","observation_id":"ca9c669b-c0cc-4abc-9245-bba967339cc7","resolution":{"observed_at":"2026-08-02T22:27:01.906097Z","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-02T22:27:02.010933Z","title":"Fully-dynamicα+ 2 arboricity decompo- sitions and implicit colouring","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.010933Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:91874fd4d65f87926b73974b7acd683c02302a3aa0b097516a21db348b84686a","observation_id":"8963ee81-83d9-45c0-ae16-2448bf6ebace","resolution":{"observed_at":"2026-08-02T22:27:02.010933Z","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-02T22:27:02.111484Z","title":"Cormen, Charles E","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.111484Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:1058bab078160e75c29b7ce7ed4be5c321f6f24d03c3659657c3adb5d964b5cf","observation_id":"05fab069-fdda-4f62-8cda-52d86e38dd23","resolution":{"observed_at":"2026-08-02T22:27:02.111484Z","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-02T22:27:02.211176Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.211176Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:c606346c89ab363d001cbbf7e7eb708c91267174782e5b6b2361bc3b283d7e0f","observation_id":"75f4c30b-e84f-4028-b1e1-3ee7c023b573","resolution":{"observed_at":"2026-08-02T22:27:02.211176Z","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-02T22:27:02.340430Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.340430Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:835c713ccd632cdf76bb2c35668fc1d3eed7615c22f49a2bf38541f4ae1b950b","observation_id":"8099bdbd-3ffa-4229-9bc1-9d6a9b570c31","resolution":{"observed_at":"2026-08-02T22:27:02.340430Z","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-02T22:27:02.450060Z","title":"Parallel batch-dynamic graphs: Algorithms and lower bounds","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.450060Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:75c3ccdd362eb870a08fa1e19b09a72fad3c5c35cf566b63649cfed57f57d5d1","observation_id":"986682a7-0b82-44f5-aaec-2e62df870496","resolution":{"observed_at":"2026-08-02T22:27:02.450060Z","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-02T22:27:02.564737Z","title":"Tight analysis of parallel randomized greedy mis","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.564737Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:e4906d84ce9c9a03208175354de4c65701fc8e2c2e093936c4d35d82535bc80c","observation_id":"6b42c425-2e01-45f2-8ddb-a4d48de21551","resolution":{"observed_at":"2026-08-02T22:27:02.564737Z","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-02T22:27:02.675245Z","title":"Nearly work-efficient parallel dfs in undi- rected graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.675245Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:a5433240bf9cf4865c4ea0bcbe3e62194a70ea2a87d531d6206d10b3199465eb","observation_id":"133bece6-43d3-4415-a586-cd191fbee263","resolution":{"observed_at":"2026-08-02T22:27:02.675245Z","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-02T22:27:02.806282Z","title":"Parallel batch-dynamic coreness decomposition with worst- case guarantees","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.806282Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:edf9d3d7183891bd3b162f7d1666852eaf3134886e4759ce8f80c832d78424be","observation_id":"1a661b55-053c-4d18-b21a-7eb8086c5290","resolution":{"observed_at":"2026-08-02T22:27:02.806282Z","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-02T22:27:02.903482Z","title":"Parallel dynamic maximal matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.903482Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:7b0f692f0af2f60975af889e389463bd596b5a0265bc3e0469f599d69427b28c","observation_id":"ac758b77-c9e0-4577-b26f-57a0728a41a2","resolution":{"observed_at":"2026-08-02T22:27:02.903482Z","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-02T22:27:02.996876Z","title":"Optimal parallel sorting with comparison errors","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:02.996876Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:3da318f472c3d2601a91c1764fe1622b90415dfb05b970e262afadf1c1a30ac3","observation_id":"d973210f-03c0-4782-b2d8-8dfabd883e57","resolution":{"observed_at":"2026-08-02T22:27:02.996876Z","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-02T22:27:03.119683Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.119683Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:a11e85b99c4f269d7c02517667b956298e7774a68389a96f6c314110ce1ba9f0","observation_id":"a5978c66-fe9b-489f-a9e1-5fdedd47f82b","resolution":{"observed_at":"2026-08-02T22:27:03.119683Z","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-02T22:27:03.214852Z","title":"Analysis of work-stealing and parallel cache com- plexity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.214852Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:99a07af5dcf58a594b84f74d280d139115321927f918f4601023a8618e93bb59","observation_id":"4db94e43-99a3-4203-b97a-af8632cc02af","resolution":{"observed_at":"2026-08-02T22:27:03.214852Z","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-02T22:27:03.351263Z","title":"A top-down parallel semisort","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.351263Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:e5e5c52445cec6b1e24b7d787cf72d72f4a07a7ed75ba294a986755195382c35","observation_id":"c3a26f04-e56d-461b-a1e7-2f294ccdf102","resolution":{"observed_at":"2026-08-02T22:27:03.351263Z","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-02T22:27:03.473442Z","title":"Orienting dynamic graphs, with applications to maximal matchings and adjacency queries","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.473442Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:80813e1a7ae0ab1d40c7eb888fd13bab071c36f1b2c97356f45ed7c83a92469b","observation_id":"492e1aac-9e11-4bf9-bad7-0c788c33b2eb","resolution":{"observed_at":"2026-08-02T22:27:03.473442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","snapshot_observed_at":"2026-08-08T19:04:12.250584Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10142","snapshot_observed_at":"2026-08-02T22:27:03.567174Z","title":"Explicit and implicit dynamic col- oring of graphs with bounded arboricity.arXiv preprint arXiv:2002.10142, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.567174Z"},"links":{"cited_paper":"/paper/2002.10142","citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:9e7c59162416dc6662baa17dc6b538d53b7a1e0e2c1440f0b3a1e487544d8fde","observation_id":"80f39782-b63f-4fbd-9844-ac9e00046e94","resolution":{"observed_at":"2026-08-02T22:27:03.567174Z","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-02T22:27:03.651506Z","title":"Real-time queue operations in pure lisp.Information Processing Letters, 13(2):50–54, 1981","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.651506Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:a1e699066ba5f3d7bc0ff46af1d92142edbc2ce87de806c5241decfc3b6f596d","observation_id":"2791177e-3c01-41e1-9b25-c5dd1db37f43","resolution":{"observed_at":"2026-08-02T22:27:03.651506Z","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-02T22:27:03.778747Z","title":"JaJa.Introduction to Parallel Algorithms","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.778747Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:4520fd9e2dfacaff9247b53b315e46aa57f1da297ec1c52ce015a41ee023facb","observation_id":"a47243a2-ffee-493e-a915-ce4b450dedac","resolution":{"observed_at":"2026-08-02T22:27:03.778747Z","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-02T22:27:03.885264Z","title":"Addison Wesley Longman Publishing Co., Inc., USA, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.885264Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:eb646178415f3abbe0bf7fab3b4fcd69c0b856f8b0487f7c683c6185100bd904","observation_id":"f363fc9e-9462-43bc-8df5-07410ef9609e","resolution":{"observed_at":"2026-08-02T22:27:03.885264Z","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-02T22:27:04.016750Z","title":"Karp and Vijaya Ramachandran","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.016750Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:8af14b3867e7b473109da6164cc98da2af521c7a0f64bc89a32ef2711aaf689a","observation_id":"c1d1d445-c549-422c-9a8c-bf0963e9cc7f","resolution":{"observed_at":"2026-08-02T22:27:04.016750Z","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-02T22:27:04.151582Z","title":"Orienting fully dynamic graphs with worst-case time bounds","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.151582Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:b64ab45f24f094d3336e701c6e3f3b0c8dcc2a9434af8cdade00ea043f4ddf83","observation_id":"871311ac-0e23-4603-98f6-8e58c507b8e2","resolution":{"observed_at":"2026-08-02T22:27:04.151582Z","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-02T22:27:04.242679Z","title":"Adjacency queries in dynamic sparse graphs.Information Processing Letters, 102(5):191–195, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.242679Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:fa48b9e651aae27920789accac9815c31e05e8923454ee3cd26027940ab27562","observation_id":"204879c9-59ed-47c6-ba4b-dba73d002c25","resolution":{"observed_at":"2026-08-02T22:27:04.242679Z","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-02T22:27:04.351540Z","title":"Parallel batch- dynamic algorithms for k-core decomposition and related graph problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.351540Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:15a7b930e7b86545ac6e7a7bb0be5bd6780d51a4d3adfa5c741e801b79153088","observation_id":"6202b58b-4748-4249-bfd5-e6954fd6e50b","resolution":{"observed_at":"2026-08-02T22:27:04.351540Z","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-02T22:27:04.459186Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.459186Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:c39d005da9c0c94efb4e0fd48123f9d6e42f8afe14ffac49d342d5f7195d3c2e","observation_id":"f52822a4-73a5-43c7-91cb-5510418ac6c7","resolution":{"observed_at":"2026-08-02T22:27:04.459186Z","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-02T22:27:04.570313Z","title":null,"venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.570313Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:7dc337c467d66d85e7dc1bdd5e3b1c97070e4f53dcd7d8d50397d487c3846605","observation_id":"dc39ac27-cda2-46e1-968b-7889cb8f9cfc","resolution":{"observed_at":"2026-08-02T22:27:04.570313Z","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-02T22:27:04.672050Z","title":"Simple deterministic algorithms for fully dynamic maximal matching.ACM Transactions on Algorithms (TALG), 12(1):1–15, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.672050Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:107a517ceef9f4275d3c7503016ebafc87329deb02051df001edaaeac088b593","observation_id":"c44d28e8-eea9-4a37-b012-85a7e0210c47","resolution":{"observed_at":"2026-08-02T22:27:04.672050Z","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-02T22:27:04.792386Z","title":"Cambridge University Press, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.792386Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:2552178bf5d1132a0cf0fc49135d0dc5eb146c4c412e7c7abfd1475abcad122a","observation_id":"324da3e7-45d3-499c-bc2a-f14d008c4d13","resolution":{"observed_at":"2026-08-02T22:27:04.792386Z","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-02T22:27:04.873239Z","title":"Fully dynamic mis in uniformly sparse graphs.ACM Transactions on Algorithms (TALG), 16(2):1–19, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.873239Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:b23ebca082e2bd1ae27fd3f2f251bdb51771be284793505daef8a7841a8aa95a","observation_id":"8a2fea28-035e-42f7-9142-688d6efe4aa5","resolution":{"observed_at":"2026-08-02T22:27:04.873239Z","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-02T22:27:04.970241Z","title":"Dynamic (1 +ϵ)-approximate matchings: A density-sensitive approach","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:04.970241Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:3791d99538ecd283d928117738a121600587baa6dd3e758ff44204b861d8b903","observation_id":"7434d90e-974a-4174-8a1d-822498d1d493","resolution":{"observed_at":"2026-08-02T22:27:04.970241Z","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-02T22:27:05.092776Z","title":"Near-optimal fully dynamic densest subgraph","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.092776Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:6fc450e409fce22e8dfafd12ffba8d78c29c2903077f17021909b2274eca6ede","observation_id":"5ff4ed1d-967e-4a9a-88ce-cd04782ed6f4","resolution":{"observed_at":"2026-08-02T22:27:05.092776Z","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-02T22:27:05.216705Z","title":"A parallel batch-dynamic data structure for the closest pair problem.CoRR, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.216705Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:22fd34aa8fb4033f790efedb1fdc7a4618be1b021911df2d121caf380333a99d","observation_id":"ca08224d-e2b8-4b54-a062-30afb45ca530","resolution":{"observed_at":"2026-08-02T22:27:05.216705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.06188","last_updated":"2021-12-12T09:08:41Z","snapshot_observed_at":"2026-08-10T06:31:43.172136Z","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.06188","snapshot_observed_at":"2026-08-02T22:27:05.369258Z","title":"Parallel batch-dynamic k-d trees.arXiv preprint arXiv:2112.06188, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.369258Z"},"links":{"cited_paper":"/paper/2112.06188","citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:cfcf4c3100167a15a4edc9fa190fac676f36bae554f253adead3dc7fb123a747","observation_id":"f93b6354-5e35-42ad-825e-68eef6af8ee2","resolution":{"observed_at":"2026-08-02T22:27:05.369258Z","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-02T22:27:05.500897Z","title":"Optimal batch-dynamic kd-trees for processing-in-memory with applications","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.500897Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:aba9aa2dc6232fce1a1faf413806464f5133ba5bbabcdddfe7a5b373d1b2411d","observation_id":"f75b977d-5690-41de-a7f1-2bbe97ba3281","resolution":{"observed_at":"2026-08-02T22:27:05.500897Z","resolver_source":null,"status":"malformed_identifier"},"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-02T22:27:05.664316Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.664316Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:238f7230f21806e8c853e92a8257828d5f1874c5ca4ede3b997d6270455bd274","observation_id":"de199499-7338-461d-9561-8aabf64035fb","resolution":{"observed_at":"2026-08-02T22:27:05.664316Z","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-02T22:27:05.793159Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.793159Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:6bcb071d93e3f8d9c12488c2dea99e0185c77eb20593b5be7d80b6fa8ee12b1b","observation_id":"6db30884-456f-4155-8140-d555230b6105","resolution":{"observed_at":"2026-08-02T22:27:05.793159Z","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-02T22:27:05.910980Z","title":"replacement","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.910980Z"},"links":{"citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:0bf1bdd206a3194ef6f1cfe16874fe8031f1d4d4f3dafa3ba23baa6dff73e95a","observation_id":"fdde0a05-1013-4099-bf14-e5e12e5f8f22","resolution":{"observed_at":"2026-08-02T22:27:05.910980Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":50},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 1 inbound Pith citation observation for arXiv:2602.17811."}