{"as_of":"2026-08-10T20:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed78d73975d1d14a18dac1e602c3e44a88c4c09d4b5a41edbd3fce7597df7b99","coverage":[{"denominator":109,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:56:16.126610Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T02:14:13.160967Z","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-25T02:15:14.220292Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"cited_work":{"arxiv_id":"2506.20828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20828","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv:2506.20828 [cs.DS] https://arxiv.org/abs/2506.20828","venue":null,"work_id":"86334654-9adb-4d00-9de0-1280447a142c","year":null},"citing_paper":{"arxiv_id":"2605.23887","last_updated":"2026-05-22T17:47:45Z","snapshot_observed_at":"2026-08-08T17:52:09.880645Z","submitted_at":"2026-05-22T17:47:45Z","title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-25T02:14:13.160967Z"},"links":{"cited_paper":"/paper/2506.20828","citing_paper":"/paper/2605.23887"},"observation_digest":"sha256:e1730bb7ba1fe0bfad4de0396794307dcda8bd7c428ae30a03b9d644c38484ac","observation_id":"3e544212-1a5e-4ffc-bfa3-8d1931e05e7c","resolution":{"observed_at":"2026-05-25T02:15:14.222666Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20828/citation-record","integrity":"/paper/2506.20828/integrity","json":"/paper/2506.20828/citation-record.json","paper":"/paper/2506.20828"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.763395Z","title":"DistributedLEDPGraphAlgos","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.763395Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:09ed496bdce0f25651692cdcc68accd078e2b146b12ed02930d9c2dd074eaac9","observation_id":"28235836-4386-473f-98b0-be0c7bc4fea7","resolution":{"observed_at":"2026-08-06T22:56:15.763395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.768584Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.768584Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:556d978a3cf7218c8887e167ee11f2f42ebe2c453bd6b2107cb4ce60ad86e1a5","observation_id":"5516f18f-743f-464c-b213-8c48b20ec9ae","resolution":{"observed_at":"2026-08-06T22:56:15.768584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s012918312150087x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"International Journal of Modern Physics C","work_id":"69cae73d-22ba-4eb7-84c4-3698427d5ca4","year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.772289Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c7a1271eaa874a21b030906e855c6608242b0a33c1a66d988f6ab0b1a9ead5d3","observation_id":"82f496a1-ff54-4c91-97d0-b76bbf3f55af","resolution":{"observed_at":"2026-08-06T22:56:16.232344Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.775737Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.775737Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:a38068425fe9f6801b0068d9b675e2ed2f28e11f458b63c6fbe2e2fa39e05327","observation_id":"55e77149-9970-41c8-a754-56e19472b824","resolution":{"observed_at":"2026-08-06T22:56:15.775737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.779022Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.779022Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:4d16ba009b829add21d230e0b9f4d4cf7861352356293dec7372911a46c55a3b","observation_id":"74bd1d86-96be-4f38-ade5-dbc083d7f372","resolution":{"observed_at":"2026-08-06T22:56:15.779022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.782390Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.782390Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:f552ca059704d547c51142e625d9fb330ea4f11ff3e07abc5b99a6a094d0edd5","observation_id":"e39814a8-9ae7-4df5-a9e7-f6d67b0c4d66","resolution":{"observed_at":"2026-08-06T22:56:15.782390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.785981Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.785981Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:17695e1d443a88ba539dce771e535f84800022a4efa12e7f8c0fd455211628b3","observation_id":"3d083f82-fce0-4493-8556-a0fd1df6d3de","resolution":{"observed_at":"2026-08-06T22:56:15.785981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15379","last_updated":"2025-02-21T11:04:43Z","snapshot_observed_at":"2026-08-07T17:59:04.777103Z","submitted_at":"2025-02-21T11:04:43Z","title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15379","snapshot_observed_at":"2026-08-06T22:56:15.789156Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.789156Z"},"links":{"cited_paper":"/paper/2502.15379","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:7c7297e95f4c291de7710c2d215a925168635b51f210369b14b2dba226c4bdca","observation_id":"279f9269-f603-4d66-8c1a-9f3f71ce7482","resolution":{"observed_at":"2026-08-06T22:56:15.789156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15379","last_updated":"2025-02-21T11:04:43Z","snapshot_observed_at":"2026-08-07T17:59:04.777103Z","submitted_at":"2025-02-21T11:04:43Z","title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries","version":1},"cited_work":{"arxiv_id":"2502.15379","doi":"10.48550/arxiv.2502.15379","metadata_source":"pith","pith_arxiv_id":"2502.15379","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries","venue":"cs.DS","work_id":"7487c4fa-c68f-49e4-a3ac-1cedaca5eaa2","year":2025},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.792654Z"},"links":{"cited_paper":"/paper/2502.15379","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:a5d12d39ae8d3bceccac30fa01cf15e2b540791272aecde279cc32c4c83fd2a5","observation_id":"aaffc6a2-2468-4e47-94bb-af8697f8b900","resolution":{"observed_at":"2026-08-06T22:56:16.221997Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.796436Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.796436Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:b8c39d5fb81e1c55965580e6e2cbd9c1a8e38a4443143161555eae95dec1d9e4","observation_id":"42a311c8-7ce6-4527-8613-aea8ecc14ec9","resolution":{"observed_at":"2026-08-06T22:56:15.796436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.799674Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.799674Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c8b07df22e90dbf8fc8b899f0ccc3cf44368961463aa38de4346efa4152f13ce","observation_id":"670d10ca-fb82-4ddb-9ef8-1c758defffc3","resolution":{"observed_at":"2026-08-06T22:56:15.799674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.802902Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.802902Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:964e7b672733592f72d93bd56fc9e60e622bddbcd2df5bc6e3475cbff3126918","observation_id":"ae669a82-2f39-441a-8597-55fe11d378c3","resolution":{"observed_at":"2026-08-06T22:56:15.802902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.806102Z","title":"Hubert Chan, Elaine Shi, and Dawn Song","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.806102Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:7a5becbc391953c48b5fdf944c6052dd9a5f0ea3b6c02ed57f3853bca071cdbd","observation_id":"bf654941-62b5-47bb-924f-605e420e1532","resolution":{"observed_at":"2026-08-06T22:56:15.806102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.809168Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.809168Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:02cbf469eeb09a276100b8a82fe0fbaf5a235c2317f67f66406c1da27bdb4fb5","observation_id":"bd8367df-667b-44b2-a357-2777aad83d12","resolution":{"observed_at":"2026-08-06T22:56:15.809168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.812904Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.812904Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:3a52ce6d0327c8c2d1578d99f464e089fdf72710ea9a37b192b4b6d43d393a5b","observation_id":"47408119-864c-4b58-8d3a-5f952ff416be","resolution":{"observed_at":"2026-08-06T22:56:15.812904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.816217Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.816217Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:4167a80f86f48c482e2ef91c3d676a183fa28808c31f9aa324829bfd053cc30e","observation_id":"5b8af7d1-a69b-4087-9475-197449559a45","resolution":{"observed_at":"2026-08-06T22:56:15.816217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.819291Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.819291Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:41ff34adf1cce976d0488b55ae4239913271557947ea1708dfc8d09c54d1de52","observation_id":"4de76514-7d3c-4c29-a7f1-21c45a57d044","resolution":{"observed_at":"2026-08-06T22:56:15.819291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07706","last_updated":"2024-02-29T03:22:51Z","snapshot_observed_at":"2026-07-06T17:00:45.756069Z","submitted_at":"2023-12-12T20:09:07Z","title":"Near-Optimal Differentially Private k-Core Decomposition","version":2},"cited_work":{"arxiv_id":"2312.07706","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.07706","snapshot_observed_at":"2026-08-06T22:56:17.293109Z","title":"Near-Optimal Differentially Private k-Core Decomposition","venue":"cs.DS","work_id":"bbb92dce-ae1e-465f-95f7-37d01c24c8a3","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.823491Z"},"links":{"cited_paper":"/paper/2312.07706","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:47563c86626d2a9d9ddfeeecc2a9f50ed2a235cd9e3c6fca01dc90415515cd3a","observation_id":"70a38d90-6c26-47eb-8031-2af345437f19","resolution":{"observed_at":"2026-08-06T22:56:17.296177Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.826955Z","title":"Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, and Shangdi Yu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.826955Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:b08b7daf58d66f9f95a2fe028fd6236e99f2f289442a8fd38e7b10415925ecf0","observation_id":"a8e4d7f8-a59c-4a42-aa5c-cd30014af9a6","resolution":{"observed_at":"2026-08-06T22:56:15.826955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.829979Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.829979Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:a261f65508cd776ce7d8506b8611d6873ac56ba5be785e10607d9cd57a08f8cc","observation_id":"2316dc9c-4d8b-40e4-94ba-917afc65f84e","resolution":{"observed_at":"2026-08-06T22:56:15.829979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.837010Z","title":"Donovan and Brian W","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.837010Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:26b0c0f96e44a917874e9fb456248641601b434751e6fa4de865800e9ebe50d8","observation_id":"79f79518-93f5-4a79-9d18-24c5f12a0f76","resolution":{"observed_at":"2026-08-06T22:56:15.837010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.840041Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.840041Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:a12e878c19fd4a85989d4ea3b3458ed4d97f9854727287ef997e5d2e8b05cfc9","observation_id":"29645583-e8d2-42b3-b073-9164d25e15e9","resolution":{"observed_at":"2026-08-06T22:56:15.840041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.843162Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.843162Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:548217f283d1340199b76d9a959bbf4d69efdf3892780400340101a0e52f7c7a","observation_id":"fbbbf2df-41f6-4e98-bde2-280b6b0d0b66","resolution":{"observed_at":"2026-08-06T22:56:15.843162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.846262Z","title":"Rothblum","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.846262Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:f3e67442b796b5adb990a4f034d6e19958b0d848fcd492710093c02beda5498e","observation_id":"b6cf2a59-85e0-4151-88d2-602c0fa1c151","resolution":{"observed_at":"2026-08-06T22:56:15.846262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.849737Z","title":"Rothblum, and Salil Vadhan","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.849737Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:b46b9d271b802e8dda776b55058f4bc267ef19b0768162c20e05893e45bdf7cd","observation_id":"770c6168-54fa-4cc8-9266-ddf422b4bf8a","resolution":{"observed_at":"2026-08-06T22:56:15.849737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.853180Z","title":"Liu, Sofya Raskhodnikova, and Adam Smith","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.853180Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:31e563a7cca6a8d4415d0c064eb6fdc21a3c7b68b8a38189b0d365067d33d68d","observation_id":"db4eb76c-f2d5-416f-ab81-a5cc80a5bad6","resolution":{"observed_at":"2026-08-06T22:56:15.853180Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.857212Z","title":"Liu, Sofya Raskhodnikova, and Adam D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.857212Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:80380497510f25ecf1c3e838d5e33375d3fad68d2889a0f408f526949f9655cb","observation_id":"e3c02521-cecd-4e62-8653-e9e11fcca181","resolution":{"observed_at":"2026-08-06T22:56:15.857212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.860415Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.860415Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c596928b8c618f4200a88bdc28603ca2478d4d1535c098ef2edec23462557349","observation_id":"5d18d0ac-d709-4287-bdb8-d0d114e5eb15","resolution":{"observed_at":"2026-08-06T22:56:15.860415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.00508","last_updated":"2022-11-14T18:07:07Z","snapshot_observed_at":"2026-08-09T13:46:02.648463Z","submitted_at":"2021-06-01T14:11:18Z","title":"Differentially Private Densest Subgraph","version":2},"cited_work":{"arxiv_id":"2106.00508","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.00508","snapshot_observed_at":"2026-08-06T22:56:17.267250Z","title":"Differentially Private Densest Subgraph","venue":"cs.CR","work_id":"8b38d436-4a18-40b8-af37-a279fb7fd2d7","year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.863555Z"},"links":{"cited_paper":"/paper/2106.00508","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:e4885fc0b42a0f433ae1bdec592c2563d74f1ce95145a39fc0596e253440ae30","observation_id":"bde1b451-4c60-4309-8f56-f07940252bd5","resolution":{"observed_at":"2026-08-06T22:56:17.270308Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04117","last_updated":"2022-04-14T14:22:35Z","snapshot_observed_at":"2026-08-10T12:40:42.153132Z","submitted_at":"2020-12-07T23:51:19Z","title":"Local Dampening: Differential Privacy for Non-numeric Queries via Local Sensitivity","version":3},"cited_work":{"arxiv_id":"2012.04117","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.04117","snapshot_observed_at":"2026-08-06T22:56:17.254219Z","title":"Local Dampening: Differential Privacy for Non-numeric Queries via Local Sensitivity","venue":"cs.CR","work_id":"ffc4010a-98d3-4b34-9e75-16239ed01a18","year":2020},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.867605Z"},"links":{"cited_paper":"/paper/2012.04117","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:d68e6aa3f668f1a171cc2a900261c0b0b6a94b6d964fa933ed233fbe38ab3fc2","observation_id":"edffbff5-f9cb-4d3f-bb45-a36679ed494e","resolution":{"observed_at":"2026-08-06T22:56:17.257495Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.871803Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.871803Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2afc4272f0236689e7e194d18fc9f2e92b2e255cd1060168eca15e7629568f99","observation_id":"6f2c66b1-f98a-47c0-938e-91cc6ec91277","resolution":{"observed_at":"2026-08-06T22:56:15.871803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.874898Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.874898Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:ea2dc96ee135b840997aaa7eee90936ceb463fe687766ca57627d66f37cf382f","observation_id":"3a1e4ac4-c2ef-49e9-be5f-5f45e25e43ac","resolution":{"observed_at":"2026-08-06T22:56:15.874898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.878423Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.878423Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:df6abc83cc8e51b692f633f1b801f0c8bf972fedb525bb35e41cc2e4c873e60b","observation_id":"e35ecd67-0a56-4238-909f-c14e8dff93ac","resolution":{"observed_at":"2026-08-06T22:56:15.878423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.886546Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.886546Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c4a9003d4b32960b23304e90fb7a376b00362e26661ae28a9dcd29aec0cf66a5","observation_id":"17763f69-be11-4fa4-914a-18b6705994c6","resolution":{"observed_at":"2026-08-06T22:56:15.886546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.893594Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.893594Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:05f098bfa13f341b6ae04d896397c23663604ab56730572858762c4190cb3bd8","observation_id":"d36fb7b2-0699-4bb7-ac94-d83a6003948e","resolution":{"observed_at":"2026-08-06T22:56:15.893594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.896849Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.896849Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:dd92f2885b6482212bd2296ecd0024b6d31e1a08487a7dd5a876111a20da425a","observation_id":"f111dc8b-776d-47ca-9b8d-04d18cbe5e78","resolution":{"observed_at":"2026-08-06T22:56:15.896849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18020","last_updated":"2024-02-28T03:30:31Z","snapshot_observed_at":"2026-07-06T17:36:36.437597Z","submitted_at":"2024-02-28T03:30:31Z","title":"Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph","version":1},"cited_work":{"arxiv_id":"2402.18020","doi":"10.48550/arxiv.2402.18020","metadata_source":"pith","pith_arxiv_id":"2402.18020","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph","venue":"cs.DS","work_id":"d637b776-1554-4971-82f0-3b989ce7381d","year":2024},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.900804Z"},"links":{"cited_paper":"/paper/2402.18020","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:4dde79a86b39990252063adb4d6e8be73e12105f2eea1dee5bee80dcd0c566c0","observation_id":"a95f7a2e-e0c2-4ca7-b403-2d961339cf27","resolution":{"observed_at":"2026-08-06T22:56:16.195854Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.10209","last_updated":"2024-06-01T11:33:12Z","snapshot_observed_at":"2026-08-10T20:14:01.132175Z","submitted_at":"2022-02-21T13:35:03Z","title":"Degree-Preserving Randomized Response for Graph Neural Networks under Local Differential Privacy","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.10209","snapshot_observed_at":"2026-08-06T22:56:15.904949Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.904949Z"},"links":{"cited_paper":"/paper/2202.10209","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:fcdbf02f7028fde9f60d5a60ac606fbbb5214e73332afacb405d9d13744ee976","observation_id":"b0ee3a3a-ad16-44bc-9917-7567f7a4d171","resolution":{"observed_at":"2026-08-06T22:56:15.904949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07055","last_updated":"2025-08-14T03:29:34Z","snapshot_observed_at":"2026-08-10T13:51:36.999803Z","submitted_at":"2023-12-12T08:12:18Z","title":"Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions","version":2},"cited_work":{"arxiv_id":"2312.07055","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.07055","snapshot_observed_at":"2026-08-06T22:56:17.216031Z","title":"Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions","venue":"cs.CR","work_id":"4e7ed8c3-6a0c-495b-930b-498d8844b1a2","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.909232Z"},"links":{"cited_paper":"/paper/2312.07055","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:bd11ed830fcd9c6b4c0d2cf5da0a577361e9f50bb3abfe16760d2cf19066c61f","observation_id":"aaf1e9d1-1a8d-4cfd-9e9b-176c50d00e9f","resolution":{"observed_at":"2026-08-06T22:56:17.219822Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.912594Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.912594Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:d1234fce67891c9542b8dbbc2be56c41f08213cf14ca113e4d5c02202dff4189","observation_id":"e7b7b899-1518-4cc0-afc5-02680db95b83","resolution":{"observed_at":"2026-08-06T22:56:15.912594Z","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-06T22:56:17.809392Z","title":null,"venue":null,"work_id":"c4572f50-4bd4-479d-8f5e-ba16a9df6d8d","year":2017},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.915941Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:89713a0c8fba825ca9691d509d39f64518a85b4ce5017bc348ed84965e693555","observation_id":"7495851e-ffdb-4ccf-bb0d-3238e0ee620d","resolution":{"observed_at":"2026-08-06T22:56:17.812521Z","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-06T22:56:17.800151Z","title":null,"venue":null,"work_id":"c48683a7-23cc-464b-90eb-2e2ac7168421","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.919163Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:ba01edff7f4e3866dc85c6e80c405c7f0a3494baed9b514b7506464d747ff40e","observation_id":"6bbf1599-1221-4354-873d-1e0dc86dfa55","resolution":{"observed_at":"2026-08-06T22:56:17.802970Z","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-06T22:56:17.790516Z","title":null,"venue":null,"work_id":"11de7f7b-0128-457a-90d9-f7bcb04f436a","year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.922208Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:73bcee4357f372017982d9127131bb83158c154d7e6ce67992590fb317d31154","observation_id":"fd4499e5-bd58-4a22-80e3-a0bf6ba30098","resolution":{"observed_at":"2026-08-06T22:56:17.793829Z","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-06T22:56:17.781839Z","title":null,"venue":null,"work_id":"2db7c0e7-de29-4c24-b3ac-a1fd13b71577","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.925284Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:567b820d12601f2d9b1a53f715fdb1611e6d0e017e9a5f38ed55bd1e8d20d0a5","observation_id":"b4cd9c41-5744-41d0-b620-5f8bc2712c2b","resolution":{"observed_at":"2026-08-06T22:56:17.784497Z","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-06T22:56:17.772670Z","title":null,"venue":null,"work_id":"deb15f5f-63f1-42b2-9ae4-94c4cdc3b7f0","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.928518Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:0582f731e97eeec46be15cdd2fd1c9546a0754d12ce35fdbe88ddb4dc5503d6a","observation_id":"19c8ae23-4446-4457-bc90-fc211b47152d","resolution":{"observed_at":"2026-08-06T22:56:17.775588Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.931622Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.931622Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:32b2c9c89fcb3cd17c3637e4da51511891177804ec066e5f92f46be031b8f848","observation_id":"85077254-3aeb-4d09-a97d-ca59400a936d","resolution":{"observed_at":"2026-08-06T22:56:15.931622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.935813Z","title":"Schaefer","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.935813Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2d166788adb328f84776296d35d1bbae943dce9bc4a7634222f9a4a711423686","observation_id":"9abc06dc-291a-482a-ab3b-7ed73b6e7233","resolution":{"observed_at":"2026-08-06T22:56:15.935813Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.939752Z","title":"Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.939752Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:43728a38f1bad5f8749763c55ec489db930e56cb476f1ec1566b23a8baf4b6f4","observation_id":"4e75ea6a-a54f-4a69-9500-af1766e97866","resolution":{"observed_at":"2026-08-06T22:56:15.939752Z","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":"9869.33001","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:17.115478Z","title":null,"venue":null,"work_id":"e1b52af4-6958-4045-a1db-c8cb4d2eb5a7","year":2019},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.944053Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:32b5065b6af15d625d6a2951bd4b24152caea4a1a241c731b36e81cf60c521e1","observation_id":"e85a67bd-2486-4887-9032-67cc7d2edd1b","resolution":{"observed_at":"2026-08-06T22:56:17.119831Z","resolver_source":"raw_fallback","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-06T22:56:17.757689Z","title":null,"venue":null,"work_id":"679ed28d-96f9-4f81-ace9-3f8884cc84e5","year":2010},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.947207Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:11c071a856422d89860b280402265eaa332d10a8c9b847b6c3961b35b1a880a2","observation_id":"e2da44d7-c58e-434f-860f-ca57bf82584a","resolution":{"observed_at":"2026-08-06T22:56:17.760394Z","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-06T22:56:17.748956Z","title":null,"venue":null,"work_id":"4d2eb5b5-8bbb-4bc9-af66-30f724e734b3","year":2014},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.950261Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:49ea50ff9b57d59b77439791a7248fe1313d1c030166aac3313283fbbd5cddcc","observation_id":"3e01e116-27fd-4a24-a052-7d03e444583d","resolution":{"observed_at":"2026-08-06T22:56:17.752151Z","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-06T22:56:17.739882Z","title":null,"venue":null,"work_id":"33f2ce32-0399-4c75-b2c9-f58375a6bd4a","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.953439Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c3d76030693b2fd83485682e792d184d25777d768c2e81772ff8a34e4693f931","observation_id":"e273732a-c551-4fb9-9d08-475ba3f9c8cc","resolution":{"observed_at":"2026-08-06T22:56:17.742830Z","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-06T22:56:17.731683Z","title":null,"venue":null,"work_id":"87878ff6-9eca-41eb-9191-feb3215a6d80","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.956772Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:d1769b7a966b15420151192c9503d35cf61f5cd5703dbce500265cd3963f969a","observation_id":"f7646785-1c85-442c-be13-61a5062d6776","resolution":{"observed_at":"2026-08-06T22:56:17.734407Z","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-06T22:56:17.723548Z","title":null,"venue":null,"work_id":"fcc23945-315f-4df1-b10b-1ff7b70043bc","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.959931Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:4155e300f261d9e666d1dde0f09f28fa0cb9731c5dc4045c06d2115cfee3a6ed","observation_id":"5aa373fc-c4d8-468d-9d90-566b044dd496","resolution":{"observed_at":"2026-08-06T22:56:17.726254Z","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-06T22:56:17.714952Z","title":"Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, and Julian Shun","venue":null,"work_id":"d33c52a0-70a3-4f77-8b74-5c9b6b318350","year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.963254Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:6fe75448918dcbb8c36cb62c8bef0f4e8c469fc1520b29926e108b24a66fbc1f","observation_id":"3994b337-9f1d-43ba-8c78-a25dd5955a3e","resolution":{"observed_at":"2026-08-06T22:56:17.717808Z","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-06T22:56:17.698100Z","title":null,"venue":null,"work_id":"1111f2b9-594c-40e0-b94a-e62fb6be87b0","year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.970342Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:90162482b9011fc9b86aae4ab0c3f02c98bbb04e70b6811cd5715bb762f8de0f","observation_id":"939d00a5-3448-4474-905c-c03db0acfe36","resolution":{"observed_at":"2026-08-06T22:56:17.701147Z","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-06T22:56:17.689936Z","title":null,"venue":null,"work_id":"ee66db40-2680-4c75-a1f2-b7794e01735a","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.976841Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:764e9718604fd933a9168b940b36d77bdace13a9bf0f088e928f31253a08ca74","observation_id":"3dfc1999-838f-4e7e-adac-0ef3d065bcf0","resolution":{"observed_at":"2026-08-06T22:56:17.692650Z","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-06T22:56:17.681905Z","title":null,"venue":null,"work_id":"d84245a9-2711-4e73-a74c-f024d8cf33f7","year":2024},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.980911Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:253a82046aff2038398564c08bbc941691d4a557919c57b40eb548bca913b4ef","observation_id":"9eacddb7-55fb-4286-90d5-330ebfcee933","resolution":{"observed_at":"2026-08-06T22:56:17.684474Z","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-06T22:56:17.672992Z","title":null,"venue":null,"work_id":"2970054d-8821-41d4-8c77-c6e5cf39a6f4","year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.984048Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2d0720c7407c90ec7e2a5510094dde30933221f72e887ec80f032293d74d3f3a","observation_id":"05af226d-c2a8-44dc-8170-823d47128420","resolution":{"observed_at":"2026-08-06T22:56:17.676221Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.991842Z","title":"Zheng, Zhou Zhao, Hongxia Yang, Kevin Chen-Chuan Chang, Minghui Wu, and Jing Ying","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.991842Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2100154dfb043d1d8cb76a865784ad3caa5e043e3ee2e5296c280128c153e8c7","observation_id":"c9872e9e-f1de-452b-a745-02d1e88690c1","resolution":{"observed_at":"2026-08-06T22:56:15.991842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.12938","last_updated":"2023-12-20T11:28:20Z","snapshot_observed_at":"2026-07-06T17:05:52.061396Z","submitted_at":"2023-12-20T11:28:20Z","title":"CARGO: Crypto-Assisted Differentially Private Triangle Counting without Trusted Servers","version":1},"cited_work":{"arxiv_id":"2312.12938","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.12938","snapshot_observed_at":"2026-08-06T22:56:17.027955Z","title":"CARGO: Crypto-Assisted Differentially Private Triangle Counting without Trusted Servers","venue":"cs.CR","work_id":"c0b6d26d-5232-44d6-ae3e-402b3efcd167","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.973476Z"},"links":{"cited_paper":"/paper/2312.12938","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c3368e55f9ec017dfc65b18f481e390df28ed89b6f07b27062889a26425e6e94","observation_id":"a9079a37-2230-4444-b74a-d26ed84d5ac6","resolution":{"observed_at":"2026-08-06T22:56:17.031679Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:15.999115Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.999115Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:0523f55901e4b5f75630e3ea160563941ce34e71ac0fd07c63d66f2f1de58022","observation_id":"2be1579a-69d1-4d8c-90a6-71e4d8d5151f","resolution":{"observed_at":"2026-08-06T22:56:15.999115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.002211Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.002211Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:9cee19055e4a07cbdd699fa71b77d4609882b9f9d445230e19d85ee3eecce7d1","observation_id":"4e44cd25-2058-4e7b-a289-e2b6bbf452e2","resolution":{"observed_at":"2026-08-06T22:56:16.002211Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.09205","last_updated":"2022-03-17T09:56:32Z","snapshot_observed_at":"2026-08-04T11:39:38.366462Z","submitted_at":"2022-03-17T09:56:32Z","title":"SoK: Differential Privacy on Graph-Structured Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.09205","snapshot_observed_at":"2026-08-06T22:56:16.005301Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.005301Z"},"links":{"cited_paper":"/paper/2203.09205","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:69a414e717811ebedaf5dea26a9d81d7ec79d7b51f9c0ede63702cf7c544f690","observation_id":"76c3fa12-dcff-4d8f-be82-c433810b635e","resolution":{"observed_at":"2026-08-06T22:56:16.005301Z","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-06T22:56:17.664519Z","title":"In 2022 IEEE 38th International Conference on Data Engineering (ICDE)","venue":null,"work_id":"7d989e65-4713-411c-b4aa-e222acdf1791","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.987663Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:3eb0f1c054da2be13083a9e7ef6a4179d1eb83cf62de05ba53b28e8652743bbf","observation_id":"6be0eba9-c8c6-4cca-92e8-298000bba54c","resolution":{"observed_at":"2026-08-06T22:56:17.667333Z","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-06T22:56:17.638162Z","title":null,"venue":null,"work_id":"a39afe26-dd0a-443a-a33e-8f912934cd1e","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.012102Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:ae813f3e3666bb03f35a0dfedcae5dd7b1f176eb73c91614fd426f9635f0655b","observation_id":"5cd2f4d8-d944-46e5-ab31-65c26238e44a","resolution":{"observed_at":"2026-08-06T22:56:17.640970Z","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-06T22:56:17.656107Z","title":null,"venue":null,"work_id":"c583573e-6c38-46b7-a7a7-65d7192a5e4a","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:15.996079Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:f7c17bc0bd99028b01629d4b2710b6ff812e403019f18a394ba4b5da2401df8b","observation_id":"a399cbe0-d734-4bfc-b55c-caa1f746aa19","resolution":{"observed_at":"2026-08-06T22:56:17.658895Z","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-06T22:56:17.619446Z","title":null,"venue":null,"work_id":"b9782980-cd65-46bb-8122-e29be8547dc1","year":2024},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.019059Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:feded2a4b6d4e463aee75ac648faad5688d9fa77e4244c8f40095b7cb9349d74","observation_id":"75e0a4f3-a973-4b1c-a56a-51c5fe4d566b","resolution":{"observed_at":"2026-08-06T22:56:17.622363Z","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-06T22:56:17.610375Z","title":null,"venue":null,"work_id":"3059391c-b797-4e92-9253-42e0c241f4bf","year":2007},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.022402Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:57cb6efef9d454d9bf8cf94608c2465a1f8b610ae679be28809b85e26065f021","observation_id":"0008ded8-658b-4607-ab1a-84a6ce7b6fe1","resolution":{"observed_at":"2026-08-06T22:56:17.613386Z","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-06T22:56:17.600977Z","title":null,"venue":null,"work_id":"016cb3d8-9038-48dc-befc-4025a1969fd7","year":2005},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.025668Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:07b9d613a23c3de5e4f1caa016ce74f46fbb22bf299d0a4beb0e1e16f4eaeb1a","observation_id":"beae554e-7e06-43a9-8642-897493d6580b","resolution":{"observed_at":"2026-08-06T22:56:17.603909Z","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-06T22:56:17.647159Z","title":null,"venue":null,"work_id":"3fb6df36-4102-4ce0-9a5c-41fda2bbd1ad","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.008930Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:3d842e3de8e842564cc9614bd03d50d4bfc2c89b5fdecf5b28c72f826e5e4ccf","observation_id":"1e6e8817-f2d9-4f23-8160-70376dccd682","resolution":{"observed_at":"2026-08-06T22:56:17.649900Z","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-06T22:56:17.582723Z","title":null,"venue":null,"work_id":"7afcb89e-251a-4d3a-8e59-6b2c9e98f18e","year":2020},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.032141Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:7a4bd2674889813b6674c857bd9de7b36f1fee054a26594319b7034991a90527","observation_id":"cf07c087-69fc-4255-aeee-10cc3472d330","resolution":{"observed_at":"2026-08-06T22:56:17.585570Z","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-06T22:56:17.628643Z","title":null,"venue":null,"work_id":"e129d5c7-63d4-4ca5-a251-caa8a3a778af","year":2012},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.015777Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:8da356a54e322a0c64bd8d52333bd17ec09d09e3245329ea58c072092b08f487","observation_id":"039b2b7a-7f0d-446f-97e6-f75844a8d72b","resolution":{"observed_at":"2026-08-06T22:56:17.632105Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.038610Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.038610Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:71e65e41327e81210d852e78b4aeadf50f75f9a2c26ebe777b81472ecbb0559d","observation_id":"fa16cd8d-ffd4-417c-ab45-b7ff9cfdc17b","resolution":{"observed_at":"2026-08-06T22:56:16.038610Z","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-06T22:56:17.567254Z","title":null,"venue":null,"work_id":"e28e7253-737d-4223-911b-5597c2deb0a7","year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.041664Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:b04d4e528b5d1603461bc60ac414bb9f504591457d3a634407491bbd5afc3f64","observation_id":"c6880d37-5a2b-4e26-b507-ded72c2a2731","resolution":{"observed_at":"2026-08-06T22:56:17.570047Z","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-06T22:56:17.558065Z","title":null,"venue":null,"work_id":"9e035417-41ea-4f90-bdf3-c36ce1b743d0","year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.045165Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:cc041f4acd32202d750ccc736432a218030df049c9a7cee0115e00141b63b89b","observation_id":"633af54b-42f6-44ac-90bb-78849d6172eb","resolution":{"observed_at":"2026-08-06T22:56:17.561218Z","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-06T22:56:17.591684Z","title":null,"venue":null,"work_id":"58fd9a13-ca89-4ed6-9c0e-643f3ef6a9e0","year":2012},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.028933Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:87b7dbac4f532c3854aa6dd49e241cd256220162b0bc1c4580520970d9d01c3e","observation_id":"b98e4377-1a68-4b55-917f-7ee4c8a0affd","resolution":{"observed_at":"2026-08-06T22:56:17.594607Z","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":{"arxiv_id":"2202.00636","last_updated":"2023-08-18T01:18:04Z","snapshot_observed_at":"2026-08-10T20:13:59.105523Z","submitted_at":"2022-01-31T18:59:19Z","title":"Differentially Private Community Detection for Stochastic Block Models","version":2},"cited_work":{"arxiv_id":"2202.00636","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.00636","snapshot_observed_at":"2026-08-06T22:56:16.643993Z","title":"Differentially Private Community Detection for Stochastic Block Models","venue":"cs.SI","work_id":"04450761-493b-4341-8715-bf2f1701be89","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.055431Z"},"links":{"cited_paper":"/paper/2202.00636","citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:5ef829922d29a1d3863f255e47c2538d8e9f15f2c3b89aa4219c1223e0b8a96d","observation_id":"d56c56ca-7e66-44e3-9e71-5776b5a1ffca","resolution":{"observed_at":"2026-08-06T22:56:16.692822Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.035455Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.035455Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:a617a8514a08bde2e071a33b64e8ecca50be35e938b2e6f2b38034bdd2f86806","observation_id":"998dee14-251c-439d-b227-f688ca3ffcc0","resolution":{"observed_at":"2026-08-06T22:56:16.035455Z","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-06T22:56:17.524844Z","title":null,"venue":null,"work_id":"04177f49-e4e7-4233-9fae-78465b279817","year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.061839Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:0164e54d601e22fc9226a5a5aed80f793f11557f463b69b69988ee92ae5bc06b","observation_id":"20d274c3-3e9e-4dfd-be9d-0ddc02f01d3a","resolution":{"observed_at":"2026-08-06T22:56:17.527973Z","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-06T22:56:17.508007Z","title":"Hubert Chan, Eleanor Gilbert Rieffel, Richard Chow, and Dawn Song","venue":null,"work_id":"50357269-7cc5-4b25-957d-8abfeb5ed2e6","year":2011},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.068196Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:987eb53db23d92c834e5bcff7f79d1ea73b4d1229a2420f4efda2d4c59063641","observation_id":"560d7f38-7fa1-4cda-8889-d131475e183e","resolution":{"observed_at":"2026-08-06T22:56:17.510721Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.071526Z","title":"Tsourakakis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.071526Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:0c1ced5c90a27fbbfe256e0591faedb88454af292249cccdef27c7d8549e62ff","observation_id":"cdc79d0a-d2d1-45f6-b417-d9bc606961a9","resolution":{"observed_at":"2026-08-06T22:56:16.071526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s021972001230002x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Journal of Bioinformatics and Computational Biology","work_id":"1a23d166-2cfd-4882-906c-7a8744153057","year":2013},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.074568Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:0590b21a9dc3035e115488b179801d16c15e91fbecdb8c9a8156bcfeaa5cc529","observation_id":"8e5c2002-27e0-4b31-94dd-a6aa24d4422e","resolution":{"observed_at":"2026-08-06T22:56:16.174577Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.052397Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.052397Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:bafc448ef71be8852b05797938c6d098349c06f99263d0caf3887993201fb7cf","observation_id":"fc741e42-8e3e-4977-a701-4d4bb80e581e","resolution":{"observed_at":"2026-08-06T22:56:16.052397Z","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-06T22:56:17.490213Z","title":null,"venue":null,"work_id":"5acc72c1-426c-4088-b9ce-9601a6eeb926","year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.081868Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:bc52c90187960b8d1242e083e7a0b5ed7120bf89864d17ea50e2be42c9578d6a","observation_id":"a2174fe6-9444-42bb-888a-119bf0ff1727","resolution":{"observed_at":"2026-08-06T22:56:17.493122Z","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-06T22:56:17.533584Z","title":"Monteiro, Shaojun Luo, and Hernán A","venue":null,"work_id":"c0ec01fd-6673-40dc-83ec-db49138198c2","year":2020},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.058791Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c5b8ae327da600c32919f2c0c61ce23d216b4f55b57b383b0855b12be67e9285","observation_id":"091dac62-ebef-4146-bd97-96601afaed66","resolution":{"observed_at":"2026-08-06T22:56:17.536414Z","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-06T22:56:17.473227Z","title":null,"venue":null,"work_id":"6bce3b8e-4e03-4019-a14f-e285f7f21765","year":2024},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.089152Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2c0b91232aaf17033d8b4510db81f44f8164679e14283ed08159fd38172518e7","observation_id":"23d760e9-b2d8-451a-b234-4d234450db0b","resolution":{"observed_at":"2026-08-06T22:56:17.476056Z","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-06T22:56:17.516541Z","title":"PLOS Computational Biology 18, 4 (2022), e1009865","venue":null,"work_id":"bb30bd22-b366-4faf-bbcb-5b5a35f01818","year":2022},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.065012Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:a934d40040ffc76c51bc43bbddb21f9a27844e54bcb6aa4b9aad15477886a21e","observation_id":"dd512359-36ed-4c9c-a236-2296e71a759e","resolution":{"observed_at":"2026-08-06T22:56:17.519256Z","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-06T22:56:17.464008Z","title":null,"venue":null,"work_id":"6c34838c-e519-4566-892a-9663db95dd29","year":2021},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.095502Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:f5b73b86c36a5076649360ed377590bac19cabf498dc3a86e4c43ed2e054d46c","observation_id":"27e75b2b-fa22-4a40-954e-02a591c1cb4e","resolution":{"observed_at":"2026-08-06T22:56:17.466955Z","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-06T22:56:17.454807Z","title":null,"venue":null,"work_id":"e01ccb4a-023c-4d3e-9685-62182d672053","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.098676Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2d43026d15acc5bc3187850c396c085f9fc7343226cae3a939544cc7dfaf4daa","observation_id":"ef311871-03bd-4e1f-8b1d-43e2c6ff8862","resolution":{"observed_at":"2026-08-06T22:56:17.457853Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.101614Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.101614Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:c021aa9ba2022f5ad121d270b55292b09256d1ed249ed316373ebb77258a8cf5","observation_id":"401e2df0-6caa-4441-b03a-3a4a572bd543","resolution":{"observed_at":"2026-08-06T22:56:16.101614Z","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-06T22:56:17.499675Z","title":null,"venue":null,"work_id":"0fdaadd1-7704-4b7e-a515-28ce8fac41ca","year":2019},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.078611Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:ac85e300e60b38e1085ec265feea7a87f158750009a8388213c8a04e36ba1448","observation_id":"2a03e368-9051-4061-ab71-be445db37aef","resolution":{"observed_at":"2026-08-06T22:56:17.502421Z","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":"8597.37086","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.416540Z","title":null,"venue":null,"work_id":"6a99ccf6-590f-40d9-9ece-f81b85563d02","year":2025},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.107591Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:854a144ecb1e69a9f594a2999e8130c4ffe0d95d66b636ca0c82f45108c2a66b","observation_id":"ef6e69e8-1e85-4136-be50-33ca088b3bf8","resolution":{"observed_at":"2026-08-06T22:56:16.425618Z","resolver_source":"raw_fallback","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-06T22:56:17.481753Z","title":null,"venue":null,"work_id":"cfbc9347-5d0c-4dae-8e73-0563e40518e1","year":2017},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.085099Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:5b4f5529938212cc363d5cc4868c7378f30aa0b7fb975309c49418bfa08d8574","observation_id":"6d4f52a5-6396-47c8-bff4-4a0fc3ca177b","resolution":{"observed_at":"2026-08-06T22:56:17.484658Z","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":"2311.06888","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.346349Z","title":null,"venue":null,"work_id":"1951eeec-8b92-4573-878f-f0ca39149bb4","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.113989Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:e998c11e4bae31b64c08f1eb2f294e400e7dc3df7070b02746bc012334afcae6","observation_id":"c88c8859-709f-42e3-b6e6-e607701b3ad8","resolution":{"observed_at":"2026-08-06T22:56:16.352406Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:16.092356Z","title":"Emre Gursoy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.092356Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:dca14ce788396e54bea6cb10670910d62e15ad9f8971e3a277d9659ba8b4d1cd","observation_id":"a30cd0f4-617e-48cb-8876-a585a0957c5b","resolution":{"observed_at":"2026-08-06T22:56:16.092356Z","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-06T22:56:17.415610Z","title":null,"venue":null,"work_id":"f160cea6-8eca-499f-a743-3dfcc45788c0","year":2020},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.120104Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:4dda83171db9ac8b99353aa70e5978afbff3292f284f3ca27b554f48ae72a769","observation_id":"07b465ba-d2b0-4fd6-9e89-838f13a7e5f9","resolution":{"observed_at":"2026-08-06T22:56:17.418725Z","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":"10.1038/srep06140","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Scientific Reports","work_id":"04cf7a4e-87e5-4fa7-af58-fb632a595f4e","year":2014},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.123440Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:22a396839aa440dfb43e2214ca6a77c7ee35a9397bfe3c7cb52e4481fc6f8392","observation_id":"17e87663-6ff5-46fa-93bf-9fbe3d00320b","resolution":{"observed_at":"2026-08-06T22:56:16.164200Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:56:17.406476Z","title":null,"venue":null,"work_id":"6e07c248-b9c0-41fc-a0e9-577a4e4996e0","year":null},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.126610Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:2c53832a472f2937ff2ae01fc3bdcbb19c84a5a28a5e6812e23b12c47752d60d","observation_id":"107a0d80-8fa4-4f1d-ba7d-cecc4959459c","resolution":{"observed_at":"2026-08-06T22:56:17.409323Z","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-06T22:56:17.445078Z","title":null,"venue":null,"work_id":"380928f7-0eb2-4061-98cc-6b9567cd2f92","year":2023},"citing_paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","version":3},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:16.104614Z"},"links":{"citing_paper":"/paper/2506.20828"},"observation_digest":"sha256:46c78f2c9fc0422c595f63cc9082cc4eefb656e21cff92e99749062a939d06d9","observation_id":"a5a6b6c0-4211-4af6-97d6-a3b5ea49ce02","resolution":{"observed_at":"2026-08-06T22:56:17.448275Z","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"}}],"paper":{"arxiv_id":"2506.20828","last_updated":"2025-08-27T01:44:28Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T20:00:42.099705Z","submitted_at":"2025-06-25T20:54:07Z","title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":3,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":78,"verified_exact":11,"verified_fuzzy":5},"total_outbound_references":109},"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 100 of 109 outbound references and 1 inbound Pith citation observation for arXiv:2506.20828."}