Pith. sign in

Paper Citation Record · LEDGER

Differentially Private Graph Coloring

As of 23 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2602.13460.

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

pith.paper-citation-record.v1
2602.13460 v2

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T23:39:20.256032Z

measured 20 of 20 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+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

20 of 20 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved20
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b8af9c2a-abcd-42cd-a9ff-dbde992d749c · outbound

This paper cites Statistical mechanics of complex networks.Reviews of modern physics, 74(1):47, 2002.

Differentially Private Graph Coloring Statistical mechanics of complex networks.Reviews of modern physics, 74(1):47, 2002

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:18.750740Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:18.750740Z digest=sha256:4c249b69be3089a33707040bb38a4d512305a1dac939894380862e32d25769e3

Observation 3f652325-0535-4c41-a659-85ba6113f457 · outbound

This paper cites A note on defective colorings of graphs in surfaces.J.

Differentially Private Graph Coloring A note on defective colorings of graphs in surfaces.J

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:18.806030Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:18.806030Z digest=sha256:d49f20d50ef5c96567195d4b7bfd1a65dd10e76587cc03c2b3919f4613958339

Observation 0718ef40-b23d-482c-b23a-ae14bc18bf47 · outbound

This paper cites Differentially private data analysis of social networks via restricted sensitivity.

Differentially Private Graph Coloring Differentially private data analysis of social networks via restricted sensitivity

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:18.964871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:18.964871Z digest=sha256:c530d9ff3640cf183e7198ec92d725d5f4c1e768162d1cbf67ef393380d1c25a

Observation 03528d25-4936-4ba9-8fdc-e5d611a026f9 · outbound

This paper cites an unresolved cited work.

Differentially Private Graph Coloring Unresolved cited work

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.043631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.043631Z digest=sha256:f185ed77ade3218242e10833a0a0b609563025a2e51df0005b1125d0502f56a8

Observation dfd33429-f764-4f93-aff0-ca31df9a224e · outbound

This paper cites Private graph colouring with limited defectiveness.

Differentially Private Graph Coloring Private graph colouring with limited defectiveness

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.089685Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.089685Z digest=sha256:58f9e013b6a450bacc1d3a715f5594041bcd09e802ab5fba184cfd93c906d68d

Observation 46d75426-d616-4fdc-9a37-fa35e629f803 · outbound

This paper cites Li, Quanquan C.

Differentially Private Graph Coloring Li, Quanquan C

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.143634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.143634Z digest=sha256:42bdd5371c45d7a97c4f04da6725ed00ca27814e95cd61d198db078b5265f0f4

Observation ec99f44e-e51f-4229-9e6a-ccd35af3ba7c · outbound

This paper cites The algorithmic foundations of differential privacy.Foundations and Trends®in Theoretical Computer Science, 9(3–4):211–407, 2014.

Differentially Private Graph Coloring The algorithmic foundations of differential privacy.Foundations and Trends®in Theoretical Computer Science, 9(3–4):211–407, 2014

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.175118Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.175118Z digest=sha256:4d11040c7aaa668b53350111be5849cd16698a1fb2fb4bdf5faca6df55e51cf3

Observation 76d3e7ba-4296-4847-af92-933f7cb4b483 · outbound

This paper cites North-Holland Publishing Co., NLD, 2004.

Differentially Private Graph Coloring North-Holland Publishing Co., NLD, 2004

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.215067Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.215067Z digest=sha256:664c7762d57b35d874538206f619d9e1d7267bfeed35088fd482a376f7fb2090

Observation 3e0136e7-1605-4650-bf4e-f4892fa85053 · outbound

This paper cites Polynomial algorithms for perfect graphs.

Differentially Private Graph Coloring Polynomial algorithms for perfect graphs

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.257145Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.257145Z digest=sha256:0c2b6840f87a739f6a40e61c37cef6ce22b80c96dafc904fb68c549eb5c75e10

Observation 563eaf3c-d7c0-4b78-bb71-c76f7ab6bf19 · outbound

This paper cites Differentially pri- vate combinatorial optimization.

