Pith. sign in

Paper Citation Record · LEDGER

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2602.17811 v2

Coverage vector

measured 50 of 50 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T22:27:05.910980Z

measured 51 of 51 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-10T16:58:46.321102Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T07:45:58.874397Z

Reference resolution

50 of 50 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved48
  • parse uncertain0
  • malformed identifier2
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4b9209ae-c69b-4067-a8ab-fb74ec99bede · outbound

This paper cites Acar, Daniel Anderson, Guy E.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Acar, Daniel Anderson, Guy E

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.325236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.325236Z digest=sha256:e7bd8f87995b80c95805a163d29d8d36bd5c05037de05bb4eb9799c047e29b77

Observation dda59dfa-771b-43d2-aab3-a4d1b7e8725c · outbound

This paper cites Acar, Daniel Anderson, Guy E.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Acar, Daniel Anderson, Guy E

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.385891Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.385891Z digest=sha256:a864a6fe6ce8b7f90e5bea3944433573ee9dfd8145b929389f5efe4dea37ccc0

Observation 0022df88-6e32-4fba-8a37-b446fa910be7 · outbound

This paper cites Parallel minimum cuts ino(mlog 2 n) work and low depth.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Parallel minimum cuts ino(mlog 2 n) work and low depth

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.426883Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.426883Z digest=sha256:57c1d08dc86293236ed800206654e247adb873ae6e137cb9c705704f46b810ae

Observation 0f670d48-e96c-4910-900c-2f59cf8f6c6e · outbound

This paper cites an unresolved cited work.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Unresolved cited work

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.561937Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.561937Z digest=sha256:d24982596864b359d53063ac9f0b5202e5df89ede09fd9a689b539a136b28c3c

Observation 57d2ba13-b535-4f4e-bb34-538afb1bc7eb · outbound

This paper cites Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.674549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.674549Z digest=sha256:23152885e966026a1bd52428c08a1705772c133f7862bab67089cd152ff85a33

Observation 20ac1904-03d9-4c2f-88dd-2f998e78a91e · outbound

This paper cites A simple greedy algorithm for dynamic graph orientation.Algorithmica, 82(2):245–259, February 2020.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation A simple greedy algorithm for dynamic graph orientation.Algorithmica, 82(2):245–259, February 2020

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.747450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.747450Z digest=sha256:69e88b1bd12c125c2ad2a69e0051b7698a523e0ce25966fea01b4a21ab5873f2

Observation 437d9be3-46f9-4329-a5a0-90f100f701b6 · outbound

This paper cites Fully dynamic matching in bipartite graphs.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Fully dynamic matching in bipartite graphs

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:00.877737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:00.877737Z digest=sha256:4b6ce340db905fada917610a4f930afa4c4034952554b6b64f6b16a290d6827c

Observation 4cae6e3c-7b3d-4d58-a4e7-cf7fcf3013f1 · outbound

This paper cites Faster fully dynamic matchings with small approximation ratios.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Faster fully dynamic matchings with small approximation ratios

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.043392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.043392Z digest=sha256:916ec3a385b4098f1aef62c00868173349bb8e048607a661eb54331f2240cefe

Observation 8ab3f9a1-3333-4d31-881e-59aef7e93da6 · outbound

This paper cites Blelloch and Andrew C.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Blelloch and Andrew C

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.172921Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.172921Z digest=sha256:fd58f32e2b07665cbe8c08b444197f7756b63f19530ef6820c0d1d747f610ef0

Observation 81661230-ebe1-44d9-9aa8-5f96555dcb4b · outbound

This paper cites Blelloch, Jeremy T.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Blelloch, Jeremy T

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.318051Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.318051Z digest=sha256:1b5e336a5eb0f71df83fb3243cd3308d8f8785f163ba87f92dcacd4b49895163

Observation b8f25a4d-ebc7-4f80-b796-75a92cc9d601 · outbound

This paper cites Blelloch, Jeremy T Fineman, and Julian Shun.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Blelloch, Jeremy T Fineman, and Julian Shun

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.472996Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.472996Z digest=sha256:a6b2eaa933dc1aa5874d62cb36456c57e29878789dd6bc6df4b8f599cf936d77

Observation 7b8604fd-fce9-4602-82e2-d88a37304e7b · outbound

This paper cites Blumofe and Charles E.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Blumofe and Charles E

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.569717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.569717Z digest=sha256:468b610539df7983c901cfb916e3142fb676078cef896325f7d4d4e786b0f366

Observation d40f5abb-02b1-4882-a100-90c035004453 · outbound

This paper cites Dynamic representations of sparse graphs.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Dynamic representations of sparse graphs

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.710637Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.710637Z digest=sha256:01c3c404ed824ed57c87662be4c465d469c6b365045d8c10b4fa78cdc74fd3ab

