{"as_of":"2026-08-07T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d69fd25d5e8360684ac69051e5f6297b9431c37f15d54d84db33d08654900d4","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:40:31.071027Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T11:07:15.803339Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs","version":1},"cited_work":{"arxiv_id":"2406.16565","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16565","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Noisy neighbors: Efficient membership inference attacks against llms","venue":null,"work_id":"0cac9560-7bf2-434d-befd-ad922e69cf2c","year":2024},"citing_paper":{"arxiv_id":"2506.06057","last_updated":"2026-05-03T07:24:06Z","snapshot_observed_at":"2026-08-02T17:34:16.527589Z","submitted_at":"2025-06-06T13:02:59Z","title":"Hey, That's My Data! Token-Only Dataset Inference in Large Language Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T11:03:03.204840Z"},"links":{"cited_paper":"/paper/2406.16565","citing_paper":"/paper/2506.06057"},"observation_digest":"sha256:9111fe53c591a51a2998683bc9e5aaa40431446b452914d8773e8778f4395d97","observation_id":"95cf1d2b-3786-4981-be64-b1cd837985ed","resolution":{"observed_at":"2026-05-19T11:07:15.804944Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16565","snapshot_observed_at":"2026-08-06T21:40:31.071027Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23603","last_updated":"2025-07-16T15:51:30Z","snapshot_observed_at":"2026-08-06T21:34:50.344293Z","submitted_at":"2025-06-30T08:08:15Z","title":"SoK: Semantic Privacy in Large Language Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:40:31.071027Z"},"links":{"cited_paper":"/paper/2406.16565","citing_paper":"/paper/2506.23603"},"observation_digest":"sha256:a844308e62b0875b6488c7b4c054c0b180f0e045cd8ba91f516be020a0e9e580","observation_id":"00b3d03f-52a4-45a3-95e8-bbdced502076","resolution":{"observed_at":"2026-08-06T21:40:31.071027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs","version":1},"cited_work":{"arxiv_id":"2406.16565","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16565","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Noisy neighbors: Efficient membership inference attacks against llms","venue":null,"work_id":"0cac9560-7bf2-434d-befd-ad922e69cf2c","year":2024},"citing_paper":{"arxiv_id":"2507.06056","last_updated":"2026-04-20T04:08:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-08T14:58:28Z","title":"Data Compressibility Quantifies LLM Memorization","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-19T06:00:12.027708Z"},"links":{"cited_paper":"/paper/2406.16565","citing_paper":"/paper/2507.06056"},"observation_digest":"sha256:6f36635f569942b678bc1ae03d192cbbe6f0487731b1564bbb6e0c423db27beb","observation_id":"ecfe36a8-3f91-45de-a0c7-3a3d02732dfe","resolution":{"observed_at":"2026-05-19T06:02:07.742282Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16565","snapshot_observed_at":"2026-08-05T16:50:21.744752Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.17767","last_updated":"2025-09-13T01:49:58Z","snapshot_observed_at":"2026-08-06T11:47:39.038660Z","submitted_at":"2025-08-25T08:04:20Z","title":"ISACL: Internal State Analyzer for Copyrighted Training Data Leakage","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T16:50:21.744752Z"},"links":{"cited_paper":"/paper/2406.16565","citing_paper":"/paper/2508.17767"},"observation_digest":"sha256:8cb24c2fd86fd1a304e6f9df56044e997d93613f04b86ed356d4b17792528a5b","observation_id":"b6b00dcd-41c2-40a9-a2f2-2e37a22a62d7","resolution":{"observed_at":"2026-08-05T16:50:21.744752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16565","snapshot_observed_at":"2026-08-05T11:39:20.023404Z","title":"Noisy neighbors: Efficient member- ship inference attacks against llms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02411","last_updated":"2025-09-02T15:19:57Z","snapshot_observed_at":"2026-08-06T21:38:56.067118Z","submitted_at":"2025-09-02T15:19:57Z","title":"A Survey: Towards Privacy and Security in Mobile Large Language Models","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T11:39:20.023404Z"},"links":{"cited_paper":"/paper/2406.16565","citing_paper":"/paper/2509.02411"},"observation_digest":"sha256:e981b50fe60a99486840720dc2552981733ea1519d2ab3e43553b08754bf407c","observation_id":"5304898d-bb9a-4024-9799-59a88e0493e4","resolution":{"observed_at":"2026-08-05T11:39:20.023404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16565","snapshot_observed_at":"2026-08-04T17:46:18.024092Z","title":"Noisy neighbors: Effi- cient membership inference attacks against LLMs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10682","last_updated":"2025-09-12T20:26:16Z","snapshot_observed_at":"2026-08-04T21:00:53.508626Z","submitted_at":"2025-09-12T20:26:16Z","title":"LLM in the Middle: A Systematic Review of Threats and Mitigations to Real-World LLM-based Systems","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-04T17:46:18.024092Z"},"links":{"cited_paper":"/paper/2406.16565","citing_paper":"/paper/2509.10682"},"observation_digest":"sha256:be0da7060ee7a3447887197f336758318202a2758f41c1a78b7b3ad1c7190f70","observation_id":"5d12660e-c033-4289-a9b1-f87634be2c10","resolution":{"observed_at":"2026-08-04T17:46:18.024092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.16565/citation-record","integrity":"/paper/2406.16565/integrity","json":"/paper/2406.16565/citation-record.json","paper":"/paper/2406.16565"},"outbound":[],"paper":{"arxiv_id":"2406.16565","last_updated":"2024-06-24T12:02:20Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T18:35:59.208843Z","submitted_at":"2024-06-24T12:02:20Z","title":"Noisy Neighbors: Efficient membership inference attacks against LLMs"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2406.16565."}