{"as_of":"2026-08-10T22:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:793b4dc221a1268d2127510cc6e2100fa6c093c2a4fda4d10a3dc5fa7404d1a9","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T23:39:20.256032Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.13460/citation-record","integrity":"/paper/2602.13460/integrity","json":"/paper/2602.13460/citation-record.json","paper":"/paper/2602.13460"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:18.750740Z","title":"Statistical mechanics of complex networks.Reviews of modern physics, 74(1):47, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:18.750740Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:58dffdaea5d3bda407f4a5ee11671b15a1ca162176041b24055064d0f29bf782","observation_id":"b8af9c2a-abcd-42cd-a9ff-dbde992d749c","resolution":{"observed_at":"2026-08-02T23:39:18.750740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:18.806030Z","title":"A note on defective colorings of graphs in surfaces.J","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:18.806030Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:b892ec8cac60bb1ffa0c316a71617ce28e7a4128a3dd2e34f57225cf4147545a","observation_id":"3f652325-0535-4c41-a659-85ba6113f457","resolution":{"observed_at":"2026-08-02T23:39:18.806030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:18.964871Z","title":"Differentially private data analysis of social networks via restricted sensitivity","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:18.964871Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:057ac1fea6763945ad130fcbb2c6bf1891b23931a0867ad7a8cc1b98d6e0b7f6","observation_id":"0718ef40-b23d-482c-b23a-ae14bc18bf47","resolution":{"observed_at":"2026-08-02T23:39:18.964871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.043631Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.043631Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:168a2165ace6c078c1993b945d282db09b97958f860ad6f5cee3650863c09bd9","observation_id":"03528d25-4936-4ba9-8fdc-e5d611a026f9","resolution":{"observed_at":"2026-08-02T23:39:19.043631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.18692","last_updated":"2025-09-04T12:28:54Z","snapshot_observed_at":"2026-08-07T09:16:27.739934Z","submitted_at":"2024-04-29T13:41:35Z","title":"Private graph colouring with limited defectiveness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.18692","snapshot_observed_at":"2026-08-02T23:39:19.089685Z","title":"Private graph colouring with limited defectiveness.arXiv preprint arXiv:2404.18692, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.089685Z"},"links":{"cited_paper":"/paper/2404.18692","citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:6f3afe117d1c5f22e536be8adce3dd6e5b738386760cf7208c790c36909b9a3e","observation_id":"dfd33429-f764-4f93-aff0-ca31df9a224e","resolution":{"observed_at":"2026-08-02T23:39:19.089685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.143634Z","title":"Li, Quanquan C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.143634Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:d97fc50192b3ed56f2d7e406ca712a29f65c0978f8bd99f5e99cf1cdf1c2e8a4","observation_id":"46d75426-d616-4fdc-9a37-fa35e629f803","resolution":{"observed_at":"2026-08-02T23:39:19.143634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.175118Z","title":"The algorithmic foundations of differential privacy.Foundations and Trends®in Theoretical Computer Science, 9(3–4):211–407, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.175118Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:54698673717ada56dd04ebbd856dfcea4ea3eadc3478081359e946e33eee534e","observation_id":"ec99f44e-e51f-4229-9e6a-ccd35af3ba7c","resolution":{"observed_at":"2026-08-02T23:39:19.175118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.215067Z","title":"North-Holland Publishing Co., NLD, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.215067Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:f1761e56c28d4397f3d46d3ed1287b4c80f641c1cceff449882fa61d00b5bbe1","observation_id":"76d3e7ba-4296-4847-af92-933f7cb4b483","resolution":{"observed_at":"2026-08-02T23:39:19.215067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.257145Z","title":"Polynomial algorithms for perfect graphs","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.257145Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:92a63336c75c1dfa028f79784894331316a6ce3c762ae32374ff98fc56ad8f2a","observation_id":"3e0136e7-1605-4650-bf4e-f4892fa85053","resolution":{"observed_at":"2026-08-02T23:39:19.257145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.329363Z","title":"Differentially pri- vate combinatorial optimization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.329363Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:78d505e447de2730a6f3a9b1dbef9370895fc50f25713fa54e41895c4db5c67d","observation_id":"563eaf3c-d7c0-4b78-bb71-c76f7ab6bf19","resolution":{"observed_at":"2026-08-02T23:39:19.329363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.394746Z","title":"Accurate estimation of the degree distribution of private networks","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.394746Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:509bd0cc3e1a1f3a0a8e82d62b1e4e50777ea8b129883d2d058223b3929325e4","observation_id":"10eff96c-9f4e-4160-8e5d-e308276a7692","resolution":{"observed_at":"2026-08-02T23:39:19.394746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","snapshot_observed_at":"2026-08-08T19:04:12.250584Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10142","snapshot_observed_at":"2026-08-02T23:39:19.467664Z","title":"Explicit and implicit dynamic coloring of graphs with bounded arboricity.CoRR, abs/2002.10142, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.467664Z"},"links":{"cited_paper":"/paper/2002.10142","citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:631256cfd266489e1b5cdbbc0939bae7f33960175b1ed794dc98d9ac13654272","observation_id":"3f76172b-6e5c-4567-a8c6-733d988a92a1","resolution":{"observed_at":"2026-08-02T23:39:19.467664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.524750Z","title":"Approximate graph coloring by semidefinite pro- gramming, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.524750Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:4600a5aaefc6becc98cc92fc4b155b1342cdd091f42cf1360432b3c26dc4bf23","observation_id":"d8d5d5fc-6e23-4575-add9-a66688fce386","resolution":{"observed_at":"2026-08-02T23:39:19.524750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.567996Z","title":"Karp.Reducibility among Combinatorial Problems, pages 85–103","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.567996Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:e0f63bd845aec049fb2a10bef6fce661702fa9792249072e4f17ba5c185c9a8e","observation_id":"76d0fdc4-baf0-4f58-9b3d-afff7205d5a9","resolution":{"observed_at":"2026-08-02T23:39:19.567996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.617317Z","title":"Private analysis of graph structure.ACM Trans","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.617317Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:5f30da00cea1e83451d1ccd907c76f8371e125b84265429bfaa452b14920cbf0","observation_id":"17a17d1c-a939-4e49-a6e5-29c76ee15d20","resolution":{"observed_at":"2026-08-02T23:39:19.617317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.704816Z","title":"Analyzing graphs with node differential privacy","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.704816Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:3f4e158bfb12cbda96ecfb6638022121e8123bd4843acccdaad09fee85fad65d","observation_id":"47b16e2e-bf2c-4655-a8bb-c01b234a4849","resolution":{"observed_at":"2026-08-02T23:39:19.704816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:19.864739Z","title":"Analyzing graphs with node differential privacy","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.864739Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:5de89171a7303345e3beb21f5575ce9eed769561278cdb9feb35dd37f58f1ac9","observation_id":"c7089b30-535b-4710-ba33-3e89078e5b9e","resolution":{"observed_at":"2026-08-02T23:39:19.864739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:20.005885Z","title":"Analyzing graphs with node differential privacy","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:20.005885Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:7152c3e767439e57d49cb30179a8845919deeda63e0a908e0bbb6cfa05f3deaa","observation_id":"a93e62e3-eeaf-4adb-b75b-8bd5cd312dda","resolution":{"observed_at":"2026-08-02T23:39:20.005885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:20.124845Z","title":"Snap: A general-purpose network analysis and graph-mining library","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:20.124845Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:8c8199d024b93a1de0f66a0726ea1a9478efe4aacc7f808af9c4e769e99d70ed","observation_id":"52d50d6f-fd29-46c9-a3b0-9bfe453ec50b","resolution":{"observed_at":"2026-08-02T23:39:20.124845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:39:20.256032Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:20.256032Z"},"links":{"citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:df9eca1ea3dac0ff96c0843c05cd436c00a6abe064f2aabafbe9eb9629b7a785","observation_id":"5e8f3083-60d1-4405-8f64-24427f629d51","resolution":{"observed_at":"2026-08-02T23:39:20.256032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T02:20:25.191639Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}