{"as_of":"2026-08-21T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb081d66555815c2bd1097e2a68eb6adea92e002996c022cc6026a705e44fe92","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T08:21:57.159108Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.08382/citation-record","integrity":"/paper/2607.08382/integrity","json":"/paper/2607.08382/citation-record.json","paper":"/paper/2607.08382"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:26:59.263009Z","title":null,"venue":null,"work_id":"0a4b9494-7869-40f2-9835-1dbbd55de47a","year":1997},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:8f371c76ae45175ff3f0649e7d074e5dcbd61069915250dd744de238f21801d4","observation_id":"ac26d9bf-e913-460b-8ec6-98acf635e3ad","resolution":{"observed_at":"2026-07-10T08:26:59.264028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1997.666900","doi":"10.1109/sequen.1997.666900","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Broder, A","venue":null,"work_id":"8235a944-530b-46cb-8fa1-c3b95113c8af","year":1997},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:2b469cfb73e506fe78e7787d3c1eefb6400e048d3778fc5468321e585729c6e1","observation_id":"b0cce65c-81f4-4403-873c-5c7478f0cd22","resolution":{"observed_at":"2026-07-10T08:26:58.875507Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:03.236343+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:03.236343+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7136.308081","doi":"10.1145/3077136.3080813","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1145/3077136.3080816","venue":null,"work_id":"ad53d1db-e949-4cb9-b4ee-65519f6aaf9d","year":2017},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:f8cde93cfad99635d170fd028dd0727097f838908ec2549433f3c35c3be7d7bf","observation_id":"e189ddf2-c0e4-4de2-9dcd-b02046ee2543","resolution":{"observed_at":"2026-07-10T08:26:58.848763Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5399.305544","doi":"10.1145/3055399.3055444","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2017 , booktitle =","venue":null,"work_id":"c2a08e4e-4211-419d-a078-ea3947a75fdc","year":2017},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:dbb10979c0ea12ccebfbf213bbfc60d6e8b76fccafdde854bd93de7675aa7320","observation_id":"e7e54037-77f4-4585-a808-00aafc50e0ab","resolution":{"observed_at":"2026-07-10T08:26:58.856041Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T08:26:59.268134Z","title":"Doan and Chandan K","venue":null,"work_id":"a52a3d9d-16e0-414b-83bc-65b99bbf920e","year":2020},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:cfc16bbd69cdf3299ba08f902c9cc35ecba66a00122cbe27ec209b69362589fe","observation_id":"cc1664f1-e859-43a5-9349-ae56e1207393","resolution":{"observed_at":"2026-07-10T08:26:59.269198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6423.338015","doi":"10.1145/3366423.3380150","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1145/3366423.3380150","venue":null,"work_id":"c32b43d8-8d8c-4b2a-a397-1c03160532d3","year":2019},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:44a97677aef5ff52d8ce94a0a6414c2180aeebb332353043e090e264c6c2da8a","observation_id":"3bcfb2fc-5fea-4b91-a362-6c98d00109e7","resolution":{"observed_at":"2026-07-10T08:26:58.870814Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:04.028268+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:04.028268+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/d19-1526","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.18653/ v1/D19-1526","venue":null,"work_id":"b37898ca-1bfd-443c-ba0f-bb3dd4b20532","year":null},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:56eb447894d399435537be383e4cd6df1b2a3b17478e31f48754acefab087b90","observation_id":"cdc7291e-73fe-43c5-8e77-ebd3d828636d","resolution":{"observed_at":"2026-07-10T08:26:58.850889Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:04.260567+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:04.260567+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4647.368160","doi":"10.1145/3664647.3681607","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1145/ 3664647.3681606","venue":null,"work_id":"57b0a694-27a3-49d5-8e1a-0cc9baf522cd","year":2024},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:7d80b37ed1789d4c1e79b97aa3e5621f1802803ab95aa1fe0ded9b82a45fb50d","observation_id":"e21ca844-230d-41a8-a2e9-cebcecddd308","resolution":{"observed_at":"2026-07-10T08:26:58.859053Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.08942","last_updated":"2021-02-17T18:56:03Z","snapshot_observed_at":"2026-08-19T21:16:10.282745Z","submitted_at":"2021-02-17T18:56:03Z","title":"A Survey on Locality Sensitive Hashing Algorithms and their Applications","version":1},"cited_work":{"arxiv_id":"2102.08942","doi":"10.48550/arxiv.2102.08942","metadata_source":"pith","pith_arxiv_id":"2102.08942","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A survey on locality sensitive hashing algorithms and their applica- tions","venue":"cs.DB","work_id":"e9b400cc-c337-42df-9462-f9b88d5f8729","year":2021},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"cited_paper":"/paper/2102.08942","citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:eea8982bb0b7ce22d5c9d9b214720c02646144612d948ba46e43d4df0b0195f5","observation_id":"e89ef384-c085-458f-a233-4c33a9fa17d1","resolution":{"observed_at":"2026-07-10T08:26:58.912118Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2411.04257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:26:58.915889Z","title":"Khan et al","venue":null,"work_id":"a272d81f-bbc9-47f8-b97a-9b610f14fbaa","year":null},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:59e0f8e3314cd14b29f2c188b72fc6f7c15b004cffb6811b1e04da426c014424","observation_id":"29000a92-c4a8-4b38-8ac5-2877697e1f78","resolution":{"observed_at":"2026-07-10T08:26:58.917473Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T08:26:59.266383Z","title":"Deduplicating training data makes language models better","venue":null,"work_id":"33279d93-bbad-43f0-ab3f-22b7ed1bef22","year":2022},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:8fffb0055b5cf09e8bec7643f6d072ceb560f255e31ad53afc5574d479720e64","observation_id":"3bccee02-0fb8-4067-bb19-2e6fe4d54da3","resolution":{"observed_at":"2026-07-10T08:26:59.267574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.acl-long.577","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deduplicating Training Data Makes Language Models Better","venue":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","work_id":"59f1bbd1-2ddb-4173-821f-545a910ec2aa","year":2022},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:c8745d6b7531a296d7bedb9637b2d8b75b90043fff43c933d64f172b6e6ed177","observation_id":"c7f4fb13-81f7-436e-805b-ed56dc81419b","resolution":{"observed_at":"2026-07-10T08:26:58.845600Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:50:54.596138+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:50:54.596138+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.12906","last_updated":"2021-11-07T15:06:54Z","snapshot_observed_at":"2026-08-21T11:11:26.469103Z","submitted_at":"2021-03-24T01:02:12Z","title":"CSFCube -- A Test Collection of Computer Science Research Articles for Faceted Query by Example","version":3},"cited_work":{"arxiv_id":"2103.12906","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.12906","snapshot_observed_at":"2026-07-10T08:26:58.913402Z","title":"CSFCube -- A Test Collection of Computer Science Research Articles for Faceted Query by Example","venue":"cs.IR","work_id":"f539bf3f-71c3-4211-8699-221e31d95519","year":2021},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"cited_paper":"/paper/2103.12906","citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:bd7bfb823eadfa761d0ada3802cf7aead1d6a3fa0633edc2d806b451d39f18ba","observation_id":"d97aec67-3c18-43f8-a37a-a5205fc3ab74","resolution":{"observed_at":"2026-07-10T08:26:58.914724Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07-10T08:26:59.264604Z","title":"Veidenbaum, Alex Nicolau, and Tony Givargis","venue":null,"work_id":"f4e31e1c-8657-4427-9420-0b62900d2e2c","year":2023},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:42a6ff7457bfdd05c489ddab67924758274f7bf087888bab1242f5342166f99d","observation_id":"2b6109b2-3ff9-4535-86d5-e8d139089826","resolution":{"observed_at":"2026-07-10T08:26:59.265790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0305.359931","doi":"10.1145/3580305.3599315","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zhuang, Y","venue":null,"work_id":"25cb2196-8283-424a-b8c1-56185f9f4f5a","year":2023},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:077bf1bdf7e138e1fc0be39a6975961c3041b524d7bbf283e8ff161984a986dc","observation_id":"2f658908-77f3-4117-a9d6-c9b231e6e7a6","resolution":{"observed_at":"2026-07-10T08:26:58.861866Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2021","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:26:58.871653Z","title":"emnlp-main.308/","venue":null,"work_id":"d11fa4e1-b5c2-404e-97ff-f91cfa301bbc","year":2021},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:27a314aad849c1ff9369dd73e2bd30c25f9af1f812cdf793a49e70e1962423a7","observation_id":"3ea20308-4fec-412d-afec-7b214ac06951","resolution":{"observed_at":"2026-07-10T08:26:58.872731Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-03T15:08:46.838612+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T15:08:46.838612+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2021/133","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.24963/ ijcai.2021/133","venue":null,"work_id":"ec54df5f-ae60-47ec-b5b1-bdc5be28088d","year":2021},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:8d034993cd9ba963e3228bce1851ecb4504afba0e74fc9690f0dddb4597b0d8f","observation_id":"2205db94-58c9-4496-a424-a3e26399c930","resolution":{"observed_at":"2026-07-10T08:26:58.868083Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:05.316219+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:05.316219+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.emnlp-main.54","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.18653/v1/2022","venue":null,"work_id":"cac7a3b2-be16-47f3-9ab4-b0caf63245d5","year":2022},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:cc36a7ce8f8c5df814ee9255e927e95b86f469f44046becd9f5f18f6ee43fd08","observation_id":"787b3e6d-09fd-450e-9991-f2fa0917356f","resolution":{"observed_at":"2026-07-10T08:26:58.866324Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:05.560122+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:05.560122+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2903.291483","doi":"10.1145/2882903.2914838","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1145/2882903.2914838","venue":null,"work_id":"9840ab09-7cf7-4de2-833a-156d901345a4","year":2003},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:10643e218f6818af88d584bcfb4cfacfbe27621577546dc3fa76f1301ce5fabd","observation_id":"ef11912a-c37f-47ac-9693-a0478aeb8776","resolution":{"observed_at":"2026-07-10T08:26:58.864449Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:05.817984+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:05.817984+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/p18-1190","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://aclanthology.org/ P18-1190/","venue":null,"work_id":"195fc83e-3275-44a1-8668-13d658f637ac","year":null},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:97315214b7841523d336416b87a98d9deb89135efcef5d025b424761d2e4665a","observation_id":"352fcfbd-eef3-432d-b1ae-10ec375c53ea","resolution":{"observed_at":"2026-07-10T08:26:58.843948Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:06.065518+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:06.065518+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2020.acl-main.71","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://doi.org/10.18653/v1/2020.acl-main.71","venue":null,"work_id":"27e8191c-b02d-4f09-82a8-3279e42a37bf","year":2020},"citing_paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T08:21:57.159108Z"},"links":{"citing_paper":"/paper/2607.08382"},"observation_digest":"sha256:f3e11dbfb7370521595686ba661508ef9f3bbeed478df17378b736f63f1f84c2","observation_id":"267efa19-41fe-49a0-838c-aa1cf2deb5cc","resolution":{"observed_at":"2026-07-10T08:26:58.852613Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-18T09:51:06.311442+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T09:51:06.311442+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08382","last_updated":"2026-07-09T12:01:40Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-18T18:57:10.013102Z","submitted_at":"2026-07-09T12:01:40Z","title":"H3D: Benchmarking Unsupervised Text Hashing for Fine-Grained Document Deduplication"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":1,"verified_exact":10,"verified_fuzzy":3},"total_outbound_references":21},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2607.08382."}