Paper Citation Record · LEDGER

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees

As of 11 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2507.06334.

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

pith.paper-citation-record.v1
2507.06334 v1

Coverage vector

measured 42 of 42 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T19:23:36.027330Z

measured 42 of 42 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

42 of 42 outbound references displayed

verified exact2
verified fuzzy28
unresolved12
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3c1b7c42-74de-4f95-b8d9-7c30ba03f292 · outbound

This paper cites Parallel batch-dynamic trees via change propagation.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel batch-dynamic trees via change propagation

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:32.249196Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99e8487b-8bd7-432b-9f8f-c8e18696698f · outbound

This paper cites Parallel batch-dynamic graph connectivity.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel batch-dynamic graph connectivity

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:32.314468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d15894b3-9ef1-4f18-aecd-e3ffcb12c94a · outbound

This paper cites Deterministic and low-span work-efficient parallel batch-dynamic trees.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Deterministic and low-span work-efficient parallel batch-dynamic trees

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:32.371195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf42161b-f460-4c04-85db-d7ab91f79257 · outbound

This paper cites Large scale networks fingerprinting and visualization using the k-core decomposition.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Large scale networks fingerprinting and visualization using the k-core decomposition

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:43.387690Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2d62cffb-9e97-44a8-95b5-5552bc77e583 · outbound

This paper cites Dynamic representations of sparse graphs.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Dynamic representations of sparse graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:43.170668Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 5046b04c-4625-4e94-8fb1-41963dbd1d49 · outbound

This paper cites Core decomposition of uncertain graphs.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Core decomposition of uncertain graphs

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:42.908504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 032e5e44-f1f1-44fe-849c-5b8a2f090ebd · outbound

This paper cites Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:42.696158Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 0d13cb0d-73d3-4245-b9aa-5be55c59329c · outbound

This paper cites Efficient load-balancing through distributed token dropping.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Efficient load-balancing through distributed token dropping

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:42.438596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 4c3b6a90-3c76-4713-b12b-1a96fdc58c8a · outbound

This paper cites Programming parallel algorithms.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Programming parallel algorithms

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:33.001072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e836a893-acc8-4fd7-ae40-907897978790 · outbound

This paper cites The parallel evaluation of general arithmetic expressions.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees The parallel evaluation of general arithmetic expressions

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:33.059212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5540824a-4fa9-49e7-981e-c6ebdf71d013 · outbound

This paper cites Adaptive out-orientations with applications.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Adaptive out-orientations with applications

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:42.209658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation cae7b823-293d-45fa-a4f7-411a59f23af2 · outbound

This paper cites Relevance of temporal cores for epidemic spread in temporal networks.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Relevance of temporal cores for epidemic spread in temporal networks

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:41.931519Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 7c0d8529-857c-403b-8f6f-cdf0b8dbc667 · outbound

This paper cites Improved dynamic colouring of sparse graphs.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Improved dynamic colouring of sparse graphs

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:41.677190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation d368813b-e3e0-40da-82f7-c40485e3afbd · outbound

This paper cites Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:41.424945Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 3e33b51d-f00a-448b-b4a4-8d2f2912daa0 · outbound

This paper cites Finding the best k in core decomposition: A time and space optimal solution.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Finding the best k in core decomposition: A time and space optimal solution

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:41.203270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 38ac823a-fff9-4c6b-a551-fb5f60dbe11a · outbound

This paper cites Julienne: A framework for parallel graph algorithms using work-efficient bucketing.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Julienne: A framework for parallel graph algorithms using work-efficient bucketing

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:40.938329Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 50050149-29d1-4416-b2fe-497b62923022 · outbound

This paper cites Theoretically efficient parallel graph algorithms can be fast and scalable.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Theoretically efficient parallel graph algorithms can be fast and scalable

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:40.662882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 53dd59c1-47f6-4f4e-adfb-0f8602585658 · outbound

This paper cites Parallel batch-dynamic k-clique counting.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel batch-dynamic k-clique counting

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:33.838679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e13a267c-65f7-44ed-810c-ed59c6a33b5c · outbound

This paper cites Parallel and streaming algorithms for k-core decomposition.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel and streaming algorithms for k-core decomposition

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:40.447907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 9580ae9b-fde8-4eb5-9765-33cc2d112022 · outbound

