{"as_of":"2026-08-10T07:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:498569cdc184b867bf7d90547fbfa5a73b403447a286b54398838c4903857846","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:10:19.436912Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"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/2507.06508/citation-record","integrity":"/paper/2507.06508/integrity","json":"/paper/2507.06508/citation-record.json","paper":"/paper/2507.06508"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.322139Z","title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","venue":null,"work_id":"6b321e7d-e127-42fe-926c-ea1e417b1138","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.190117Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:34f48826027b1ed695e9fef8c934a63a3ff3487d3e55a8ea7ca19fcd21912aa5","observation_id":"98bec6d5-610a-4f6a-8e1a-65e2c26724f6","resolution":{"observed_at":"2026-08-06T19:10:20.326249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.308238Z","title":"S., G OULEAKIS , T., PEEBLES , J., R UBINFELD , R., AND YODPINYANEE , A","venue":null,"work_id":"f6b33928-a060-416a-a2b5-bf50097c0836","year":2018},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.194881Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:4a2ae9e9523e50738c5576633256b28625c7af80a691ea768e5e13b19218808b","observation_id":"64f3b419-031a-46e5-aa22-2c96592d8f2e","resolution":{"observed_at":"2026-08-06T19:10:20.312229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.293645Z","title":"Counting triangles in large graphs using ran- domized matrix trace estimation","venue":null,"work_id":"004490cc-7269-4b40-9eff-d043063a9543","year":2010},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.199350Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:ff3e36d2742986b0ec63fdbc3741d1ee7a47147e832008e355145488140a1848","observation_id":"774dea46-c12e-4958-8949-ed6fcb779350","resolution":{"observed_at":"2026-08-06T19:10:20.298088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.279652Z","title":"The privacy blanket of the shuffle model","venue":null,"work_id":"77554e27-f29c-4bb0-9915-31382ea3d1d4","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.204338Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:40cb603c63033cc6831d8a10799c29da6518d4eb826ce96ef29f8deb54901939","observation_id":"9f0a5173-de71-42f4-a74b-613aaf6f26eb","resolution":{"observed_at":"2026-08-06T19:10:20.284240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.265165Z","title":"K., AND SESHADHRI , C","venue":null,"work_id":"1d714a6f-b612-46e1-b147-4c2ace18d9cc","year":2020},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.208912Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:da0c4d5a1cb6adc96c42fbb69c3471936e1c4f7d6a79a8a21d02cc729ce9411b","observation_id":"89b4887c-3f4c-434a-a26c-6e03407a65af","resolution":{"observed_at":"2026-08-06T19:10:20.269512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.251677Z","title":"W., SCHNEIDER , S., AND KERSCHBAUM , F","venue":null,"work_id":"fccdf65c-6f86-4843-857d-2d5784db1a22","year":2021},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.213720Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:b69b107cb5f4abe8f853da0725c54a4c00a5af91ee3fdfc7f5bd9db888b98be4","observation_id":"9aa83368-b493-40b8-8879-9371d186dc30","resolution":{"observed_at":"2026-08-06T19:10:20.255878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.237257Z","title":"A privacy- preserving mechanism based on local differential pri- vacy in edge computing","venue":null,"work_id":"e913b07c-593f-4548-aecf-99215ee6d16e","year":2020},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.218370Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:843af296a2d1cb0a6bc0ce90ee8eb8924dd17fef9feda87dfea338580c81faf2","observation_id":"d12cfdae-70dc-4ab3-8ce8-ec780953d456","resolution":{"observed_at":"2026-08-06T19:10:20.241986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.224138Z","title":"Approximate counting of k-paths: Deterministic and in polynomial space","venue":null,"work_id":"05d8203c-0ca9-476b-9f0c-62ffa33f8dca","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.222408Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:54ff57c0e99520722a2c602011494b9a267f627632d3b5be3efb5e98f208aef5","observation_id":"5ac99d6a-7196-4cc8-b979-ef3fa67802e4","resolution":{"observed_at":"2026-08-06T19:10:20.228220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.209421Z","title":"Distributed differential privacy via shuf- fling","venue":null,"work_id":"6c441684-38c7-43a3-bd5b-4c6c7b4a470e","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.226123Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:322f6bb59ca799e5a48e2ba816552902c79306d781bcf014f3f4120815866a11","observation_id":"ef3cbb5f-305f-432d-b6c4-0e60be63ae80","resolution":{"observed_at":"2026-08-06T19:10:20.214054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.194113Z","title":"Arboricity and sub- graph listing algorithms","venue":null,"work_id":"6931d3d3-a3e8-4956-a1b2-51ae6f9191c8","year":1985},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.230376Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:6d6047c1a19f4c7c94db094ad105bab37feeda4cff22fa978c5fd14d3f318bda","observation_id":"2c0ea86d-42c0-4c10-ade5-288cf3ba170e","resolution":{"observed_at":"2026-08-06T19:10:20.199080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.180355Z","title":"Matrix mul- tiplication via arithmetic progressions","venue":null,"work_id":"ddcf2855-078c-495b-8a45-c5fb2157824c","year":1987},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.234473Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:7263136dcab614ada6c8f5bc7e47970136079f1926d84509229bde183cd3b26a","observation_id":"9ac97b1d-fd91-4c3a-abac-f97635ac77a5","resolution":{"observed_at":"2026-08-06T19:10:20.184445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.166761Z","title":null,"venue":null,"work_id":"e6cdbdf7-0272-44cc-be5d-493f67406103","year":2022},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.238632Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:6a23fc92e6af4ed1cb1c8442bb42ef212aca7eb29a9973da79af5587c4ab0fa5","observation_id":"5a45ae88-30dc-45c6-b65f-e9a7bb7e82ed","resolution":{"observed_at":"2026-08-06T19:10:20.171009Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.152790Z","title":"Faster matrix mul- tiplication via asymmetric hashing","venue":null,"work_id":"68a08e60-ae29-4214-8722-7189438f586f","year":2023},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.242677Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:4424a0ccd345d6092514002e9020dd0bfdd471f5f8526dbc81dc1c58fb40c9c0","observation_id":"fc6a1c2e-913a-4bd1-a6bd-63fb236d78a9","resolution":{"observed_at":"2026-08-06T19:10:20.157401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.139827Z","title":"Differential privacy","venue":null,"work_id":"ecbb2fb8-2d6f-4ce1-b253-04431186986e","year":2006},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.246744Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:263f66493e3a80c72854f1df82dd8623aa5fd8a987fc5a959b550775a2ad06cb","observation_id":"b5a6bec9-0ccd-426b-97ad-50a1a44a3bbc","resolution":{"observed_at":"2026-08-06T19:10:20.143676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.126198Z","title":"Calibrating noise to sensitivity in private data anal- ysis","venue":null,"work_id":"db6e7dfd-f309-4e4d-97e9-54486dc1e51d","year":2006},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.250744Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:52e370ace053b788cbebc36a400496b7871a89ed8a588e8f7c1b765bd22d731e","observation_id":"5195ab32-8932-48c2-92ab-301a77e30b3a","resolution":{"observed_at":"2026-08-06T19:10:20.130666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.112004Z","title":"The algorithmic founda- tions of differential privacy","venue":null,"work_id":"b2197e22-4c27-42a6-b87b-e439ff5536ee","year":2014},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.254786Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:2a5dde450b6fcb4c08908e493dd0a48d470812928dddc80f275f2a5be65e5fc3","observation_id":"43c15dd8-d91b-4215-8784-6590356b1d58","resolution":{"observed_at":"2026-08-06T19:10:20.116222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.097017Z","title":"Approximately counting triangles in sublinear time","venue":null,"work_id":"54dccb83-0a35-467e-92c5-a75a4b2699a9","year":2017},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.258657Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:77224f388a477929b17ad11ab157da8ede486f0aa6c5555009425dfaa11ce22f","observation_id":"f2436c97-5958-4b3a-bfea-9a9b9d475778","resolution":{"observed_at":"2026-08-06T19:10:20.101664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02263","last_updated":"2025-08-14T22:33:06Z","snapshot_observed_at":"2026-07-06T15:22:51.488613Z","submitted_at":"2023-05-03T16:50:29Z","title":"Triangle Counting with Local Edge Differential Privacy","version":3},"cited_work":{"arxiv_id":"2305.02263","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.02263","snapshot_observed_at":"2026-08-06T19:10:19.491933Z","title":"Triangle Counting with Local Edge Differential Privacy","venue":"cs.DS","work_id":"5290ad31-d3f8-4897-9a3c-8230f0e899b0","year":2023},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.262676Z"},"links":{"cited_paper":"/paper/2305.02263","citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:47889bbd960e783c8737f185a7f28ea92c8eeb2778c5d00ae0c8d72f45037e82","observation_id":"40d4a52c-9c22-4309-9967-a299448a925c","resolution":{"observed_at":"2026-08-06T19:10:19.499020Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.082626Z","title":"Amplification by shuffling: From local to central differential privacy via anonymity","venue":null,"work_id":"fe2aaf5c-d710-47b2-929b-3c3f286529ab","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.266886Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:89977d5d98548173269d5c864379f266486a7814ebf44b14aedf95c6d356fa2f","observation_id":"8f48af87-0abb-448e-be46-a2d04dc9ef41","resolution":{"observed_at":"2026-08-06T19:10:20.087089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.068585Z","title":"Hiding among the clones: A simple and nearly opti- mal analysis of privacy amplification by shuffling","venue":null,"work_id":"f6761e11-d233-46d1-8969-e94171d73954","year":2022},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.271503Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:bafe98d0e692dccf449269367483b87710c145a204013c035d1f0a79f0ac26b2","observation_id":"f503929c-9bef-4f7e-b747-6d78ad1701a3","resolution":{"observed_at":"2026-08-06T19:10:20.073022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.054126Z","title":"Counting stars and other small subgraphs in sublinear-time","venue":null,"work_id":"5abaf46a-b5c7-48cf-bd36-524f4c97aa5e","year":2011},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.275225Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:dc4ad6b07fff5da96a3675dbc120bf28783e16bdda929f433b8aca5402e08a1e","observation_id":"694d0db7-53a5-48e0-a61f-32de447359c9","resolution":{"observed_at":"2026-08-06T19:10:20.058631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.039437Z","title":"Lo- cally differentially private analysis of graph statistics","venue":null,"work_id":"b5d7e055-5837-4b4f-8eb1-b321378a53df","year":null},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.279272Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:a7d57a39c4fe3138dde9f632e987fff3e06576eaa8292ec708ed47f561482382","observation_id":"99b33cdb-e87f-430f-883c-01873b9cd1a2","resolution":{"observed_at":"2026-08-06T19:10:20.044242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.024764Z","title":"983–1000","venue":null,"work_id":"53d3b5db-722d-4ec3-88fb-7776cda496aa","year":2021},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.283942Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:d96a722f92c9edcbb255aaef5345e621099c13e5099f603b27fba22084a64545","observation_id":"4a5f2439-5a13-4031-9190-8d40c9101a2a","resolution":{"observed_at":"2026-08-06T19:10:20.029539Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:20.009090Z","title":"{Communication-Efficient} triangle counting under lo- cal differential privacy","venue":null,"work_id":"1c63d52b-7f7c-41d6-b931-d3d1d0153d95","year":2022},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.287858Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:8761ce6e8ff209dd9756dc2ba588f680f5035fc8413eca5941de3571633fdb43","observation_id":"ff886fb2-f81b-4f72-b29f-1338bd6227a1","resolution":{"observed_at":"2026-08-06T19:10:20.014678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.994761Z","title":"Dif- ferentially private triangle and 4-cycle counting in the shuffle model","venue":null,"work_id":"5acefa09-f882-4a96-8245-32e7639a8a17","year":2022},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.291716Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:3c092ecdacab88c66e9f33bf59a6e247145a22614b08a5c8eb9baecddf90b29a","observation_id":"23544088-ed96-43fc-8652-6cf50f6b092c","resolution":{"observed_at":"2026-08-06T19:10:19.999228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.979958Z","title":"Publishing graphs under node differential privacy","venue":null,"work_id":"f8d85b68-0b12-4ba4-a7ee-9bd84c02a566","year":2021},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.296127Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:baac70fdbfde530bbaad9503538b66501cd13d585e2161bdeba7f2cd50b578e7","observation_id":"32081c39-8b29-459b-8217-7bfe3a66e6e2","resolution":{"observed_at":"2026-08-06T19:10:19.984583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.964163Z","title":"Dis- crete distribution estimation under local privacy","venue":null,"work_id":"0199b9c0-f973-40e1-90be-bdc8ff3e8f3b","year":2016},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.300394Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:abb3adfff30f5604e19b7fb6fc82858cc3417857114a4dc8289c0fcaef5c6ad4","observation_id":"6be7b2ab-bddc-4b9b-b5df-f2a6c90649d0","resolution":{"observed_at":"2026-08-06T19:10:19.969612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.949264Z","title":"The complexity of counting cycles in the adjacency list streaming model","venue":null,"work_id":"e8aaf468-ccda-49b2-a536-3aa5e3cfcd79","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.304680Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:831ace1c0fcc332c2cb0551260b2e51f52b041f9ac6f01d4b88fdcd45872ac84","observation_id":"ccb3dc0b-ec93-4cae-b997-792f2df31be7","resolution":{"observed_at":"2026-08-06T19:10:19.953606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.935733Z","title":"P., AND KIM, S","venue":null,"work_id":"be76c9b0-b19c-487b-852c-0d93bb4e5a55","year":2018},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.308825Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:e433a57cf47ce323c51820327643fb9e6cfe4cf35bf5ab3a20616278229f4f76","observation_id":"f56d67e3-c056-4ec1-b3d1-2bf2919bc6c3","resolution":{"observed_at":"2026-08-06T19:10:19.939948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.921382Z","title":"P., N ISSIM , K., R ASKHOD - NIKOVA , S., AND SMITH , A","venue":null,"work_id":"ecbe7a9e-4b39-4429-b8b0-c33e2714c6ec","year":2013},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.312578Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:605e190189dcb177bd48e5262e2e572736ad023b11310f3c7f4b4c8385de9a4b","observation_id":"203eb358-9b48-4c42-8acc-f7a829a9a922","resolution":{"observed_at":"2026-08-06T19:10:19.925989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.907472Z","title":"N., M ILLER , G","venue":null,"work_id":"6cca2cb3-d06b-4970-868f-a633f2119430","year":2012},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.316971Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:83930e986fc3b0d0b130ee3349a19379148963b65a4e6e9fba8dc3ab972c69b1","observation_id":"51c10957-205a-4d42-9874-71aa93a0793a","resolution":{"observed_at":"2026-08-06T19:10:19.911711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.892913Z","title":"Powers of tensors and fast matrix multi- plication","venue":null,"work_id":"4ac0e218-de3f-4ab4-a37a-57da796d3f80","year":2014},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.320996Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:ace294a10ae4563407ad15f764df63c69c09fbaea78b2425aaff8bcfb66527f7","observation_id":"c081d573-4561-486a-9adc-6af8980784a6","resolution":{"observed_at":"2026-08-06T19:10:19.898125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.878761Z","title":"Graph evolution: Densification and shrinking diameters","venue":null,"work_id":"0f92f3fb-448b-4a1f-9d1a-8a428e93d65d","year":2007},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.325367Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:a06afaf2b2b7c86bf55658c0f1cadb5d26cc40c8a823d17cf1dc23f19626b0c2","observation_id":"4c947629-9f3f-45b5-816c-47ee24407003","resolution":{"observed_at":"2026-08-06T19:10:19.883109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.865163Z","title":"SNAP Datasets: Stan- ford large network dataset collection","venue":null,"work_id":"d4bc1034-66d9-4030-9b5f-0355dc1e2dff","year":2014},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.329356Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:fd938d267745a1f16a0689415bb46f3f45bbde558caba1d50f3202102bebbee2","observation_id":"7b5584b4-38e4-446f-a7c6-ab2c6867d678","resolution":{"observed_at":"2026-08-06T19:10:19.869359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.851583Z","title":"Learning to dis- cover social circles in ego networks","venue":null,"work_id":"01bdd9dd-42d0-48d5-b863-e0e8439e8143","year":2012},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.333448Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:2af1da8c39a02a2c131797b7c27a87b7c4de08036e02dfde83140bbbc08e23e8","observation_id":"bbec5c9f-d738-41b7-baa6-f7dcf48c2e34","resolution":{"observed_at":"2026-08-06T19:10:19.855831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.838607Z","title":"Collecting triangle counts with edge relationship local differential privacy","venue":null,"work_id":"c00e649c-ed0d-4227-82cf-1eb2845cec2d","year":2022},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.337786Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:c36639c806f1c450f8fc69ff0ac49617f50fceca216dd0dbfe6a337d536cf5cf","observation_id":"f333449b-6d89-4d6c-a644-90990efe0c87","resolution":{"observed_at":"2026-08-06T19:10:19.842786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.824897Z","title":"Approximate counting of cycles in streams","venue":null,"work_id":"dfffdca7-0bb5-4598-8668-2a417380ee13","year":2011},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.341638Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:f4e235e7b3898bbaeaed2ce80debd3cc8db63d23f6d5b5d8c76f288703ff5979","observation_id":"b1a0ba05-c842-4d13-8af5-c9cde42ad36f","resolution":{"observed_at":"2026-08-06T19:10:19.829456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.809777Z","title":"Triangle and four cycle counting in the data stream model","venue":null,"work_id":"c3164568-9832-41e1-b9ed-0ee02c924c02","year":2020},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.345455Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:99accfab5519003742155e871e81cb98d7d8200627756e5f5ddb9e4685a5697f","observation_id":"b9fafa62-d4a4-4347-bcc4-db9951067767","resolution":{"observed_at":"2026-08-06T19:10:19.814418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.795754Z","title":null,"venue":null,"work_id":"a8fa9522-cf57-420c-9655-814d7dcba193","year":2009},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.349371Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:cfe7a7350b3b64c80d44e38646e57fe71f47e80f5a2f45e9d597580bb7cc2d98","observation_id":"3d51a4a6-9aab-49ef-9c10-ad0b50c7dbdf","resolution":{"observed_at":"2026-08-06T19:10:19.799970Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.781055Z","title":"The number of data breaches in 2021 has already surpassed last year’s total, 2021","venue":null,"work_id":"4661eefd-f32e-4732-86bb-2ddbcfdb14a5","year":2021},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.353375Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:117337d7fc079594998e846a3ab9bcfd9be784223737ec45064142dddad9059d","observation_id":"4669150d-7bb3-4a90-a26c-9b1fdda29ef0","resolution":{"observed_at":"2026-08-06T19:10:19.785819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.767139Z","title":"{Utility- optimized} local differential privacy mechanisms for distribution estimation","venue":null,"work_id":"8feb32d8-d106-4779-99df-0c7a7ead2214","year":2019},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.357304Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:c60060e8f008cebcc122cb62920906032ca8a0899ca20fcd7f60972c63719e6b","observation_id":"3fbbd61c-2f8c-4836-ab26-3cb612521674","resolution":{"observed_at":"2026-08-06T19:10:19.771703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03561","last_updated":"2022-05-27T12:03:31Z","snapshot_observed_at":"2026-08-09T02:22:29.884541Z","submitted_at":"2020-09-08T07:37:23Z","title":"Local and Central Differential Privacy for Robustness and Privacy in Federated Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03561","snapshot_observed_at":"2026-08-06T19:10:19.361450Z","title":"Local and central differential privacy for robustness and privacy in federated learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.361450Z"},"links":{"cited_paper":"/paper/2009.03561","citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:5f3f7b573a29982103b64e96e02994555133f9a4fa8c96c9c4c8051aabb75cc6","observation_id":"c0b7364a-df6e-4da4-ba27-f9e313e64a7d","resolution":{"observed_at":"2026-08-06T19:10:19.361450Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.752944Z","title":"Faster approximate subgraph counts with privacy","venue":null,"work_id":"bd8aaa28-8f33-4908-84b6-8bdea8c842b4","year":2024},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.365727Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:08738f68d7eca97fb0ba2d340a898e7ae7a0feaeed7278f1982c509eaf0c46b1","observation_id":"328bcf86-0609-44b9-9cd7-0bd90a607604","resolution":{"observed_at":"2026-08-06T19:10:19.757193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.738653Z","title":"Smooth sensitivity and sampling in private data anal- ysis","venue":null,"work_id":"b2976177-6fd1-4572-bbca-7eee81b8b880","year":2007},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.370108Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:eb4d9f877d1722c9982ca02f1219307758d1cc34db951efd538addd6af92f062","observation_id":"57f4f3c8-f326-4e56-ad63-96aadd61fb21","resolution":{"observed_at":"2026-08-06T19:10:19.743335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.724557Z","title":"Triangle listing al- gorithms: Back from the diversion","venue":null,"work_id":"06a55866-b25c-4e6c-9730-057df50115a6","year":2014},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.374546Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:2636b3b6003315d6ef0da3a04f76490a709064beca6ffd9d0def206397043fef","observation_id":"a08866ad-84a4-4d1d-a632-4e390e21be04","resolution":{"observed_at":"2026-08-06T19:10:19.729057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.711373Z","title":"Generating synthetic decentralized social graphs with local differential privacy","venue":null,"work_id":"47e8ec32-a078-4d8e-ad01-d7e9dfb8194a","year":2017},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.378492Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:31bd5331ce0f5724618af90a984a95b6f8a738f9a75d7364a0554d50340f6606","observation_id":"6c4bb8f1-c1fd-40db-bb31-3bc8ca951185","resolution":{"observed_at":"2026-08-06T19:10:19.715666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.697833Z","title":"Differentially private analysis of graphs","venue":null,"work_id":"e6ac9adc-624f-42ea-956f-93a31b03d607","year":2016},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.382774Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:a761f894f59bb249e9f203edd7f6213dd0287d9ac1d3733ee2b37f64eb88635e","observation_id":"f40d30c0-c343-4556-b5ba-0beade384baf","resolution":{"observed_at":"2026-08-06T19:10:19.702229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.684454Z","title":"E., A PARICIO , D., AND SILVA, F","venue":null,"work_id":"f368b93a-82e4-4e42-9e3b-7b0e6d7efa49","year":2021},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.386687Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:8957ae468987b1dc3e58cb904207da157d14d1b52ddc66b76b11d3b04fcca2fa","observation_id":"c09d4228-c67a-4154-ac3d-b881b0b749e1","resolution":{"observed_at":"2026-08-06T19:10:19.688384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.671157Z","title":null,"venue":null,"work_id":"9d3d0b30-cae6-434e-8359-9d926d005637","year":2014},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.390586Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:b0948a3c97aad207a44ddc1a80e690dc471f9a4bd87d129bc7dfb40ad42ca61a","observation_id":"eaed251d-cc55-4bf0-85fe-f05ee9bf0fda","resolution":{"observed_at":"2026-08-06T19:10:19.675401Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.658099Z","title":null,"venue":null,"work_id":"2d5c40eb-663d-4a77-9f2f-635bf93709c0","year":2013},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.394553Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:9d55e4f739dba2b8c1b332ed770992c0420eca2826325f7f42e4817d04afc558","observation_id":"90d6962a-ecbc-4e0f-a275-d15310d3f239","resolution":{"observed_at":"2026-08-06T19:10:19.662401Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.644352Z","title":null,"venue":null,"work_id":"79a71b78-f52f-4e4f-a00a-915a58224d40","year":null},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.398419Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:7bf734b624c0d269519f1d34807489d1f69bb92564741fb0a4c556228009b995","observation_id":"93560de0-9265-44fa-933c-0b8890d13ef8","resolution":{"observed_at":"2026-08-06T19:10:19.648515Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.630320Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":"7bd7d51d-b89d-4262-a5b7-df797820999b","year":1969},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.402868Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:7406b7ab4f46dcbe964a8fa00e231ae56b281f94d8943bb331b11f677103334a","observation_id":"998eb9f8-a44f-4ce2-ba34-60d695b98cdc","resolution":{"observed_at":"2026-08-06T19:10:19.634649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.616208Z","title":"E., K ANG , U., M ILLER , G","venue":null,"work_id":"b85c3a05-05fa-474e-b5d9-108f3fde26f1","year":2009},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.407049Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:0a491496ae6857a54f9cfa91be0ec03239dc53136529c2fe3e335b830e257077","observation_id":"b813027a-08fc-4f1a-9055-4cee7e04a4cd","resolution":{"observed_at":"2026-08-06T19:10:19.620585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.601896Z","title":null,"venue":null,"work_id":"aaa30558-9a48-440b-9169-94649480fae0","year":2010},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.411091Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:d0ebda96f7764d9c8d49ee1e971eb59cadfa2435f84194d66140b75f181de364","observation_id":"0e3dc45c-bbc8-4be6-a6d6-4389f92a7b2d","resolution":{"observed_at":"2026-08-06T19:10:19.606270Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.587467Z","title":"Locally differentially private protocols for frequency estimation","venue":null,"work_id":"e9155f10-413e-41ee-bde9-eef55eb250c2","year":null},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.414925Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:3bc106739eaf921c8a0a41e6d5196bff26f4b7c4146d7c59cbfceb110bfb8d4a","observation_id":"8a3326c0-ccab-420a-b5c9-33672648f4d3","resolution":{"observed_at":"2026-08-06T19:10:19.591873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.571648Z","title":"Edge-based differential privacy comput- ing for sensor–cloud systems","venue":null,"work_id":"aa8e59dc-13e8-499b-a982-3c09a1a08f73","year":2020},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.419555Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:294795b185a2cbd51f287af8113c2384d5c7336e1a0bad270760f71a37add41f","observation_id":"15337bc7-64bb-437a-b393-c6e51ce897eb","resolution":{"observed_at":"2026-08-06T19:10:19.576605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.555118Z","title":"Using randomized response for differential privacy preserving data col- lection","venue":null,"work_id":"13e7c735-c953-44b7-a820-ccbad2e94d46","year":2016},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.423657Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:8d58f44224f345de53812ba134c65128033589c7bd338ad7c36736ec47baa70a","observation_id":"94be922f-2957-47a0-800f-4378c96cd8c0","resolution":{"observed_at":"2026-08-06T19:10:19.561086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.540275Z","title":null,"venue":null,"work_id":"6e743b32-f0ed-4ea1-b32d-c9abdbef1143","year":1965},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.428218Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:586f444bd78c20b8db05df55bac7dc59f16d839d4bb7270ec6e890624b920426","observation_id":"e5bb9d94-9ae0-47cd-b792-fbb2cbb02e07","resolution":{"observed_at":"2026-08-06T19:10:19.544694Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.525008Z","title":null,"venue":null,"work_id":"87cd8970-9c1d-4495-a5d3-a0ec86eac7ec","year":2012},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.431979Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:cce373a43f3a9220690819639741177f381cea557e9b9ae3fd16f4c096653a97","observation_id":"036f43fd-06ee-45a5-9ae9-9d6c6210d063","resolution":{"observed_at":"2026-08-06T19:10:19.529390Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:10:19.509672Z","title":"n1 ∏ i=1 Zki αi #2 + E","venue":null,"work_id":"071b83fd-88f3-4b96-969f-bd8dca942b66","year":2024},"citing_paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T19:10:19.436912Z"},"links":{"citing_paper":"/paper/2507.06508"},"observation_digest":"sha256:af6ab8015e316748670d3c1a293f80f1a12543d649e160eaf0a4d92f71e330c7","observation_id":"b1de0fd1-621c-43a3-b99d-03a22ee73e83","resolution":{"observed_at":"2026-08-06T19:10:19.514574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2507.06508","last_updated":"2025-07-09T03:13:15Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-06T18:59:53.635314Z","submitted_at":"2025-07-09T03:13:15Z","title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":1,"unresolved":9,"verified_exact":0,"verified_fuzzy":49},"total_outbound_references":60},"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 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2507.06508."}