{"as_of":"2026-08-11T01:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5b7463ecdc780fc25bb60e48c1d0dd83b4979377d773c0b4f74a70b08f9f0d4","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:43:10.789411Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.10139/citation-record","integrity":"/paper/2507.10139/integrity","json":"/paper/2507.10139/citation-record.json","paper":"/paper/2507.10139"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:15.369285Z","title":"https://github.com/facebookresearch/pysparnn,","venue":null,"work_id":"176c694d-a467-4d46-af8c-4049f70e2deb","year":2024},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:08.999534Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:76d9edb4f4bb5df643e94bfd281d79efce644bad0a0eba24c525174397bc7a0f","observation_id":"2cd9acab-b7ad-442e-81d0-aba4f5145610","resolution":{"observed_at":"2026-08-06T17:43:15.444685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:15.259376Z","title":"[Accessed 25-07-2024]","venue":null,"work_id":"25d62977-51d9-460e-9aca-8130b5e3b0d6","year":2024},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.031715Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:c8672ece09baf1ec0bd7a3f59af8976bbb0eacc332083d95f9f763e8c1398882","observation_id":"4b27b7ba-d105-434e-9c81-69c5057fe455","resolution":{"observed_at":"2026-08-06T17:43:15.292762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:15.144154Z","title":"https://github.com/pgvector/pgvector,","venue":null,"work_id":"9236d78c-eb4c-4de5-bbd0-380a456ac9e6","year":2024},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.085459Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:629c6a91d5a253bf5a720a32b5fc8d4bff784ec398c38c7fd1abcab1e568d800","observation_id":"f1512cd3-d1bb-448b-8d80-80fa3ee7b975","resolution":{"observed_at":"2026-08-06T17:43:15.204939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:15.028059Z","title":"https://github.com/yahoojapan/NGT,","venue":null,"work_id":"c6200148-ec4c-4025-ba09-6881d222dcc4","year":2024},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.175425Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:bae74dc4e2581e5ebed0a7e3a48bd2b6a34c5bcd4da3981ea1cb61cc506f380f","observation_id":"c7b29dd3-5b2f-475f-bb34-0839c0c0f300","resolution":{"observed_at":"2026-08-06T17:43:15.084341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:14.888419Z","title":"Additive quantization for extreme vector compression","venue":null,"work_id":"a3313476-8b8f-4847-8525-685a012a76db","year":2014},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.216468Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:4fbf5c1e80e9e626cf1d0496a067ffcbc3caf1ea9b177bca0623553e23da91e4","observation_id":"26746b13-9be7-4049-8420-1102d4f51665","resolution":{"observed_at":"2026-08-06T17:43:14.932983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:14.741333Z","title":"Bhatia, K","venue":null,"work_id":"1c3aabbe-7192-4e28-9a9b-96632b252a37","year":null},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.289566Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:98f9868e85a4d9cb165e7e3621e1c5452015c55d107e812a901a2a33e9f0bd34","observation_id":"54fcfb47-be36-470f-af8c-da012725e21a","resolution":{"observed_at":"2026-08-06T17:43:14.786788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:14.582467Z","title":"Learning from labeled and unlabeled data using graph mincuts","venue":null,"work_id":"f66e2b25-63b9-4098-96ef-f17ca971bb3b","year":2001},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.354766Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:0324d3226dd9ae127de0be466435a84c5f5269f2caac9ea118ae97167a62b142","observation_id":"acbfdbc1-66ea-4116-9862-36e95acb88e7","resolution":{"observed_at":"2026-08-06T17:43:14.647735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.03675","last_updated":"2022-04-12T03:24:00Z","snapshot_observed_at":"2026-08-10T23:25:43.591622Z","submitted_at":"2020-05-07T18:00:02Z","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","version":3},"cited_work":{"arxiv_id":"2005.03675","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.03675","snapshot_observed_at":"2026-08-06T17:43:11.026472Z","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","venue":"cs.LG","work_id":"1194f6ae-498f-4a81-9907-55d0164d7164","year":2020},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.383430Z"},"links":{"cited_paper":"/paper/2005.03675","citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:eedb3adb8a6d262a00249b27495c5d159cacddadab75fc42f6401ab9debcf508","observation_id":"9b0cefc8-ea51-4b0b-9ac5-6c8aa0f03b45","resolution":{"observed_at":"2026-08-06T17:43:11.096642Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:14.385253Z","title":"Spann: Highly-efficient billion-scale approximate nearest neighbor search","venue":null,"work_id":"5a74c5c1-e18c-44fa-8155-40bc4ba15152","year":2021},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.482542Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:e2ba81056f55dc453b39aa2117e87bc0828eda71c325f81e690b6df11a2e68a6","observation_id":"88a00807-5f08-4ad2-bef7-1ee5ea7f7f8c","resolution":{"observed_at":"2026-08-06T17:43:14.473818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:14.226219Z","title":"Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks","venue":null,"work_id":"81770b91-bc37-4d66-8fdc-207f6efb3542","year":2019},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.524725Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:8565901a8254eb843f23d16b3117b4046509484d509f15b18065640fba0c9587","observation_id":"eab97665-af01-415f-8703-d94ec87d7c71","resolution":{"observed_at":"2026-08-06T17:43:14.289801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:14.074078Z","title":"Performance of recommender algorithms on top-n recommendation tasks","venue":null,"work_id":"1ab42c1e-e81d-4197-89da-3c10b0a50290","year":2010},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.558507Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:10fe65de7da9305beb370af3eac669f5718bd831cc3d492426ad0d0616c4dd10","observation_id":"cc0f876c-54bd-483c-a157-4adb50a49ed9","resolution":{"observed_at":"2026-08-06T17:43:14.180531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:13.938990Z","title":"de Sousa, Solange O","venue":null,"work_id":"34c4aad3-03ab-461d-895f-8b44df92e865","year":2013},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.614922Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:0651f09f534c9db8c932a24187c3f80db3d64a1c300362c17917713714495315","observation_id":"5f9fa965-70c2-4707-93e5-274058e4854c","resolution":{"observed_at":"2026-08-06T17:43:14.001898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:13.815421Z","title":"Dean, Mark A","venue":null,"work_id":"6af01ad8-4e30-4128-93c3-0351a1b94c7a","year":2013},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.691986Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:e1affbd64dbcb9b4f988607afe3735e0a50abe48fa18279167f734de325cbefa","observation_id":"5950bd5c-d556-45b1-97a4-5e5a8574f9b7","resolution":{"observed_at":"2026-08-06T17:43:13.866172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:13.664748Z","title":"Optimized product quantization for approximate nearest neighbor search","venue":null,"work_id":"0b038c86-49c1-4cb5-9634-4a169f05eb45","year":2013},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.741015Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:90d0c58d52279a318c5af5d4df3cb7ee2718abf5fcf0dc31f0863a4defb80aa9","observation_id":"7dc5b696-7072-475f-9daa-87c51aa511e1","resolution":{"observed_at":"2026-08-06T17:43:13.735265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:13.508642Z","title":"Accelerating large-scale inference with anisotropic vector quantization","venue":null,"work_id":"6d2bb441-0fed-4cdc-89e1-b3033b0f0199","year":2020},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.790452Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:98abc9f769b2a6eccb6441b1e107bc7fe163f051a33e4ea0ee7518f21a691263","observation_id":"334e6d46-6193-4c40-a5a9-b022235a05a4","resolution":{"observed_at":"2026-08-06T17:43:13.593039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:13.354965Z","title":"Grale: Designing networks for graph learning","venue":null,"work_id":"96297e50-f4a3-4b2c-ad6b-fdec202e43fc","year":2020},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.881603Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:f9b1a831024df84d082b920365ec58dc3b9caebaf9a74f27ed7eea1fe3a2dee1","observation_id":"a802f922-73e6-40ce-ad3b-4d72c8758464","resolution":{"observed_at":"2026-08-06T17:43:13.442754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:13.119745Z","title":"Billion-scale similarity search with gpus.IEEE Trans","venue":null,"work_id":"f186f13f-fb5d-4ad5-9cce-a3a469e7d551","year":2021},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:09.920021Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:27e6c33f510719114438c23f4a3f3eeab4e508709478ff0cc77de81e05875dc7","observation_id":"ccbfa232-e202-4e4c-b4cf-9b9b3d2272a9","resolution":{"observed_at":"2026-08-06T17:43:13.233651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:12.871079Z","title":"Fast k-nearest neighbour search via Dynamic Continuous Indexing","venue":null,"work_id":"9d332ed9-e798-4886-ab4b-560f4ce4f8ac","year":2016},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.000013Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:210e447255759399ff63d51b82d6abfde1d6fe55be08c9dde31e82f3180478e8","observation_id":"dc5872a8-1d6d-4bb0-87f1-8fb5a8178497","resolution":{"observed_at":"2026-08-06T17:43:13.013291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:10.069490Z","title":"Malkov and D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.069490Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:3379631458b8a4451b4561ee9aa8fc09a22fb935a393469676ef2631796f42d8","observation_id":"a409e032-05fd-4c63-ba84-c31f89a2b336","resolution":{"observed_at":"2026-08-06T17:43:10.069490Z","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-06T17:43:12.580148Z","title":"On potts model clustering, kernel k-means and density estimation.Journal of Computational and Graphical Statistics, 17(3): 629–658, 2008","venue":null,"work_id":"334631cd-c084-4720-84a8-7b5ad8debf2f","year":2008},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.137970Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:9db9174c52e4c6ac0cf4f1981c271c9c1bb6c6481db035a45a36d59babc635e9","observation_id":"85931130-d111-4a83-b173-58282676384a","resolution":{"observed_at":"2026-08-06T17:43:12.695629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:12.288418Z","title":"Learning and inference via maximum inner product search","venue":null,"work_id":"4aee1222-6f56-490f-a061-d0ef4f6705b4","year":2016},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.221765Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:0e6edb1b4a0251617c0e294976992df63ae27dc26f071cdc019b07538ea3e805","observation_id":"c891f6a9-cec8-44b9-9c82-5bfbc6474726","resolution":{"observed_at":"2026-08-06T17:43:12.371908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:12.186027Z","title":"Large scale distributed semi-supervised learning using streaming approximation","venue":null,"work_id":"1d7e0ad4-20c0-4471-ad73-be02f70863ac","year":2016},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.259898Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:1d036f74a54d86fd024157c1c496a327060893e6fdc2381db86b9ac1e1bc73ca","observation_id":"5d992856-8da3-4309-81d3-7673c57cf26f","resolution":{"observed_at":"2026-08-06T17:43:12.237592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:12.064674Z","title":"Soar: improved indexing for approximate nearest neighbor search.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"a5dc367a-7090-4cf2-a3b8-90f87256a6e6","year":2024},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.342528Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:5900e70cf140a07756eb52da23a41029dfde309b0d2d84fe05a7157bbb4e83b9","observation_id":"06a44c07-21cd-4814-8f7e-665f885f6fea","resolution":{"observed_at":"2026-08-06T17:43:12.096201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.912988Z","title":"Scalable k-nn graph construction for visual descriptors","venue":null,"work_id":"42fc1933-d774-4bc2-a05d-f44e37137722","year":2012},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.411379Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:777cc135c6c65a83dea773c4a16d2d811eba5872ce069f89105fad536fea13b1","observation_id":"d4a08802-3b04-4987-8611-22e66177585d","resolution":{"observed_at":"2026-08-06T17:43:11.985620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.823314Z","title":"Query-driven iterated neighborhood graph search for large scale indexing","venue":null,"work_id":"a40fd14a-4659-4d43-9530-15a82e7b7d76","year":2012},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.448935Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:e9640b5b35d0a08488542f3b6bc0706af8ae5b61a5d1bbdce31b06615f1dfb2c","observation_id":"6730ea72-a6aa-4cad-9c2b-c9c2d2c3b104","resolution":{"observed_at":"2026-08-06T17:43:11.860478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.689897Z","title":"Microsoft academic graph: When experts are not enough.Quant","venue":null,"work_id":"37f9e9ac-a139-48f1-b625-9ef330d74c88","year":2020},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.515252Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:889a56ea0ae79909d267ae34fba3eb0bf646ca3a7c10b33e4fdd35e31246f1ad","observation_id":"7395d6fb-43da-4399-bd5b-cbc203f74298","resolution":{"observed_at":"2026-08-06T17:43:11.740619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.559740Z","title":"A quest for structure: Jointly learning the graph structure and semi-supervised classification","venue":null,"work_id":"f4ad51be-12fd-4a47-a937-220d0e45c3fa","year":2018},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.572146Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:6e62af9e992d9948e3adf0f8cdf47ee4efc30dcc6b4fe7604a4f254e2a84a0b5","observation_id":"491cce4d-a577-4304-8813-6cec491f37b4","resolution":{"observed_at":"2026-08-06T17:43:11.607614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.435057Z","title":"Cohen, and Ruslan Salakhutdinov","venue":null,"work_id":"e62b3b3b-efbb-4f12-ad10-15ca4d7f06cd","year":2016},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.619369Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:6660a7ddfcf17ce5ed0be17dc64c401faf97ccaa68619548bf9d7f071d4c98dc","observation_id":"29718b20-a32b-4383-921a-6dfc0033e723","resolution":{"observed_at":"2026-08-06T17:43:11.509585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.315034Z","title":"Yu, Daniel Niels Holtmann-Rice, Sanjiv Kumar, and Pradeep Ravikumar","venue":null,"work_id":"b86a53d6-002d-47c5-8bf9-6385c99aaeab","year":2018},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.748466Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:e8d4c6f252f9a49f3f19e93da4f14cde4da91efdfd0a71a38631507afe9bd54a","observation_id":"2c90e756-1a08-4b03-b0e7-7e7b9b21a838","resolution":{"observed_at":"2026-08-06T17:43:11.352415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:43:11.155278Z","title":"Learning with local and global consistency","venue":null,"work_id":"f2aa216f-f522-4b71-a6c7-2bac88323638","year":2003},"citing_paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:43:10.789411Z"},"links":{"citing_paper":"/paper/2507.10139"},"observation_digest":"sha256:bc0ae215eb31523beac9bafc82e23710f9bf610b0dd2e47fbf171f586e7304e9","observation_id":"66870d09-6ee0-4c49-8f43-ec6d9c48725b","resolution":{"observed_at":"2026-08-06T17:43:11.247673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10139","last_updated":"2025-07-14T10:36:15Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-06T17:36:11.378766Z","submitted_at":"2025-07-14T10:36:15Z","title":"Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2507.10139."}