This paper cites Efficient computation of probabilistic core decomposition at web-scale.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Efficient computation of probabilistic core decomposition at web-scale

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:40.223271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 8b3c2f0d-82d4-480c-b185-12411ed53c9d · outbound

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

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Nearly work-efficient parallel dfs in undirected graphs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:34.119237Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf8ae8b2-1439-4872-8e31-9e9ac737d47d · outbound

This paper cites Improved parallel algorithms for density-based network clustering.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Improved parallel algorithms for density-based network clustering

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:39.907136Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 532aa894-889e-4eaa-b76e-3b53a502a25c · outbound

This paper cites Towards a theory of nearly constant time parallel algorithms.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Towards a theory of nearly constant time parallel algorithms

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:34.308595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a69d86ea-5204-4d27-841c-40bbcc9766f1 · outbound

This paper cites Parallel dynamic maximal matching.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel dynamic maximal matching

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:34.399266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51e0c308-f012-4a54-816c-6075fd6e49d6 · outbound

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

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Reference 25

Resolution: verified exact; local_arxiv, observed 2026-08-06T19:23:36.540971Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2b84a18e-ab84-4623-a874-1eb826a6ea92 · outbound

This paper cites Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth

Reference 26

Resolution: verified exact; local_arxiv, observed 2026-08-06T19:23:36.294522Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation ab07ff74-afc6-4a9b-8b8d-767a51d41b33 · outbound

This paper cites K-core decomposition of large networks on a single pc.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees K-core decomposition of large networks on a single pc

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:39.618976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 9ada176d-8731-48ce-8036-cd22bbde8671 · outbound

This paper cites Identification of influential spreaders in complex networks.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Identification of influential spreaders in complex networks

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:39.385030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 1316179c-7267-4364-9407-6c1c178bf0b8 · outbound

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

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Orienting fully dynamic graphs with worst-case time bounds

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:39.149600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation b787c13d-b7d9-4891-b6e8-d5ba58126f04 · outbound

This paper cites Parallel k-core decomposition on multicore platforms.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel k-core decomposition on multicore platforms

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:38.887795Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 4cafecb9-4ccd-4eeb-8d53-7acce9f1a0da · outbound

This paper cites Locality in distributed graph algorithms.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Locality in distributed graph algorithms

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:38.657852Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 439d2383-b491-424a-bb72-bdd97f22ec17 · outbound

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

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel batch-dynamic algorithms for k-core decomposition and related graph problems

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:35.041130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0f05cce-ccd1-4557-9da9-4f63d72b0d58 · outbound

This paper cites Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, and Julian Shun.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, and Julian Shun

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:38.369089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation cb6e42bb-0d84-4417-9ce3-497983dfd9f5 · outbound

This paper cites Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:38.077615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 0362f112-ff8c-419a-9455-df91ed84badf · outbound

This paper cites Efficient progressive minimum k-core search.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Efficient progressive minimum k-core search

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:37.890740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2e6a7170-5b43-4abf-bb64-8265c9929b86 · outbound

This paper cites A game theoretic approach for k-core minimization.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees A game theoretic approach for k-core minimization

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:37.647449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2a903763-1002-4b73-b3b2-a3abe2890b9c · outbound

This paper cites Locating influential nodes in complex networks.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Locating influential nodes in complex networks

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:37.445087Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 75f35053-8a69-40a4-ab73-f001ac51c70a · outbound

This paper cites Decomposition of finite graphs into forests.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Decomposition of finite graphs into forests

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:37.195904Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 5c1c13c4-0b52-4d7c-93f6-8d3b2afa070a · outbound

This paper cites Parallel algorithms for red–black trees.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel algorithms for red–black trees

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:35.641928Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0906f807-183a-492b-b2d8-851e5c39adf5 · outbound

This paper cites Fully dynamic approximate k-core decomposition in hypergraphs.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Fully dynamic approximate k-core decomposition in hypergraphs

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:36.970449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e9dffbc1-8e44-41a6-ac27-c0422a71e96d · outbound

This paper cites Near-optimal fully dynamic densest subgraph.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Near-optimal fully dynamic densest subgraph

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T19:23:36.776354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation ec9e009f-62dc-4303-9633-31aa20c8d0f8 · outbound

This paper cites Parallel batch-dynamic minimum spanning forest and the efficiency of dynamic agglomerative graph clustering.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Parallel batch-dynamic minimum spanning forest and the efficiency of dynamic agglomerative graph clustering

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-06T19:23:36.027330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.