Pith. sign in

Paper Citation Record · LEDGER

Differentially Private Graph Coloring

As of 8 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-08T06:32:00.761636+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:1607f58adb4fa7f65a0eb90931343df836601947687519348251f19baedce5ec

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:471eed0e88c156aa35c179e503e96bf5c24c33f4d55470adbcbe17dea1d1dc1b

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:64a4039d060051ddbdc3d1363b3d03e86abfeee51b6db93f3b7b8e02d78ba8a3

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:59bfd179ea42a881a04c2fa83dbd86a9d76b11c763a455e41c6c506be27d096e

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:626434f81156d3f609ce559c35e2633b6416a5c26b79558f5c83431f13bf8328

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:a908bdc67c878de511559e8f1f3e3389eb360789ab91d597286d166acd29bca1

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:29836a9cd65ce87ead0d956897a0e3f0dce403c57c9729c896f82c22bcf9148b

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:c4dbca37069b66294f8e6ace52e357790a781c506e3cd6957e131845043e6e88

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:890b3d5fd52ebe99a44f1dec20c68b8bfe56d15da8a3a176c506e3522d798634

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:731bacf8f241bf0e128672d16ed58019a026863365a335dc2a9278b9a15f2d69

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:14307df94303c1119f06b6050bbf0c3928f95dfad0013dd2491c233dbef2b68e

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:0b1e014b7314fd3ff50fd078a3e49816f53afc04d77e8d16a9e15b721720f82e

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:06b399e31a255e413c14298721b70d3fc1c73b2adf5405ab85f1d9bef1a7c3e5

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:294754a0fb542c2b0cf8e54a98b911388e6311cd3608c2df2d848a99a6b0cd39

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:ee2aa21c60fdd06416efe16b93d1a23fe450601a785d4ed85d544f70e861eb52

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:13387929c839f1e6b1a9e961cec4ae2f7b13eaf0cd2d30989a5bae104acae1da

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:a5c1238e02c51a573a7755dab3f203cac14b49f25704b79e7a360964794eb7ae

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:d1b6c3f28cb4f2d11479db270d9e644a4145d98e258f25b11c6a6fc2db99697c

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:f8581e20e32a145b795242e80a3b281f1f2d1a59aa2f82a9733cd3f03816ba05

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:93bae151eea7c31990baeb9122034a405a4b6a9686bb1e6f4ac797a58a52ff34

Pith citing papers

No inbound Pith citation observations are available.