{"as_of":"2026-08-19T11:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45ede8b2099ed9ede891dcfe32f20ebf27417709b4a630ea5f88551b67196592","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-19T06:32:44.657259+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-16T21:55:36.363743Z","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-18T15:05:56.188024Z","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:393c93d7d3ffad5abdab0d785570cc23d3ec720ca533754dc424eee61083779b","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-18T15:05:56.188024Z","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:41f388423741a90a65d1f90fe46f380ceed808b1fe85de167e788074637ade68","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:33ac067604e5a4266368e596a3bd188b7d1f6b665efbdd725f43a536c6070c8c","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-18T15:05:56.188024Z","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:e09edd7b077a72fe1c1a9430ca10f4ca66792f0bb3e830f9f18eb7e8d44b2fac","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-18T15:05:56.188024Z","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:2aec5d44f02bec7bf750ab13a7ed66af611f46779aa61d46dc1209efed6484b8","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:7a242332a3af0f5d7780e29d2682e7338924c9b61953c5d196dd56287f0d3f1c","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-18T15:05:56.188024Z","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:de3e5b0ececf64e824a20169ef9161e4711517335a84304367db1f67db17a058","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-18T15:05:56.188024Z","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:a2b75918ac172b82b513b2435f7ec0657b3c2f5bfbce94e7f7eba58ea9ae6fa1","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:151918ab199c7fe4b1d580e0342587aa87467f87bc2d7c6e185f0a2f070a2f98","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-18T15:05:56.188024Z","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:843a5de03df1229ee495a211f514611c65b61027f52f0af65c930e5bbb38a1b2","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:55592649804ab30a0b6f2da263cf3129c1de80a0bfafdbb3465d737bb57a8e14","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:a9223c8e491e9061dcde9b3c55828e7f9896d3e0515d1ceafed787106159e355","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:33c2cce21ee79d13e65e20d310c1a5a689945195d39866deef6627e3dd5c5d5d","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:cebe05bd89a81e819adc38f26429e351d1cd283954fc37b7a201fda5be955f5a","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:65f07078544de82cc079de6e40c49d6715be7c9b0bac544101a00693b4785c7c","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:c4edf0cd93ff852d4a45c5f01e8da85c647a25afd856e5a02d110b526198e01c","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-16T14:20:40.887349Z","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-18T15:05:56.188024Z","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:4c15b6631cd9facb385bcdcd8284dfea4ab75fbac3bf2cbe85590855aba059fc","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-18T15:05:56.188024Z","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:731a5232993c12ecd0ed24a64a0cae80f7c1cc2955ec90efd4579516affc49de","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:81f245dfd1978ba0f4a97ff5e5feecb98b8de63f602b734b6a3749f41692b0c8","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-18T15:05:56.188024Z","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:f99261895e3aaea43dd4d9f04825034cefe281ba26c240ae33f7a64bc5640ecd","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-18T15:05:56.188024Z","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:8e99ae3bd388e93d45e7dc4de35e31baa8817369eb6db4badebef2d40fb23cb9","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T18:23:26.864022Z","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-18T15:05:56.188024Z","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:b7c96a12e6e6cc24cf6bbce0ef12925ba9bf0214ce20a86905ca5af6dc1607fa","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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:25:50.408143Z","title":"Journal of Combinatorial Theory, Series B16(2), 124–133 (1974)","venue":null,"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-18T15:05:56.188024Z","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:5acd0447ec70bfcedd524ec910cb377167e622a440ab9cc0b5418612a87214a7","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:ac36a8979b722e0a0e1932694da2b64655c4d870e972cfbe5df964da3bccca7f","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-18T15:05:56.188024Z","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:5f6ae80ea2c22a711a2f8a22ae5de4e4b41b6431e65c005ffb3e9c734efb8610","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T15:05:56.188024Z","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:0f37ac52531c5078322e1ab5c8976177e274a35b9ee47ee4f2a6c5bb4b826237","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-16T16:51:17.932913Z","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-18T15:05:56.188024Z","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:e8e4c66f818e6a1cd95e34dd1ecda9428bf195c3a7c6da91d70df7bece9a6f29","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-18T15:05:56.188024Z","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:bf2df3e3ff9988755ea972aceb4fd5b133e688e9cb0bf88d068ce0af367e059f","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-16T14:38:45.315363Z","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-18T15:05:56.188024Z","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:122b3e53ac546638e259d519fe0132170405ed182f66591e1183c6e806df82c7","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-18T13:37:45.388937Z","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-18T15:05:56.188024Z","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:5c153be9efaf4c5ebece6a6e5af18c01deaa1016784a9b6950a148c3cb682fd4","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T19:27:52.578780Z","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-18T15:05:56.188024Z","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:f73050a477c8896cd93c33d0d0d15fcd10fc92adebf31023385bba7d1c811e41","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-18T15:05:56.188024Z","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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2607.27640."}