Observation 5d83097f-af2a-4fbd-a2be-bc7342db74b1 · outbound

This paper cites An efficient functional implementation of fifo queues.Information Processing Letters, 14(5):205–206, 1982.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation An efficient functional implementation of fifo queues.Information Processing Letters, 14(5):205–206, 1982

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.860146Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.860146Z digest=sha256:c97f60176f90611e30f04bea9daf91d25da03f70768aae4a257694c60a8218dd

Observation ca9c669b-c0cc-4abc-9245-bba967339cc7 · outbound

This paper cites Adaptive out-orientations with applications.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Adaptive out-orientations with applications

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:01.906097Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:01.906097Z digest=sha256:3ce77d4a2047e7fac16aba1d7fb011448c45077d6c4feb2d8a2a924836c1fc39

Observation 8963ee81-83d9-45c0-ae16-2448bf6ebace · outbound

This paper cites Fully-dynamicα+ 2 arboricity decompo- sitions and implicit colouring.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Fully-dynamicα+ 2 arboricity decompo- sitions and implicit colouring

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.010933Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.010933Z digest=sha256:2023d3deefbd28217b7830182a70c3743402916dbb444229fce546de2cec985b

Observation 05fab069-fdda-4f62-8cda-52d86e38dd23 · outbound

This paper cites Cormen, Charles E.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Cormen, Charles E

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.111484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.111484Z digest=sha256:fd5887245f0e97b79e36382dfb4d22930456cf01bcfad194a7a167661d5258b1

Observation 75f4c30b-e84f-4028-b1e1-3ee7c023b573 · outbound

This paper cites Blelloch, and Julian Shun.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Blelloch, and Julian Shun

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.211176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.211176Z digest=sha256:d8026ebcab4cbb04d86f977c7e51e56425ac716e98ade40afcec8203dbfc34d3

Observation 8099bdbd-3ffa-4229-9bc1-9d6a9b570c31 · outbound

This paper cites Blelloch, and Julian Shun.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Blelloch, and Julian Shun

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.340430Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.340430Z digest=sha256:2a8b103ecf9868dd13f5d0c0a13d34c6e6c0b90de5df366e8923f011739cd065

Observation 986682a7-0b82-44f5-aaec-2e62df870496 · outbound

This paper cites Parallel batch-dynamic graphs: Algorithms and lower bounds.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Parallel batch-dynamic graphs: Algorithms and lower bounds

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.450060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.450060Z digest=sha256:d1a29c6a68069219cfb7bee9fcdffbb3900a9a7bffaf57372819b9f9d5756964

Observation 6b42c425-2e01-45f2-8ddb-a4d48de21551 · outbound

This paper cites Tight analysis of parallel randomized greedy mis.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Tight analysis of parallel randomized greedy mis

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.564737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.564737Z digest=sha256:d1281693d7c6ffff619233cd102d427870489b58776be67293d50e95e5732f77

Observation 133bece6-43d3-4415-a586-cd191fbee263 · outbound

This paper cites Nearly work-efficient parallel dfs in undi- rected graphs.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Nearly work-efficient parallel dfs in undi- rected graphs

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.675245Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.675245Z digest=sha256:06a3206caf01da73bf5e96e0481377d036c256e2ebe8cd737ed30d68fdb2640d

Observation 1a661b55-053c-4d18-b21a-7eb8086c5290 · outbound

This paper cites Parallel batch-dynamic coreness decomposition with worst- case guarantees.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Parallel batch-dynamic coreness decomposition with worst- case guarantees

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.806282Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.806282Z digest=sha256:a04f6ee06180d530cf20b90341257a8d94867e907b0231e017eb11ca53713f82

Observation ac758b77-c9e0-4577-b26f-57a0728a41a2 · outbound

This paper cites Parallel dynamic maximal matching.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Parallel dynamic maximal matching

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.903482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.903482Z digest=sha256:7841f6a7e109d8847aa6e4f99352af4e8dc87d60c2c9748801c6dd67386b438e

Observation d973210f-03c0-4782-b2d8-8dfabd883e57 · outbound

This paper cites Optimal parallel sorting with comparison errors.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Optimal parallel sorting with comparison errors

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:02.996876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:02.996876Z digest=sha256:0c5696dcf439c1fca328b3374bfc8f7a59af90db6bc518e2aa3a74bb7a696d86

Observation a5978c66-fe9b-489f-a9e1-5fdedd47f82b · outbound

This paper cites an unresolved cited work.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Unresolved cited work

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.119683Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.119683Z digest=sha256:78de35f6c9c3ff549b88912b0a12c8bfbd3322eec5ac7c39401a1a36b08b5b0b

Observation 4db94e43-99a3-4203-b97a-af8632cc02af · outbound

