{"as_of":"2026-08-08T09:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:357639a426db91da2f219e719e2704002780627e579796937373dbc2d93276ef","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-08T06:32:00.761636+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-03T22:05:41.909971Z","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:ea68e463dd408bba7587f360042a8aef260befae23d59334ed5c7ffe63f83396","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T22:05:41.909971Z","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:e7bd8f87995b80c95805a163d29d8d36bd5c05037de05bb4eb9799c047e29b77","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-03T22:05:41.909971Z","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:a864a6fe6ce8b7f90e5bea3944433573ee9dfd8145b929389f5efe4dea37ccc0","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-03T22:05:41.909971Z","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:57c1d08dc86293236ed800206654e247adb873ae6e137cb9c705704f46b810ae","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-03T22:05:41.909971Z","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:d24982596864b359d53063ac9f0b5202e5df89ede09fd9a689b539a136b28c3c","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-03T22:05:41.909971Z","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:23152885e966026a1bd52428c08a1705772c133f7862bab67089cd152ff85a33","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-03T22:05:41.909971Z","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:69e88b1bd12c125c2ad2a69e0051b7698a523e0ce25966fea01b4a21ab5873f2","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-03T22:05:41.909971Z","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:4b6ce340db905fada917610a4f930afa4c4034952554b6b64f6b16a290d6827c","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-03T22:05:41.909971Z","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:916ec3a385b4098f1aef62c00868173349bb8e048607a661eb54331f2240cefe","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-03T22:05:41.909971Z","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:fd58f32e2b07665cbe8c08b444197f7756b63f19530ef6820c0d1d747f610ef0","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-03T22:05:41.909971Z","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:1b5e336a5eb0f71df83fb3243cd3308d8f8785f163ba87f92dcacd4b49895163","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-03T22:05:41.909971Z","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:a6b2eaa933dc1aa5874d62cb36456c57e29878789dd6bc6df4b8f599cf936d77","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-03T22:05:41.909971Z","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:468b610539df7983c901cfb916e3142fb676078cef896325f7d4d4e786b0f366","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-03T22:05:41.909971Z","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:01c3c404ed824ed57c87662be4c465d469c6b365045d8c10b4fa78cdc74fd3ab","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-03T22:05:41.909971Z","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:c97f60176f90611e30f04bea9daf91d25da03f70768aae4a257694c60a8218dd","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-03T22:05:41.909971Z","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:3ce77d4a2047e7fac16aba1d7fb011448c45077d6c4feb2d8a2a924836c1fc39","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-03T22:05:41.909971Z","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:2023d3deefbd28217b7830182a70c3743402916dbb444229fce546de2cec985b","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-03T22:05:41.909971Z","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:fd5887245f0e97b79e36382dfb4d22930456cf01bcfad194a7a167661d5258b1","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-03T22:05:41.909971Z","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:d8026ebcab4cbb04d86f977c7e51e56425ac716e98ade40afcec8203dbfc34d3","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-03T22:05:41.909971Z","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:2a8b103ecf9868dd13f5d0c0a13d34c6e6c0b90de5df366e8923f011739cd065","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-03T22:05:41.909971Z","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:d1a29c6a68069219cfb7bee9fcdffbb3900a9a7bffaf57372819b9f9d5756964","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-03T22:05:41.909971Z","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:d1281693d7c6ffff619233cd102d427870489b58776be67293d50e95e5732f77","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-03T22:05:41.909971Z","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:06a3206caf01da73bf5e96e0481377d036c256e2ebe8cd737ed30d68fdb2640d","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-03T22:05:41.909971Z","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:a04f6ee06180d530cf20b90341257a8d94867e907b0231e017eb11ca53713f82","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-03T22:05:41.909971Z","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:7841f6a7e109d8847aa6e4f99352af4e8dc87d60c2c9748801c6dd67386b438e","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-03T22:05:41.909971Z","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:0c5696dcf439c1fca328b3374bfc8f7a59af90db6bc518e2aa3a74bb7a696d86","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-03T22:05:41.909971Z","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:78de35f6c9c3ff549b88912b0a12c8bfbd3322eec5ac7c39401a1a36b08b5b0b","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-03T22:05:41.909971Z","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:7b6b1681cbead8e783949c3ec40edc4cbb72cf94df4f3ecef6052acebd101a7a","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-03T22:05:41.909971Z","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:c402f16b9c6a7e8c7b65ca11d7c005b0ca378973a4ca0560c24953df9c65436a","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-03T22:05:41.909971Z","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:8fc9682ab88aaf193d3610798d7b1a7c2299a750b0e47ace329ccfe95d8c2947","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-04T00:40:41.644799Z","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-03T22:05:41.909971Z","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:89c3427b47b059fc8ef2904e34a403297cba0d1be884e2d39577d14e95604d80","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-03T22:05:41.909971Z","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:cba188138228778b3e7ec309326a5c76c39c372c756425379526ff5fd1d06d16","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-03T22:05:41.909971Z","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:09936d62d8c441405dff15fc947bd61d4f7310a7a58471d567bc6348824de9d5","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-03T22:05:41.909971Z","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:3552c4a99c2f2bbebeaf7e5f9b94d4a4904564f4065905096eaa0ee9169e2575","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-03T22:05:41.909971Z","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:e8970f725153ac5674a785e5056cd207e63b9e678ceb6eb5233c862925d88d94","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-03T22:05:41.909971Z","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:c561e7adc0fafbab99af348113ed8b5e1998331bde025a663e0cf61be2fc5c41","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-03T22:05:41.909971Z","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:592fcedc908eb17e1a7f6b96c27116cb1352f48466f0d6905199705b152a49d0","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-03T22:05:41.909971Z","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:d506d5b4464114c868c392f28259ae76e4f05ca3c4b1bfb18a77a9dceab06349","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-03T22:05:41.909971Z","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:b6942d6a7543ecbce93ebf8f66440a335d4e8dd46db3f4896e3b23be8e75e3be","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-03T22:05:41.909971Z","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:b1e1a9ac0486a0fd2766f5b78b117581658a33c84596bef39a23c08cdd7c683e","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-03T22:05:41.909971Z","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:52e106560f0443160982edbe73e5475e9ab5ebd55e7c4c17c002d7c812cf0fb3","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-03T22:05:41.909971Z","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:92444fc2bedf7316bf713753cbb670de98b952cef0a19fed2846acd2c71a2c1c","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-03T22:05:41.909971Z","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:e5738d7b93b32acf1f3740642b706de52c2094cb363dc90e7c4fe701b0cef6ed","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-03T22:05:41.909971Z","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:6977fd14493483951354e7b82b371eb1060c8eda53ac1e82d32d3917f5683e95","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-03T22:05:41.909971Z","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:4b2d4df55c477dbf04b653a8897cc09f19f533e3d010779975562d7b87e46b16","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-03T22:05:41.909971Z","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:768325cc50506949ada60937bf0b1db01efa03ac9272c53349accfcc7d14aa23","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-07-06T12:17:49.364730Z","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-03T22:05:41.909971Z","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:ad0b6083134cfa3be829861edcefbd311f481e28687b8deb425129c2ecf87995","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-03T22:05:41.909971Z","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:3694f1e1c8961fbcc5419cb2065ef2545bc0371a00149fddd80a6f26cd3198fb","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-03T22:05:41.909971Z","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:6f23f16f2227784de11f2ccc0e52eb4067ef772de3df4241031c81900d0436e2","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-03T22:05:41.909971Z","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:1d49fe8eb344c11184622e734f7f89fec9f7fc6f11c1753ea5102d9392bed4a6","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-03T22:05:41.909971Z","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:8374fbc8eee15809b93556dabec50b07d6bbd0dcc59e3f78baad6440fc0e0ed6","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-03T22:05:41.909971Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 1 inbound Pith citation observation for arXiv:2602.17811."}