{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5F4SYW7KQBM45IQAFAOR2U4F3H","short_pith_number":"pith:5F4SYW7K","schema_version":"1.0","canonical_sha256":"e9792c5bea8059cea200281d1d5385d9efc518b49c5674743554a5bd05893132","source":{"kind":"arxiv","id":"2602.13460","version":2},"attestation_state":"computed","paper":{"title":"Differentially Private Graph Coloring","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Dung Nguyen, Jiayi Wu, Michael Xie","submitted_at":"2026-02-13T21:07:57Z","abstract_excerpt":"Differential Privacy is the gold standard in privacy-preserving data analysis. This paper addresses the challenge of computing an edge-differentially private vertex coloring. In this paper, we present two novel algorithms for this problem. Both algorithms begin by coloring each vertex uniformly at random from a fixed-size palette, and then apply the exponential mechanism to locally resample colors for either all vertices or a selected subset of vertices.\n  Any non-trivial edge differentially private coloring of a graph needs to be defective, as a proper coloring exposes the non-existence of an"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2602.13460","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-13T21:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"15000a87ba7c8adbbfb9cb9c5fe30b830de0c5b612ecb01e6921fc8f8816c4f5","abstract_canon_sha256":"9ea0a41f4ee5b04b123d18a7341a018656e386b0a314d30a3c0e929155a8235c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:55.040191Z","signature_b64":"Y37dDsK4LnirRj45/FOzRtqsVNPb0g4HvzG0sY3PqV5eqWq3vZJyy85dK8Z2UztxIJWYXGD2pcVDukbI3NPoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9792c5bea8059cea200281d1d5385d9efc518b49c5674743554a5bd05893132","last_reissued_at":"2026-06-19T16:09:55.039770Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:55.039770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Graph Coloring","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Dung Nguyen, Jiayi Wu, Michael Xie","submitted_at":"2026-02-13T21:07:57Z","abstract_excerpt":"Differential Privacy is the gold standard in privacy-preserving data analysis. This paper addresses the challenge of computing an edge-differentially private vertex coloring. In this paper, we present two novel algorithms for this problem. Both algorithms begin by coloring each vertex uniformly at random from a fixed-size palette, and then apply the exponential mechanism to locally resample colors for either all vertices or a selected subset of vertices.\n  Any non-trivial edge differentially private coloring of a graph needs to be defective, as a proper coloring exposes the non-existence of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.13460","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.13460/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.13460","created_at":"2026-06-19T16:09:55.039826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.13460v2","created_at":"2026-06-19T16:09:55.039826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.13460","created_at":"2026-06-19T16:09:55.039826+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F4SYW7KQBM4","created_at":"2026-06-19T16:09:55.039826+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F4SYW7KQBM45IQA","created_at":"2026-06-19T16:09:55.039826+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F4SYW7K","created_at":"2026-06-19T16:09:55.039826+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H","json":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H.json","graph_json":"https://pith.science/api/pith-number/5F4SYW7KQBM45IQAFAOR2U4F3H/graph.json","events_json":"https://pith.science/api/pith-number/5F4SYW7KQBM45IQAFAOR2U4F3H/events.json","paper":"https://pith.science/paper/5F4SYW7K"},"agent_actions":{"view_html":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H","download_json":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H.json","view_paper":"https://pith.science/paper/5F4SYW7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.13460&json=true","fetch_graph":"https://pith.science/api/pith-number/5F4SYW7KQBM45IQAFAOR2U4F3H/graph.json","fetch_events":"https://pith.science/api/pith-number/5F4SYW7KQBM45IQAFAOR2U4F3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H/action/storage_attestation","attest_author":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H/action/author_attestation","sign_citation":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H/action/citation_signature","submit_replication":"https://pith.science/pith/5F4SYW7KQBM45IQAFAOR2U4F3H/action/replication_record"}},"created_at":"2026-06-19T16:09:55.039826+00:00","updated_at":"2026-06-19T16:09:55.039826+00:00"}