This paper cites Analysis of work-stealing and parallel cache com- plexity.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Analysis of work-stealing and parallel cache com- plexity

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.214852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.214852Z digest=sha256:7b6b1681cbead8e783949c3ec40edc4cbb72cf94df4f3ecef6052acebd101a7a

Observation c3a26f04-e56d-461b-a1e7-2f294ccdf102 · outbound

This paper cites A top-down parallel semisort.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation A top-down parallel semisort

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.351263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.351263Z digest=sha256:c402f16b9c6a7e8c7b65ca11d7c005b0ca378973a4ca0560c24953df9c65436a

Observation 492e1aac-9e11-4bf9-bad7-0c788c33b2eb · outbound

This paper cites Orienting dynamic graphs, with applications to maximal matchings and adjacency queries.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Orienting dynamic graphs, with applications to maximal matchings and adjacency queries

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.473442Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.473442Z digest=sha256:8fc9682ab88aaf193d3610798d7b1a7c2299a750b0e47ace329ccfe95d8c2947

Observation 80f39782-b63f-4fbd-9844-ac9e00046e94 · outbound

This paper cites Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.567174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.567174Z digest=sha256:89c3427b47b059fc8ef2904e34a403297cba0d1be884e2d39577d14e95604d80

Observation 2791177e-3c01-41e1-9b25-c5dd1db37f43 · outbound

This paper cites Real-time queue operations in pure lisp.Information Processing Letters, 13(2):50–54, 1981.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Real-time queue operations in pure lisp.Information Processing Letters, 13(2):50–54, 1981

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.651506Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.651506Z digest=sha256:cba188138228778b3e7ec309326a5c76c39c372c756425379526ff5fd1d06d16

Observation a47243a2-ffee-493e-a915-ce4b450dedac · outbound

This paper cites JaJa.Introduction to Parallel Algorithms.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation JaJa.Introduction to Parallel Algorithms

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.778747Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.778747Z digest=sha256:09936d62d8c441405dff15fc947bd61d4f7310a7a58471d567bc6348824de9d5

Observation f363fc9e-9462-43bc-8df5-07410ef9609e · outbound

This paper cites Addison Wesley Longman Publishing Co., Inc., USA, 1992.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Addison Wesley Longman Publishing Co., Inc., USA, 1992

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.885264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.885264Z digest=sha256:3552c4a99c2f2bbebeaf7e5f9b94d4a4904564f4065905096eaa0ee9169e2575

Observation c1d1d445-c549-422c-9a8c-bf0963e9cc7f · outbound

This paper cites Karp and Vijaya Ramachandran.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Karp and Vijaya Ramachandran

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.016750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.016750Z digest=sha256:e8970f725153ac5674a785e5056cd207e63b9e678ceb6eb5233c862925d88d94

Observation 871311ac-0e23-4603-98f6-8e58c507b8e2 · outbound

This paper cites Orienting fully dynamic graphs with worst-case time bounds.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Orienting fully dynamic graphs with worst-case time bounds

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.151582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.151582Z digest=sha256:c561e7adc0fafbab99af348113ed8b5e1998331bde025a663e0cf61be2fc5c41

Observation 204879c9-59ed-47c6-ba4b-dba73d002c25 · outbound

This paper cites Adjacency queries in dynamic sparse graphs.Information Processing Letters, 102(5):191–195, 2007.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Adjacency queries in dynamic sparse graphs.Information Processing Letters, 102(5):191–195, 2007

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.242679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.242679Z digest=sha256:592fcedc908eb17e1a7f6b96c27116cb1352f48466f0d6905199705b152a49d0

Observation 6202b58b-4748-4249-bfd5-e6954fd6e50b · outbound

This paper cites Parallel batch- dynamic algorithms for k-core decomposition and related graph problems.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Parallel batch- dynamic algorithms for k-core decomposition and related graph problems

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.351540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.351540Z digest=sha256:d506d5b4464114c868c392f28259ae76e4f05ca3c4b1bfb18a77a9dceab06349

Observation f52822a4-73a5-43c7-91cb-5510418ac6c7 · outbound

This paper cites an unresolved cited work.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Unresolved cited work

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.459186Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.459186Z digest=sha256:b6942d6a7543ecbce93ebf8f66440a335d4e8dd46db3f4896e3b23be8e75e3be

Observation dc39ac27-cda2-46e1-968b-7889cb8f9cfc · outbound

This paper cites an unresolved cited work.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Unresolved cited work

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.570313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.570313Z digest=sha256:b1e1a9ac0486a0fd2766f5b78b117581658a33c84596bef39a23c08cdd7c683e

Observation c44d28e8-eea9-4a37-b012-85a7e0210c47 · outbound

