{"as_of":"2026-08-19T21:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9192fd1a14d5fcf8ca4f72475e43589d7523a9162e41aff0167aaf2cf9a8c590","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T03:01:36.096926Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2606.27849/citation-record","integrity":"/paper/2606.27849/integrity","json":"/paper/2606.27849/citation-record.json","paper":"/paper/2606.27849"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0400000042","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T07:06:02.863394Z","title":"2014.The Algorithmic Foundations of Differential Privacy","venue":"Foundations and Trends® in Theoretical Computer Science","work_id":"2b98a090-16f8-424b-b782-6b54235093c7","year":2014},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:b8cedd54c6893f9273203c69dc29c0db7257e22b35d0f9f8adcfdc268f284cc6","observation_id":"3ff2465f-f9c3-4690-8764-b9ac41b0cf2d","resolution":{"observed_at":"2026-06-29T03:03:03.855085Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-03T18:38:38.595881+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T18:38:38.595881+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T03:01:36.096926Z","title":"On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:ead091af5d39e6bb154b5158c607cdf4ec47c90877146265d81977788e57d289","observation_id":"5d3faf54-2740-4fb4-8902-2dea047bba62","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"Privacy for Free: How Does Dataset Condensation Help Privacy?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:d9712d5bf76cf3c87c53024bd0b2f3e800d0fd9a9e465eac8ce4263c603913b0","observation_id":"3721f16b-94f9-45ef-a393-12db1672b40a","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlo,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:c1b409806ff242becbc6f5a18ec2119297eefca63db3bd59635c8955bc6a47a7","observation_id":"cd9c9b6b-0158-4e07-ae73-6b83b707e1d1","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"Differential Privacy for Free? Harnessing the Noise in Approximate Homomorphic Encryption,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:5763e878cd0f712f624708d1f91a830fae4b508bece677357866ab72df8cc658","observation_id":"d0f48d20-665d-4944-853e-8e21800e14d8","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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":"10.1073/pnas.2423072122","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gavin R Brown, Krishnamurthy Dj Dvijotham, Georgina Evans, Daogao Liu, Adam Smith, and Abhradeep Guha Thakurta","venue":"Proceedings of the National Academy of Sciences","work_id":"106f640c-d4c3-4750-9dda-6089c751d710","year":2025},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:65c4479abf6876507769bf50f6a48500c92e065fe894031cf96c562b02a0405d","observation_id":"397d0d7e-c144-4fb0-8f5e-6e869f992a8c","resolution":{"observed_at":"2026-06-29T03:03:03.852927Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T03:01:36.096926Z","title":"Privacy for Free: Communication- Efficient Learning with Differential Privacy Using Sketches,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:e0be7f027d09ee09436df95afbecc3b478f17b51b5915defb451a60cdb037c65","observation_id":"61b46ce5-ab58-4c20-ba76-e4b59ab14623","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"Privacy for Free: Wireless Federated Learning via Uncoded Transmission With Adaptive Power Control,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:c5ba881cd347bfbeaa00745821bedf57427399e0faa259312996565452152d95","observation_id":"d39ebfd9-bc82-4729-9f8e-fbf9e5a4deff","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"Leveraging Channel Noise for Sam- pling and Privacy via Quantized Federated Langevin Monte Carlo,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:d6a357eab128a52129106d5da6649fd066cebdc3ccb30fd6dfd71457afe3c523","observation_id":"89b57711-f0f6-4965-aecf-dc2cb362356e","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"Federated Learning- Based Cell-Free Massive MIMO System for Privacy-Preserving,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:a8eb674dedef126b766f40bf79d9a955ac275b34d41642b8edf58e9551ba254f","observation_id":"d38c6cc1-c79d-43da-b9d9-3d29c9775117","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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":"7732.31777","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T17:55:51.028878Z","title":"Towards Practical Differential Privacy for SQL Queries,","venue":null,"work_id":"67e8cdf8-25b2-4909-809c-f49e5b276758","year":2018},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:29130883c570b16a31f807c826d68eb853f1a03cb27fd7fef5e8d1c3a250bd36","observation_id":"cc5cbad0-2309-44f6-9f5d-e9aee524fb06","resolution":{"observed_at":"2026-07-01T17:55:51.034683Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T03:01:36.096926Z","title":"Error Detecting and Error Correcting Codes,","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:e08840f40c3b3b832dc27ab1d220cde2a86fa80a9bc3a68e687d9a01b3e71f23","observation_id":"7b5c944f-63b8-47ef-8a86-cb6bce0a84b5","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","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-06-29T03:01:36.096926Z","title":"White paper: UNEXT – a unified networking experience,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T03:01:36.096926Z"},"links":{"citing_paper":"/paper/2606.27849"},"observation_digest":"sha256:1e3ea0dc12d4323f1019da02948815321b8916429718a68090012c4e3d777c74","observation_id":"3d7ae924-b6b6-4b71-bda7-bf01f776f03f","resolution":{"observed_at":"2026-06-29T03:01:36.096926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27849","last_updated":"2026-06-26T08:42:34Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T14:48:33.186359Z","submitted_at":"2026-06-26T08:42:34Z","title":"Differential Privacy over Hamming Codes"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":13},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2606.27849."}