Differentially Private Graph Coloring Differentially pri- vate combinatorial optimization

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.329363Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.329363Z digest=sha256:b88ecea59df37d3f38ebb6095edb012ef3dd8250bfca2e4001ecb01cb8f49baa

Observation 10eff96c-9f4e-4160-8e5d-e308276a7692 · outbound

This paper cites Accurate estimation of the degree distribution of private networks.

Differentially Private Graph Coloring Accurate estimation of the degree distribution of private networks

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.394746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.394746Z digest=sha256:bce47d0af15def1f8f7e9e4fc948bbc108b829c61192f1b5b658dc1ac3d4c16b

Observation 3f76172b-6e5c-4567-a8c6-733d988a92a1 · outbound

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

Differentially Private Graph Coloring Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.467664Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.467664Z digest=sha256:0f98901c546a451af36276424dee7438188df16837c810539ef6ccebadda16d2

Observation d8d5d5fc-6e23-4575-add9-a66688fce386 · outbound

This paper cites Approximate graph coloring by semidefinite pro- gramming, 1998.

Differentially Private Graph Coloring Approximate graph coloring by semidefinite pro- gramming, 1998

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.524750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.524750Z digest=sha256:93846458263e16309e9e90dd8f8970bf292acaa9a217536a321fa1583af6e0b4

Observation 76d0fdc4-baf0-4f58-9b3d-afff7205d5a9 · outbound

This paper cites Karp.Reducibility among Combinatorial Problems, pages 85–103.

Differentially Private Graph Coloring Karp.Reducibility among Combinatorial Problems, pages 85–103

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.567996Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.567996Z digest=sha256:671a80d3ef0b6e25ddb0d5130bbecdc77cb2da20b8588b600b0b2b9631bba4f9

Observation 17a17d1c-a939-4e49-a6e5-29c76ee15d20 · outbound

This paper cites Private analysis of graph structure.ACM Trans.

Differentially Private Graph Coloring Private analysis of graph structure.ACM Trans

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.617317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.617317Z digest=sha256:d0f29e0d0e1ba3c4dc4f9253c8eea93f072b140093e4350b8c77d4fd4f4b9e70

Observation 47b16e2e-bf2c-4655-a8bb-c01b234a4849 · outbound

This paper cites Analyzing graphs with node differential privacy.

Differentially Private Graph Coloring Analyzing graphs with node differential privacy

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.704816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.704816Z digest=sha256:4ef898d5b4ed5ac8e704ed31ef3e13214fc6d6389a81ae4e256cee5e9d86709f

Observation c7089b30-535b-4710-ba33-3e89078e5b9e · outbound

This paper cites Analyzing graphs with node differential privacy.

Differentially Private Graph Coloring Analyzing graphs with node differential privacy

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.864739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.864739Z digest=sha256:85f1fd429087cd358933b7924314aa20b1bae8c1421e4e15d6cb2f2d90898a90

Observation a93e62e3-eeaf-4adb-b75b-8bd5cd312dda · outbound

This paper cites Analyzing graphs with node differential privacy.

Differentially Private Graph Coloring Analyzing graphs with node differential privacy

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:20.005885Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:20.005885Z digest=sha256:7e1a429edb337407d791ff72073a42b7c8da11583eb52a19054107f7c11ae85b

Observation 52d50d6f-fd29-46c9-a3b0-9bfe453ec50b · outbound

This paper cites Snap: A general-purpose network analysis and graph-mining library.

Differentially Private Graph Coloring Snap: A general-purpose network analysis and graph-mining library

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:20.124845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:20.124845Z digest=sha256:8c0f4e82e7303436c48ce3f3a9579c78b501a9cb707c27325bbbc0317e066573

Observation 5e8f3083-60d1-4405-8f64-24427f629d51 · outbound

This paper cites an unresolved cited work.

Differentially Private Graph Coloring Unresolved cited work

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:20.256032Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:20.256032Z digest=sha256:7fbbe41a8ae568af4c6c6b2aaabd0af3960ca933adfe767adf826da285603ae8

Pith citing papers

No inbound Pith citation observations are available.