{"as_of":"2026-08-10T15:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc4afb204901a91a502bd51b937f55980ebea9b2eeeb1781e34c17074cc28a36","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:34:58.379359Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T22:56:17.293109Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.07706","last_updated":"2024-02-29T03:22:51Z","snapshot_observed_at":"2026-07-06T17:00:45.756069Z","submitted_at":"2023-12-12T20:09:07Z","title":"Near-Optimal Differentially Private k-Core Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07706","snapshot_observed_at":"2026-08-07T10:34:58.379359Z","title":"Li, and Quanquan C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05503","last_updated":"2025-06-05T18:40:33Z","snapshot_observed_at":"2026-08-07T10:17:54.125014Z","submitted_at":"2025-06-05T18:40:33Z","title":"On Differential Privacy for Adaptively Solving Search Problems via Sketching","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.379359Z"},"links":{"cited_paper":"/paper/2312.07706","citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:56f89f7e71f145f77f5011e1a1af44cc937fdfc4e6541d6c73fcf9e645fe6043","observation_id":"323fac80-19b6-452a-a994-8131e1107482","resolution":{"observed_at":"2026-08-07T10:34:58.379359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07706","last_updated":"2024-02-29T03:22:51Z","snapshot_observed_at":"2026-07-06T17:00:45.756069Z","submitted_at":"2023-12-12T20:09:07Z","title":"Near-Optimal Differentially Private k-Core Decomposition","version":2},"cited_work":{"arxiv_id":"2312.07706","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.07706","snapshot_observed_at":"2026-08-06T22:56:17.293109Z","title":"Near-Optimal Differentially Private k-Core Decomposition","venue":"cs.DS","work_id":"bbb92dce-ae1e-465f-95f7-37d01c24c8a3","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.823491Z"},"links":{"cited_paper":"/paper/2312.07706","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:47563c86626d2a9d9ddfeeecc2a9f50ed2a235cd9e3c6fca01dc90415515cd3a","observation_id":"70a38d90-6c26-47eb-8031-2af345437f19","resolution":{"observed_at":"2026-08-06T22:56:17.296177Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.07706/citation-record","integrity":"/paper/2312.07706/integrity","json":"/paper/2312.07706/citation-record.json","paper":"/paper/2312.07706"},"outbound":[],"paper":{"arxiv_id":"2312.07706","last_updated":"2024-02-29T03:22:51Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T17:00:45.756069Z","submitted_at":"2023-12-12T20:09:07Z","title":"Near-Optimal Differentially Private k-Core Decomposition"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.07706."}