This paper cites Simple deterministic algorithms for fully dynamic maximal matching.ACM Transactions on Algorithms (TALG), 12(1):1–15, 2015.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Simple deterministic algorithms for fully dynamic maximal matching.ACM Transactions on Algorithms (TALG), 12(1):1–15, 2015

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.672050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.672050Z digest=sha256:52e106560f0443160982edbe73e5475e9ab5ebd55e7c4c17c002d7c812cf0fb3

Observation 324da3e7-45d3-499c-bc2a-f14d008c4d13 · outbound

This paper cites Cambridge University Press, 1999.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Cambridge University Press, 1999

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.792386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.792386Z digest=sha256:92444fc2bedf7316bf713753cbb670de98b952cef0a19fed2846acd2c71a2c1c

Observation 8a2fea28-035e-42f7-9142-688d6efe4aa5 · outbound

This paper cites Fully dynamic mis in uniformly sparse graphs.ACM Transactions on Algorithms (TALG), 16(2):1–19, 2020.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Fully dynamic mis in uniformly sparse graphs.ACM Transactions on Algorithms (TALG), 16(2):1–19, 2020

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.873239Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.873239Z digest=sha256:e5738d7b93b32acf1f3740642b706de52c2094cb363dc90e7c4fe701b0cef6ed

Observation 7434d90e-974a-4174-8a1d-822498d1d493 · outbound

This paper cites Dynamic (1 +ϵ)-approximate matchings: A density-sensitive approach.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Dynamic (1 +ϵ)-approximate matchings: A density-sensitive approach

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:04.970241Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:04.970241Z digest=sha256:6977fd14493483951354e7b82b371eb1060c8eda53ac1e82d32d3917f5683e95

Observation 5ff4ed1d-967e-4a9a-88ce-cd04782ed6f4 · outbound

This paper cites Near-optimal fully dynamic densest subgraph.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Near-optimal fully dynamic densest subgraph

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:05.092776Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.092776Z digest=sha256:4b2d4df55c477dbf04b653a8897cc09f19f533e3d010779975562d7b87e46b16

Observation ca08224d-e2b8-4b54-a062-30afb45ca530 · outbound

This paper cites A parallel batch-dynamic data structure for the closest pair problem.CoRR, 2020.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation A parallel batch-dynamic data structure for the closest pair problem.CoRR, 2020

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:05.216705Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.216705Z digest=sha256:768325cc50506949ada60937bf0b1db01efa03ac9272c53349accfcc7d14aa23

Observation f93b6354-5e35-42ad-825e-68eef6af8ee2 · outbound

This paper cites Parallel Batch-Dynamic $k$d-Trees.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Parallel Batch-Dynamic $k$d-Trees

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:05.369258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.369258Z digest=sha256:ad0b6083134cfa3be829861edcefbd311f481e28687b8deb425129c2ecf87995

Observation f75b977d-5690-41de-a7f1-2bbe97ba3281 · outbound

This paper cites Optimal batch-dynamic kd-trees for processing-in-memory with applications.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Optimal batch-dynamic kd-trees for processing-in-memory with applications

Reference 47

Resolution
malformed identifier
no resolver link, observed 2026-08-02T22:27:05.500897Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.500897Z digest=sha256:3694f1e1c8961fbcc5419cb2065ef2545bc0371a00149fddd80a6f26cd3198fb

Observation de199499-7338-461d-9561-8aabf64035fb · outbound

This paper cites an unresolved cited work.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Unresolved cited work

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:05.664316Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.664316Z digest=sha256:6f23f16f2227784de11f2ccc0e52eb4067ef772de3df4241031c81900d0436e2

Observation 6db30884-456f-4155-8140-d555230b6105 · outbound

This paper cites an unresolved cited work.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Unresolved cited work

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:05.793159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.793159Z digest=sha256:1d49fe8eb344c11184622e734f7f89fec9f7fc6f11c1753ea5102d9392bed4a6

Observation fdde0a05-1013-4099-bf14-e5e12e5f8f22 · outbound

This paper cites replacement.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation replacement

Reference 50

Resolution
malformed identifier
no resolver link, observed 2026-08-02T22:27:05.910980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:05.910980Z digest=sha256:8374fbc8eee15809b93556dabec50b07d6bbd0dcc59e3f78baad6440fc0e0ed6

Pith citing papers

Observation 42ad45f8-5e43-4e21-ad73-79fa418be140 · inbound

Parallel Batch-Dynamic Maximal Independent Set cites this paper.

Parallel Batch-Dynamic Maximal Independent Set Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation

Reference 14

Resolution
verified exact
arxiv_id, observed 2026-07-31T02:06:18.608137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-10T16:58:46.321102Z digest=sha256:ea68e463dd408bba7587f360042a8aef260befae23d59334ed5c7ffe63f83396