Pith. sign in

Paper Citation Record · LEDGER

Differentially Private Graph Coloring

As of 10 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-10T06:31:04.303077+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:58dffdaea5d3bda407f4a5ee11671b15a1ca162176041b24055064d0f29bf782

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

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:057ac1fea6763945ad130fcbb2c6bf1891b23931a0867ad7a8cc1b98d6e0b7f6

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:168a2165ace6c078c1993b945d282db09b97958f860ad6f5cee3650863c09bd9

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:6f3afe117d1c5f22e536be8adce3dd6e5b738386760cf7208c790c36909b9a3e

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

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:54698673717ada56dd04ebbd856dfcea4ea3eadc3478081359e946e33eee534e

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

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:92a63336c75c1dfa028f79784894331316a6ce3c762ae32374ff98fc56ad8f2a

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:78d505e447de2730a6f3a9b1dbef9370895fc50f25713fa54e41895c4db5c67d

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:509bd0cc3e1a1f3a0a8e82d62b1e4e50777ea8b129883d2d058223b3929325e4

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:631256cfd266489e1b5cdbbc0939bae7f33960175b1ed794dc98d9ac13654272

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:4600a5aaefc6becc98cc92fc4b155b1342cdd091f42cf1360432b3c26dc4bf23

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

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:5f30da00cea1e83451d1ccd907c76f8371e125b84265429bfaa452b14920cbf0

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:3f4e158bfb12cbda96ecfb6638022121e8123bd4843acccdaad09fee85fad65d

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:5de89171a7303345e3beb21f5575ce9eed769561278cdb9feb35dd37f58f1ac9

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:7152c3e767439e57d49cb30179a8845919deeda63e0a908e0bbb6cfa05f3deaa

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:8c8199d024b93a1de0f66a0726ea1a9478efe4aacc7f808af9c4e769e99d70ed

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

Pith citing papers

No inbound Pith citation observations are available.