{"as_of":"2026-08-11T12:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27b6e7676b36b9a2722d422ffa1b28a203167e225831cbba98a37a60786fa915","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-11T06:34:44.6726+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-08T01:03:01.631570Z","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:b916c410707576892b96732b7f7e792ac9f7371f17cf99f195b2df991186e396","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:d2164671ef458ae2d8b09e50f3ad408416c3a1b85b7779be17403cbda2187957","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:16146234fd7ea8ba2620d29a813c1631d150f1e40f84c1bb7fcb9d6cc9b082cb","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:1f06507c760f2ed3c6adb4695591d5b8a90b54de6cde591c7696ca8abebcd68a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:69335ddeed9d5ba88a1ca4989a93ef9cdad2747a3901ec1cc4ccdd755e3325c4","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:9865a7d8a23940d1821f6edbe466b2c6412a6916edc1e54b73a93b03903abbd2","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:a69f1b69d36e9da491180a3deca0603b5d1c2e1c799b2ba5dfaa714a8ef28b25","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:1ff50337f094ca63b759b37f97ab909fef9f402bc4f46d8a0d4a83b40d62481c","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T10:53:20.447413Z","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-08T01:03:01.631570Z","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:4deb3ea126136143c8a580e7c4c393eb8e1ec43857b570ab8a60604a51b3fa5a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:432d56b11767d468bfbdcb9b0a3260e342f9a6fdb75a2cec1ff0fa2ff4e6dfb3","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:1b3e0b65ad10e438d93f619da65ae22962c4f7a6f4a678e01a0cae90ad99e1e1","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:d8f72108365f6635eb3e789e6a534105e7abe4b209fa3444ba93275b63dd9e45","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-09T21:29:17.277483Z","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-08T01:03:01.631570Z","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:1bfa9d274d0cb69415bb0883de54dd664fa8e8d7801e492e010cbe80af7a4ef4","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:c7e3b1f303b32bf2f75684ffc84c89abc32b4861b8f7ed704f5d9d26eb30f2e2","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:759cfbf3c089ece1ade4156afc46ad9e073d848d16014b072d78a1358bb9d18a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T01:03:01.631570Z","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:c2426f3db390deeb9522610e01fb89aa4edc10baa21ab9cc72817597bb83024e","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:a24041b2f7c758b0a067012d2b802f64a5ad756b5629ea398244542363c23981","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:e0f4c7ee7707f8e829527f6fd7f06a3c846cb61114a207903ef74702324ef24a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:bcc7b26d26f44fc95622e563e74103bc1b35f0ab0738681634524affae275796","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:ba2743e3af13bc2ee23e6b324dcf856d12d10c475af057fcfaabe964cf7d00a8","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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:7c76d7631b8f18f8abee1943efb43e2dcd7dc8a4c87daac895f44b961d2caf73","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+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-11T06:34:36.301508+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-08T01:03:01.631570Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2607.08382."}