{"as_of":"2026-08-21T04:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d72f846f422d1baa21cf8ee056e2bcf75a4c0476b2a043f004331ca86fe316c","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:25:50.354417Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2607.27640/citation-record","integrity":"/paper/2607.27640/integrity","json":"/paper/2607.27640/citation-record.json","paper":"/paper/2607.27640"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02044","last_updated":"2024-02-03T05:43:39Z","snapshot_observed_at":"2026-08-20T19:06:25.647627Z","submitted_at":"2024-02-03T05:43:39Z","title":"Locally-Adaptive Quantization for Streaming Vector Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02044","snapshot_observed_at":"2026-08-15T15:25:50.234716Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.234716Z"},"links":{"cited_paper":"/paper/2402.02044","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:5a30ca0a7651442db6140ad151a454a005ea338540f1506e3ed06be3a77bf860","observation_id":"7d45f10d-d43c-4f3b-aec8-4f479a3d1bd1","resolution":{"observed_at":"2026-08-15T15:25:50.234716Z","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-15T15:25:50.934340Z","title":"In: ICCV","venue":null,"work_id":"a8784ec1-64ce-489b-8306-0a323c19c275","year":2023},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.239658Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:c7c834b386d147e260ff2dd5da35fe24ea83f442ef6b00f671185d4c5a5b382e","observation_id":"3987faa5-2a90-47d0-a6a4-47765263c00c","resolution":{"observed_at":"2026-08-15T15:25:50.938431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.243524Z","title":"In: Proceedings of the ACM Web Conference 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.243524Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:ef361f00bcbf9fb041cc6749b4dc00e1627592df61482ee95dc699ab1e6a56b4","observation_id":"b73e8c85-6653-47ff-9a3f-1e830c85d42a","resolution":{"observed_at":"2026-08-15T15:25:50.243524Z","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-15T15:25:50.247131Z","title":"Zeitschrift für Kristallographie - Crystalline Materials84(1-6), 109–149 (1933)","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.247131Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:4c284dbdc5051ffe52c6d73e09bdef121704f53a957522b3ea0f3d8913555d8f","observation_id":"3af3816d-0593-4d5b-8aa1-2425855e6e12","resolution":{"observed_at":"2026-08-15T15:25:50.247131Z","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-15T15:25:50.922755Z","title":"Commentarii Academiae Scientiarum Imperialis Petropolitanae8, 128–140 (1736)","venue":null,"work_id":"fc126ccc-60f6-40c9-befb-1663361055ee","year":null},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.251216Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:c1530104292f5fd2d4096a9348523f84571ddc5f67f9985af06bf00a9e864612","observation_id":"913ddd4f-9b8e-4c70-9bd4-bf4453937824","resolution":{"observed_at":"2026-08-15T15:25:50.926670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.255010Z","title":"Scientific Reports7(1), 12140 (Sep 2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.255010Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:18595588c7b8b1826a8e42490c35d4028685fc09797859c0eed68ed311abaac8","observation_id":"147e980a-3591-4f97-8a01-dc03b9fddaa7","resolution":{"observed_at":"2026-08-15T15:25:50.255010Z","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-15T15:25:50.259160Z","title":"IEEE Trans- actions on Pattern Analysis and Machine Intelligence44(8), 4139–4150 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.259160Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:d624bf7c857fca52338aed53f08e4beacf8e6681a19d76ce94b4893322e6c9df","observation_id":"7fc08eae-8e27-4595-9529-b4b1d0992de2","resolution":{"observed_at":"2026-08-15T15:25:50.259160Z","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-15T15:25:50.911454Z","title":null,"venue":null,"work_id":"9ff38f1f-9b96-4419-9bbc-d8c726468511","year":2019},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.263266Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:bdf1e3cd683600aab246067401d2c0c80a8ae737b36d149b18107ad75b43e157","observation_id":"80b711c6-4a7c-4aae-84d7-c891e0291aa2","resolution":{"observed_at":"2026-08-15T15:25:50.915292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.266963Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.266963Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:aeda859bf65e44b1ab41fd8fc2abf1d41660d40fd16414da9b98d98fee101db2","observation_id":"727bf5db-2772-4086-8140-37637b11a066","resolution":{"observed_at":"2026-08-15T15:25:50.266963Z","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-15T15:25:50.899219Z","title":"In: Gurrin, C., Kongkachandra, R., Schoeffmann, K., Dang-Nguyen, D.T., Rossetto, L., Satoh, S., Zhou, L","venue":null,"work_id":"092980a8-917a-4eb5-8835-b2fd93efbba0","year":2024},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.270970Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:23af2ffadc743842b73e27fbaf99ba5c34273d96c386cdedfe67b54fa70ce6f3","observation_id":"1770d006-541d-4d3c-88d1-b52596d0093f","resolution":{"observed_at":"2026-08-15T15:25:50.903290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.887365Z","title":"IPSJ Trans","venue":null,"work_id":"cbce009b-3677-445c-9997-94207fd5d88e","year":2010},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.274888Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:e3a0a5282173266cac7b203bd99338b959e8c77fc3ebe3d764168c8242ba20ec","observation_id":"67201c6c-80b7-4596-976a-0b2a5d557000","resolution":{"observed_at":"2026-08-15T15:25:50.891443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.875768Z","title":"In: Wallach, H., Larochelle, H., Beygelzimer, A., d'Alché-Buc, F., Fox, E., Garnett, R","venue":null,"work_id":"5a440a1e-b66c-4a4c-9e07-57a0ff59a5df","year":2019},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.279073Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:094217151a6f9a2dc62c9a408e1a696ac2a530c47a510110f1daf400555388fb","observation_id":"2062e00a-2db2-4ad1-9fb0-dcc32d015b52","resolution":{"observed_at":"2026-08-15T15:25:50.879728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.864192Z","title":"IEEE Trans","venue":null,"work_id":"236e091a-875d-49c5-b807-baf2219fc12f","year":2011},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.283399Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:45e9afc1418828f53a8aaad99ac2f8ff382b508608549cec25ec67941156ed4a","observation_id":"3824e500-0a89-4a2a-bc0d-a870e92fdc3a","resolution":{"observed_at":"2026-08-15T15:25:50.868295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.852567Z","title":"IEEE Trans","venue":null,"work_id":"c0af5765-332a-46fd-9303-1fe9c14436d6","year":2020},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.287143Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:71ed64ceef6baebc60895c7c54303d8f463759b0048869ad7ebcb1b866051dad","observation_id":"27c5199f-142e-427c-8ef6-ca28c3391581","resolution":{"observed_at":"2026-08-15T15:25:50.856402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.840818Z","title":"IEEE Trans","venue":null,"work_id":"0736596a-ca8d-427c-9c43-079d9815882c","year":2020},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.291357Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:0e92b44e6deecc30b82aad0b9ded1e0d2f961207da3aaaf1e4ef81acb20e1435","observation_id":"cb09b0d2-97c4-41c3-9ea9-af37407a9cba","resolution":{"observed_at":"2026-08-15T15:25:50.844749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.295085Z","title":"Information Fusion101, 101979 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.295085Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:12043fb5d86e2b1b0638ce6020174028a3449343f0c53ed159daa2ead2904ec6","observation_id":"d7a430da-89e1-4fad-ae63-a6c6c7984d25","resolution":{"observed_at":"2026-08-15T15:25:50.295085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04713","last_updated":"2024-02-07T10:05:42Z","snapshot_observed_at":"2026-08-20T17:49:59.394327Z","submitted_at":"2024-02-07T10:05:42Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04713","snapshot_observed_at":"2026-08-15T15:25:50.298604Z","title":"ArXiv abs/2402.04713(2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.298604Z"},"links":{"cited_paper":"/paper/2402.04713","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:7526a55d0e0721ab5c8ba6fd050400ac456ff0b9a9a32e6928601216a82ea798","observation_id":"9da08dcf-8ffb-49c0-b3a7-35591f3c38c0","resolution":{"observed_at":"2026-08-15T15:25:50.298604Z","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.1007/11575832_14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"In: Consens, M.P., Navarro, G","venue":"Lecture notes in computer science","work_id":"1d1ca0b5-b71c-48da-be9f-86156cda9142","year":2005},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.302582Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:db4f17b345de54956f0cbdee305194a7cf5fceae897762dd6db0303d093aa211","observation_id":"a852af15-a810-462c-9a9b-4593e897bda6","resolution":{"observed_at":"2026-08-15T15:25:50.434686Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.306343Z","title":"Neural Comput","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.306343Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:d67e11e7b5ce322858a731110a9344c33e51d0ce2041834ec8c985abc1f69798","observation_id":"0cd91bc7-d8f5-4d22-ba88-339dfb4c73fc","resolution":{"observed_at":"2026-08-15T15:25:50.306343Z","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-15T15:25:50.310093Z","title":"In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.310093Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:caa101dbc1225551b6d6a32bf01f85031867436820fa420191ab2b1bd172a237","observation_id":"3c388fec-04f5-4c94-9cbe-f0f5c9e53d75","resolution":{"observed_at":"2026-08-15T15:25:50.310093Z","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-15T15:25:50.819978Z","title":"In: Meila, M., Zhang, T","venue":null,"work_id":"56ad1766-b4f5-4206-a78e-b0db6ed28e82","year":2021},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.314270Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:bdf25128214af4ef77ce0fe5234e2cd1c2558ad810bbf8414bf5f7405e7961d1","observation_id":"dd78ce41-2928-4258-8068-44da57bb25be","resolution":{"observed_at":"2026-08-15T15:25:50.823869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-20T09:06:47.139490Z","submitted_at":"2021-05-20T09:17:13Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09613","snapshot_observed_at":"2026-08-15T15:25:50.317850Z","title":"ArXiv abs/2105.09613(2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.317850Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:9c0e212e10717dc70b450e593fc3e7d231c28062b05ef37151b0c9b00c143f4a","observation_id":"144583c3-cfa2-4354-a564-91953f6f0b6d","resolution":{"observed_at":"2026-08-15T15:25:50.317850Z","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.1016/0095-8956(74)90054-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-20T11:03:42.707129Z","title":"Journal of Combinatorial Theory, Series B16(2), 124–133 (1974)","venue":"Journal of Combinatorial Theory Series B","work_id":"2ba8ee67-4b98-4306-88d9-184ab7d4f534","year":1974},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.321776Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:988e86132e2be0ae0eb4414d597373067e255880cc4a5792c2cfb8af656afa91","observation_id":"007f143c-bf43-4102-8a23-2d0045597da3","resolution":{"observed_at":"2026-08-15T15:25:50.414265Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.325749Z","title":"Pattern Recognition12(4), 261–268 (1980)","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.325749Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:d279f774aff0253485f41f1fd14e13b3fe530332628ee5f096e0dc2fb792fcef","observation_id":"3760eed0-d450-44d0-b278-b3f209b08c90","resolution":{"observed_at":"2026-08-15T15:25:50.325749Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:25:50.807480Z","title":"World Wide Web (WWW)26(6), 3759–3794 (November 2023)","venue":null,"work_id":"2e893f3c-b6df-4bb5-a4d7-377382b6196d","year":2023},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.330061Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:652a97a10852bb529f05f0701b960e3df933a6bd313efe92192f73272bb0735b","observation_id":"633cd11d-0194-4ee8-ab89-bf617d7cbbbf","resolution":{"observed_at":"2026-08-15T15:25:50.812070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T15:25:50.334467Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.334467Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:e0fe5d87c03a287476b9025aa7cbfb0ce18b47f1b5f998c77e89be3f20ff83b3","observation_id":"7e4b06ac-952d-45c1-9484-7a80318cfb73","resolution":{"observed_at":"2026-08-15T15:25:50.334467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10839","last_updated":"2022-06-22T04:35:57Z","snapshot_observed_at":"2026-08-20T22:22:29.780969Z","submitted_at":"2022-06-22T04:35:57Z","title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.10839","snapshot_observed_at":"2026-08-15T15:25:50.338220Z","title":"CoRRabs/2206.10839(2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.338220Z"},"links":{"cited_paper":"/paper/2206.10839","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:a2c807aa2ecc0391eb202e3357c80d5efae6c37a017e2da504dca3cd6668b42d","observation_id":"09c2a2cb-0304-49bd-a035-52f4b9192a61","resolution":{"observed_at":"2026-08-15T15:25:50.338220Z","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-15T15:25:50.342595Z","title":"In: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.342595Z"},"links":{"citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:4779bec9f4ff4272e6c6049b748b4dfefb531fffd89f2d473fe6eb3df385cf81","observation_id":"5bf183d0-4fe8-4169-81c7-a440988252bd","resolution":{"observed_at":"2026-08-15T15:25:50.342595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18724","last_updated":"2023-11-30T17:22:55Z","snapshot_observed_at":"2026-08-20T21:17:20.005612Z","submitted_at":"2023-11-30T17:22:55Z","title":"Routing-Guided Learned Product Quantization for Graph-Based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.18724","snapshot_observed_at":"2026-08-15T15:25:50.346691Z","title":"CoRR abs/2311.18724(2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.346691Z"},"links":{"cited_paper":"/paper/2311.18724","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:0cde88482639948545f87d33584d79986b292e33d8ecaae613b703759147f874","observation_id":"71c7600a-e448-4779-ae26-1245fd435781","resolution":{"observed_at":"2026-08-15T15:25:50.346691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19651","last_updated":"2024-06-28T04:46:11Z","snapshot_observed_at":"2026-08-20T22:20:25.433979Z","submitted_at":"2024-06-28T04:46:11Z","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","version":1},"cited_work":{"arxiv_id":"2406.19651","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.19651","snapshot_observed_at":"2026-08-15T15:25:50.482736Z","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","venue":"cs.DB","work_id":"97d8d5a2-e07c-42e4-85ba-546c217efc63","year":2024},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.350713Z"},"links":{"cited_paper":"/paper/2406.19651","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:36bffbee26cc6ea0ebdbf869fa479554f9f176828dab90ab2a6b7c24d3c8986d","observation_id":"97959720-9ead-4ab0-bea9-e1d9d207e1dd","resolution":{"observed_at":"2026-08-15T15:25:50.487162Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.03032","last_updated":"2020-09-17T06:08:09Z","snapshot_observed_at":"2026-08-20T22:22:46.358003Z","submitted_at":"2018-04-09T14:49:19Z","title":"Approximate k-NN Graph Construction: a Generic Online Approach","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.03032","snapshot_observed_at":"2026-08-15T15:25:50.354417Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.354417Z"},"links":{"cited_paper":"/paper/1804.03032","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:c9ca5960f55888574b3c453c58c6012ad309cc85e59cd23a4864a3abab4e59a0","observation_id":"f9b6b96d-27e4-46fa-a0e8-5aad0877f9b6","resolution":{"observed_at":"2026-08-15T15:25:50.354417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":10},"total_outbound_references":31},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2607.27640."}