{"as_of":"2026-08-09T17:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:439fb480f6aed0e0dc09e0ebeeefabb52aaeb3652fcb8949bd3e79ed79c1f5d0","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:02:20.278843Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.01696/citation-record","integrity":"/paper/2507.01696/integrity","json":"/paper/2507.01696/citation-record.json","paper":"/paper/2507.01696"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:02:20.026215Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.026215Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:45e16c995cd59a1d9a08f3b929b7a58997658d26f8c20e535cf0d7b97ccb71fc","observation_id":"93615de8-1134-4317-a98a-bbf2c5b753cf","resolution":{"observed_at":"2026-08-06T21:02:20.026215Z","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-06T21:02:20.032399Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.032399Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:b99e7680ab7c395e6224d15b6ba76d06d84541fc06e1a091a7d129cc83a23315","observation_id":"3d9c522e-3ecf-4ab6-93c0-e3a9f7be6092","resolution":{"observed_at":"2026-08-06T21:02:20.032399Z","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-06T21:02:20.037501Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.037501Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:6daeeb55bf317678a23482e66fec27124ad078456f8e89e94790deb64cd06c13","observation_id":"eda2505f-a976-47f0-af54-1ebc17e04ee4","resolution":{"observed_at":"2026-08-06T21:02:20.037501Z","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":"content/0000775","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:02:20.543946Z","title":"Hoory and Linial and Wigderson","venue":null,"work_id":"55d10bd0-303b-4d07-867c-2c27e70d515e","year":1990},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.044692Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:b3a422996afb8a05fec00f973c459a6cee4b0252ee661f2aa9924006e3d0e509","observation_id":"77ef8a74-866a-42ee-98ec-d8dc1caa00b0","resolution":{"observed_at":"2026-08-06T21:02:20.551116Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.053536Z","title":"and Indyk, P","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.053536Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:c3d780d666fb3c5f592aeeefcdbbc59cf7b191d4eae1e861403e3c78358c2cf5","observation_id":"793f0d8e-33b9-4525-9096-5dc9214ce9f3","resolution":{"observed_at":"2026-08-06T21:02:20.053536Z","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-06T21:02:21.259036Z","title":"Efficient density evaluation for smooth kernels","venue":null,"work_id":"c310db89-7a45-42f2-a1f7-cd2cb5021635","year":2018},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.058781Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:fcd21ff00a4993b3819549100ff9b5d59ddfda3c1a2c6d54104846166b07969f","observation_id":"9e69558c-be53-41af-b115-e9b16dd757b7","resolution":{"observed_at":"2026-08-06T21:02:21.265048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.243829Z","title":"Subquadratic algorithms for kernel matrices via kernel density estimation","venue":null,"work_id":"c40923f5-fc18-4588-9ccb-32dc138ec89c","year":2023},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.064232Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:38251c6f8f05a55449f3abc1e2d8e88eb28bf252a81fff26e71aa55670847fa7","observation_id":"968861d2-36b8-4d47-87ef-8fe9c407e10d","resolution":{"observed_at":"2026-08-06T21:02:21.248889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.227129Z","title":"P., Whitman, B., and Lamere, P","venue":null,"work_id":"e78f1de2-dde6-4dda-a387-c12660a45da8","year":2011},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.069663Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:e1f2b28504800c8ba3a484e63c64bf2a1db0a3f2a871a0fba063884d81267872","observation_id":"417b8c96-1667-4d01-ba13-705be1099e68","resolution":{"observed_at":"2026-08-06T21:02:21.232592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.207696Z","title":null,"venue":null,"work_id":"90a25a46-61a5-4977-b48f-2d01b4909c12","year":1999},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.075324Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:5e470bac578aefb0521cca19794e51afcc9f52168abdca268cb543bbac65bc0a","observation_id":"42e66bde-35f0-47bf-a750-4315286d391c","resolution":{"observed_at":"2026-08-06T21:02:21.212949Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.193126Z","title":"and Siminelakis, P","venue":null,"work_id":"b5633b8a-9ae7-402e-8481-23d558be8192","year":2017},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.080711Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:24e8acd8c228eb87615e6da374352803d6ba9206eb2b6631dd55867a7fc43440","observation_id":"42ffa6e0-1b67-4975-ae36-505b9c4a2248","resolution":{"observed_at":"2026-08-06T21:02:21.197863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.178431Z","title":"and Siminelakis, P","venue":null,"work_id":"8c9fc975-600f-4eaf-9b65-f422f27093b0","year":2019},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.085684Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:e5db7079998c5cfcbf8b08788b3c71eed9687387392777745363948d03144288","observation_id":"9de5f7d3-0a06-4308-9ccc-74443304ad18","resolution":{"observed_at":"2026-08-06T21:02:21.183244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.163001Z","title":"Kernel density estimation through density constrained near neighbor search","venue":null,"work_id":"59668775-746e-4b89-892a-a7497acaf0b4","year":2020},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.090244Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:ce66fa4b6e505ddfc34cde67077762459d83eb8cb787bf6359402af431762766","observation_id":"627dabd2-c147-45d0-b852-819f6d744a28","resolution":{"observed_at":"2026-08-06T21:02:21.167934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.147437Z","title":"A quasi-monte carlo data structure for smooth kernel evaluations","venue":null,"work_id":"c261d7cf-2b61-440a-8fa1-ad8eebae5620","year":2024},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.095769Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:4eb90528c2a6194ec84f706b37c1c18be4398489c1e89a12a71fcaacd34afb35","observation_id":"f9882165-97de-4392-8059-14ab2ebb9786","resolution":{"observed_at":"2026-08-06T21:02:21.152786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.131550Z","title":null,"venue":null,"work_id":"32d15d42-c8c3-4da9-935f-9f97f6c1ec30","year":1997},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.100864Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:308179a9955c933629ec21f50f6a02ebefdacb702f984d63cbb81f5e64dbe60d","observation_id":"069f2b1e-735e-4511-9152-958438a6d91d","resolution":{"observed_at":"2026-08-06T21:02:21.136528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.114454Z","title":null,"venue":null,"work_id":"c8d5f414-674b-4ab5-8966-2e775fa0ee02","year":2004},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.106013Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:2c10f20d63a7812a6342087b1bb7e493bce3499b0c85ed274db2cfc4a54ee68e","observation_id":"a658f267-f2f7-4dee-ae40-91ee5a705781","resolution":{"observed_at":"2026-08-06T21:02:21.119896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2211.14825","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:02:20.443350Z","title":"Dynamic kernel sparsifiers","venue":null,"work_id":"f189d64a-7381-4faa-b5d1-3030c57fb5bc","year":2022},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.111390Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:43314e2ce2af34f5b709f7d159b356c41002c435b954d690736900eae83d6248","observation_id":"5b9ebdad-97e7-435c-8a90-1a47c3e7cabb","resolution":{"observed_at":"2026-08-06T21:02:20.451546Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.097610Z","title":"Efficient eigen-updating for spectral graph clustering","venue":null,"work_id":"2a93a6f5-e389-4d65-a27d-844d07487bb7","year":2014},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.116655Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:0397de5518fd9631c669e69cd430e45f63ac0ca4b205301a66a427ba7e9e254d","observation_id":"6ee47abc-3884-4b34-a3fc-db46a6694066","resolution":{"observed_at":"2026-08-06T21:02:21.102460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.081869Z","title":"R., Perone-Pacifico, M., Verdinelli, I., and Wasserman, L","venue":null,"work_id":"da401588-e719-4c04-ad4e-40b76b2ba0a0","year":2014},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.122399Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:ed2f6cb8642480091fcbb710a73d76d53d51b9bcd693cdcf6443ed4749880417","observation_id":"a06b20b3-2a68-4baf-8748-13bf9f77fac4","resolution":{"observed_at":"2026-08-06T21:02:21.086424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.067097Z","title":"J., and Smeulders, A","venue":null,"work_id":"70bdc36a-0349-48d6-80cb-8aef65b9172e","year":2005},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.127463Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:85415826499d6794471faef5a167133979361885886516a6f7e60c6d6729aa4c","observation_id":"711df69c-8c1d-4412-a639-0ce5a984ab3c","resolution":{"observed_at":"2026-08-06T21:02:21.072046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.048357Z","title":null,"venue":null,"work_id":"7cb5b175-30eb-46c3-a0c2-98b4c3810549","year":2003},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.132835Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:2f774b52fefcad49c42d4b4a46fc13d69c50508a1811c60e8693f103d6322e74","observation_id":"986129f2-2b9c-4bbe-9426-2c5c9175b1ee","resolution":{"observed_at":"2026-08-06T21:02:21.055877Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.027828Z","title":"and Strain, J","venue":null,"work_id":"4f177d05-8e34-4c2c-9ad9-fe5dd1e2041d","year":1991},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.140644Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:9c0345826fcb8da408a00b9cae8fce3ce3b775f926b576a7af7132be92210d24","observation_id":"12bbb834-9a9e-4324-ad4d-58425e42aada","resolution":{"observed_at":"2026-08-06T21:02:21.034585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:21.006031Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"0317cdab-d5de-474a-9e76-62be91651b81","year":2016},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.145900Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:da37c40bc4c87962b1505fafa2236fa24c95b2bf82c1f2a9ea6479c158c17d00","observation_id":"7462bcb4-2d36-42c0-a03f-9ea0106a1e3b","resolution":{"observed_at":"2026-08-06T21:02:21.011897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.12329","last_updated":"2024-02-06T03:21:25Z","snapshot_observed_at":"2026-08-09T05:00:40.357108Z","submitted_at":"2022-02-24T19:33:58Z","title":"A Dynamic Low-Rank Fast Gaussian Transform","version":2},"cited_work":{"arxiv_id":"2202.12329","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.12329","snapshot_observed_at":"2026-08-06T21:02:20.354140Z","title":"A Dynamic Low-Rank Fast Gaussian Transform","venue":"cs.DS","work_id":"5d6d6e29-cc35-46a3-a8bb-0363e01e1314","year":2022},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.150202Z"},"links":{"cited_paper":"/paper/2202.12329","citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:afc3e3b00c3672481cac38f15c391a266715bead642cde4db0d8202ac44d37a6","observation_id":"3424cb6f-a9db-4ff1-99ee-d788a0fcdf2f","resolution":{"observed_at":"2026-08-06T21:02:20.359969Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.979719Z","title":null,"venue":null,"work_id":"36138270-d9f3-4cea-b93d-9872eeec1f67","year":1984},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.155232Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:fd18bbc3bf76e531fdbd5f4742527ff2728d0d7d7e28029f4ecc155c5f68905d","observation_id":"6824e420-4b30-408d-b588-226d9f9e998c","resolution":{"observed_at":"2026-08-06T21:02:20.985061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.962504Z","title":"Deann: Speeding up kernel-density estimation using approximate nearest neighbor search","venue":null,"work_id":"e8cf549f-d682-4f9c-b0f7-f1ab163702fe","year":2022},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.159719Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:ad2e5f46ba6df007370c748a3275a18e118e87e4c7812d9c72587ba57781d111","observation_id":"4da7ca85-459f-4e23-be2d-ff6bd7ad66f1","resolution":{"observed_at":"2026-08-06T21:02:20.968769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.947149Z","title":"A., Starosta, B., and Wierzcho \\'n , S","venue":null,"work_id":"4461cce7-51c4-491f-98cb-4da1f7c55f91","year":2024},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.164059Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:908fe8a3b3961732a027fac6bb4d1088151af0396244969916d8365686b6c373","observation_id":"515f7ab3-a10c-4948-8d85-43d0f27cf87b","resolution":{"observed_at":"2026-08-06T21:02:20.951800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.931085Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":"28a60987-bfed-4dbc-ba54-4a1a27dff33e","year":2009},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.168873Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:ce7b0ede17f18ff0b344283a50aeacce0b00ee956938cf73ad6ac134adb889c9","observation_id":"aea88283-a6a9-4322-8bbf-e99608044a8c","resolution":{"observed_at":"2026-08-06T21:02:20.936733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.915769Z","title":"and Sun, H","venue":null,"work_id":"54480134-9cc2-403f-9d9f-d4d0d4292f33","year":2024},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.173386Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:9fba62caa666fa7cab027975fbae7b46c722cea193bfa96a65417bb956eb57d4","observation_id":"bdbbfc54-e131-43a2-a3c2-8e7f15ad4640","resolution":{"observed_at":"2026-08-06T21:02:20.920530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.898376Z","title":"Detecting the overlapping and hierarchical community structure in complex networks","venue":null,"work_id":"ae5890d4-b917-4585-b242-c0a1348fb1ad","year":2009},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.178452Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:b795942f5db50ea3b901e7e315a1e3b1ea2c87b99f5be348700225553a139c34","observation_id":"bd1899ca-8ef2-4912-8456-1d6592056be5","resolution":{"observed_at":"2026-08-06T21:02:20.904577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.881761Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":"068c9a07-e293-484d-a0b1-9d58dcc9e26b","year":1998},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.182895Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:c26c2f3e9624ce8a9b35ed88afaed57816d37ef6f5b5429bcbfa77a937213101","observation_id":"82773c0a-ad15-4407-99a5-49e60226d1ce","resolution":{"observed_at":"2026-08-06T21:02:20.887236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.866805Z","title":"R., Oveis Gharan, S., and Trevisan, L","venue":null,"work_id":"acd85834-0a32-420e-8d7d-67cc689623d3","year":2014},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.188145Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:8724f1c3561baeecec8365c496c84ce678eae7d990d8585a1e59a6a1939d35bc","observation_id":"dbe606b6-deb7-42b9-84c4-fc877aebfc91","resolution":{"observed_at":"2026-08-06T21:02:20.871554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.03915","last_updated":"2024-02-13T19:59:56Z","snapshot_observed_at":"2026-08-08T01:46:10.077844Z","submitted_at":"2022-08-08T04:40:20Z","title":"Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory","version":2},"cited_work":{"arxiv_id":"2208.03915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.03915","snapshot_observed_at":"2026-08-06T21:02:20.323761Z","title":"Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory","venue":"cs.LG","work_id":"cf055477-385c-4204-b740-c149224f42cb","year":2022},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.193321Z"},"links":{"cited_paper":"/paper/2208.03915","citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:692b422e9bb062c6de155396159a0e793edcacae87d1524bc31b41bee4d057c8","observation_id":"86cb5db4-302f-42a4-bc4b-ffe4b73fa3ba","resolution":{"observed_at":"2026-08-06T21:02:20.332709Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.850082Z","title":"and Sun, H","venue":null,"work_id":"d1539d8d-b470-490b-97ec-0768db5ade05","year":2023},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.198562Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:00d9659be71a609e3044ef7f7bfc3ec40972ea243b9ddf8f7713f5ccd5ec6651","observation_id":"1c6b6a37-fbac-44f1-97bd-39f379b28030","resolution":{"observed_at":"2026-08-06T21:02:20.855762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.833010Z","title":"Fast approximate spectral clustering for dynamic networks","venue":null,"work_id":"ce5dee17-4346-4a8b-b28b-ae59cdc08411","year":2018},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.205010Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:642734f6fc968086dc791a19f84756bf20b6782f539fc725c45756c207ff719f","observation_id":"2cad1104-71d4-4476-a7e3-c4afaecd630e","resolution":{"observed_at":"2026-08-06T21:02:20.838496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.817871Z","title":"US Census Data (1990)","venue":null,"work_id":"4f2a50bd-9aed-470b-bb99-eca8ca4956f6","year":1990},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.209381Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:3755ba7f88c678b18203fb2fec60ac40d396f07a112a0f6e5ce076fefd4f01ae","observation_id":"1d830b17-9a88-4897-b0aa-aee9d3f64b82","resolution":{"observed_at":"2026-08-06T21:02:20.822767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.797444Z","title":"Statlog (Shuttle)","venue":null,"work_id":"0eeff61c-401b-43ae-bd60-9c3498b42400","year":2002},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.213999Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:72200ec3c26ce57f220f112d0d290c2feba59a59be62497b1193f727701a1f53","observation_id":"bf2749da-16e3-4bf4-a683-785ba24ebcb5","resolution":{"observed_at":"2026-08-06T21:02:20.803028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.781539Z","title":"Y., Jordan, M","venue":null,"work_id":"52416305-b85b-4b0e-9009-1788d029cbea","year":2001},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.218546Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:8fac36dee6d6a047ec77d8c7703f13cb5f8cc014daf2f2137c01c22af95b12cf","observation_id":"4228a3ad-af3f-4d0a-ad22-bae877936bbe","resolution":{"observed_at":"2026-08-06T21:02:20.786751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.764508Z","title":"Incremental spectral clustering with application to monitoring of evolving blog communities","venue":null,"work_id":"4b527d2a-d36a-456c-9159-276e870de188","year":2007},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.222887Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:0fcf50794200fa62aa58afc3fdaf9fc4c1dd9c893a4713eb7adf3c030eb0e36d","observation_id":"ab879500-0a11-4f71-9517-0088d3cb0efc","resolution":{"observed_at":"2026-08-06T21:02:20.769791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.227308Z","title":"Scikit-learn: Machine learning in P ython","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.227308Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:d07b2bf2a9c4b289fca2bf37c04b88e0d0ccd90825eb78dc3b7ee72fa8a6c887","observation_id":"cd415286-773e-43f7-bc4d-3cf8f9b1dded","resolution":{"observed_at":"2026-08-06T21:02:20.227308Z","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-06T21:02:20.737241Z","title":"Partitioning Well - Clustered Graphs : Spectral Clustering Works ! SIAM Journal on Computing, 46 0 (2): 0 710--743, 2017","venue":null,"work_id":"d3afb2b7-7b10-4abd-8b49-78400757b7e8","year":2017},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.232001Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:c195d163ca4a423db9e5ab89100343343cb34895c21a74eecb8e3b9a5547d84f","observation_id":"9ed46b1e-116b-4f14-a7ff-e78641cf4b32","resolution":{"observed_at":"2026-08-06T21:02:20.742194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.720715Z","title":null,"venue":null,"work_id":"ed2749bd-c9ff-46e1-933c-544f7fd6ecc6","year":2014},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.236344Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:cfd5c29e91e59412f1ba28690fdad7b7c87eeb9932c61a8b77880eb3033f2759","observation_id":"bd3a4a93-7bb9-44cf-a6af-4a4195c121f9","resolution":{"observed_at":"2026-08-06T21:02:20.725858Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.704306Z","title":null,"venue":null,"work_id":"d4c1fb9d-7c4c-4e05-99ca-18fdc929acb4","year":2020},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.240408Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:c9defe0f96bb75c1e94e5d5ba46c3fdcf6179243c23c9b7e1537b8e7f2c7ad34","observation_id":"a49244fd-81fb-46c3-bebc-c40ffe437d25","resolution":{"observed_at":"2026-08-06T21:02:20.709171Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.688957Z","title":"Spectral sparsification of metrics and kernels","venue":null,"work_id":"92766d4d-c209-4717-a3b4-4054805d80e5","year":2021},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.244808Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:efa56fb741a048ed767fb1576c1a719406ae9a9aafa635add38bdd0ccfb28f99","observation_id":"f3eb6433-f47a-4438-afb0-97b990c07668","resolution":{"observed_at":"2026-08-06T21:02:20.693775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.672361Z","title":null,"venue":null,"work_id":"51f46f84-e08b-419c-b978-f3f6e7e4be85","year":1971},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.249274Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:3a8e392118618ee12d937a17804007dbc1a6f6aa5b720101c4bc72cca413dafb","observation_id":"2aa7b936-68db-46e2-8dd0-62358281dc9d","resolution":{"observed_at":"2026-08-06T21:02:20.677151Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.657780Z","title":"and Smola, A","venue":null,"work_id":"13feedfc-d9fd-4758-897f-ed888d3f6eb1","year":2018},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.253524Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:4d3f9eeb5df45d20194d5aab854584ad228731ed9ae03edbf6e09c58ee04c363","observation_id":"d80867dd-fd35-4038-b064-f50d8c1fa38e","resolution":{"observed_at":"2026-08-06T21:02:20.662333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.642274Z","title":"Generalized outlier detection with flexible kernel density estimates","venue":null,"work_id":"bffbe9a2-5907-4a9e-a91e-0c902f4c2d58","year":2014},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.257826Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:ca2dae0ab31d08eaa159f50899a84c0ccacb0dc419bd5366a6564db53955ba6b","observation_id":"59e544ad-86d8-4acc-a3f4-a2ffc7a55fbd","resolution":{"observed_at":"2026-08-06T21:02:20.647529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.627451Z","title":"Lifelong spectral clustering","venue":null,"work_id":"e1575cc7-d625-439f-8632-265b9a6ca71e","year":2020},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.261955Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:5d952ca3a2f30d348852be2a17efe5ffc9b7df7f48e10415ff25e06e7718b5df","observation_id":"2d847091-ebba-4e11-af87-3506d28ad950","resolution":{"observed_at":"2026-08-06T21:02:20.632097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.611132Z","title":"and Zanetti, L","venue":null,"work_id":"51a9bb4b-1a46-42e2-9fa1-1559040d9b58","year":2019},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.266005Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:6923d441c586b0e23f7e2d62ad3731c638d6376fc3faa2ed8cc11a9cf87add11","observation_id":"58d7a9e1-357c-456e-ba83-71c98a78aa6f","resolution":{"observed_at":"2026-08-06T21:02:20.616395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.594551Z","title":"A tutorial on spectral clustering","venue":null,"work_id":"c1ea814c-1636-4057-b764-23890587606f","year":2007},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.269963Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:d14d03cbd0ca4b40be5d9fc4f1abceb5a1fe6bd68168d429ffb7301b56c420fb","observation_id":"67573cf2-0666-4b2e-ad92-d21235379863","resolution":{"observed_at":"2026-08-06T21:02:20.599574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.578628Z","title":"A., and Davis, L","venue":null,"work_id":"13e1270a-d4ad-4965-91bb-5f28a6122dba","year":2003},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.274446Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:bdffffca574c6919b4ca243ecd80b58c762910f76a0bf143490334232d9fcabb","observation_id":"d84ab1ae-20f4-42a2-bb5f-153d63c73c97","resolution":{"observed_at":"2026-08-06T21:02:20.583655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T21:02:20.561552Z","title":"Incremental multi-view spectral clustering","venue":null,"work_id":"6a0359df-f1de-4614-a2e5-50ac6d6f34d2","year":2019},"citing_paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T21:02:20.278843Z"},"links":{"citing_paper":"/paper/2507.01696"},"observation_digest":"sha256:4f111c835dd86a27f1e5fbfb04e245b6b5a76aa3236fe01704e0ccf7450b14eb","observation_id":"72fc0cf3-6a3d-4e76-bb83-e57af25ee304","resolution":{"observed_at":"2026-08-06T21:02:20.568152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.01696","last_updated":"2025-07-02T13:25:22Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T03:37:46.374404Z","submitted_at":"2025-07-02T13:25:22Z","title":"Dynamic Similarity Graph Construction with Kernel Density Estimation"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":4,"verified_fuzzy":34},"total_outbound_references":51},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2507.01696."}