{"as_of":"2026-08-16T05:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35ad6c53d7311f5995e3c2b1a7d6ead1da5b0f92736008038a4e0a42c36f7567","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:16:48.114805Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:57:48.905443Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T13:57:49.343968Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"cited_work":{"arxiv_id":"1908.03449","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.03449","snapshot_observed_at":"2026-08-14T13:57:49.343968Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","venue":"cs.CR","work_id":"a1bea6d9-db54-4ff9-a8e2-b07eee18c87d","year":2019},"citing_paper":{"arxiv_id":"1908.04014","last_updated":"2019-08-12T06:02:31Z","snapshot_observed_at":"2026-08-14T13:52:20.171550Z","submitted_at":"2019-08-12T06:02:31Z","title":"Douglas-Quaid -- Open Source Image Matching Library","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:48.905443Z"},"links":{"cited_paper":"/paper/1908.03449","citing_paper":"/paper/1908.04014"},"observation_digest":"sha256:4133d9f844cbe714f9c44a471ba59eb6f0d2cce44e040c576f3d7a93bc9a0ea1","observation_id":"8e130e68-f740-476b-b45f-90f5d880286c","resolution":{"observed_at":"2026-08-14T13:57:49.348239Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.03449/citation-record","integrity":"/paper/1908.03449/integrity","json":"/paper/1908.03449/citation-record.json","paper":"/paper/1908.03449"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.037880Z","title":"CNN for task classification using computer screenshots for integration into dynamic calendar/task management systems,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.037880Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:e4d63c6441402b0be16c86240b23f082f82305dd8e9028a049c6961d618abb50","observation_id":"417b2d12-3eb9-4acc-80f1-f67ec1438abc","resolution":{"observed_at":"2026-08-14T14:16:48.037880Z","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-14T14:16:48.740355Z","title":"Predicting Phishing Websites Using Classification Mining Techniques with Experimental Case Studies,","venue":null,"work_id":"1e7c2e08-33c1-40d7-b448-a8394f90e7ed","year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.043083Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:ae89d58ace96a37fbd1feb6b72b8cd28e7d9483d29b2bdf814ac226e9d0740c9","observation_id":"35f166b7-9a20-4b76-8227-a7639bba199a","resolution":{"observed_at":"2026-08-14T14:16:48.744808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:16:48.047870Z","title":"Fighting Phishing with Discriminative Keypoint Features,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.047870Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:3778518e811d6d89504055f73a6c0cc25729688e0382639d48b8f17ad8fa5f84","observation_id":"1346a6df-4b05-4182-8a6d-33b7f63ee66b","resolution":{"observed_at":"2026-08-14T14:16:48.047870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.052625Z","title":"AIL - The design and implementation of an Analysis Information Leak framework,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.052625Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:8d24b209bf3b8642808958a631bf641b05ee795e9ba35520ea46e91e88374d5e","observation_id":"79d0c49f-e5bb-477d-bf1c-69c420373d87","resolution":{"observed_at":"2026-08-14T14:16:48.052625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.057087Z","title":"MISP: The Design and Implementation of a Collaborative Threat Intelligence Sharing Platform,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.057087Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:f4426119d769c87bf5331af2c1426088d69af3b7cfddaf1d7193a14accd35cd6","observation_id":"521ecc02-77ce-4780-89a3-c5ff29c8f242","resolution":{"observed_at":"2026-08-14T14:16:48.057087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.061155Z","title":"Large scale reverse image search - A method comparison for almost identical image retrieval,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.061155Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:3162f2695e4a49ea2753c79bf7f9465fed8b768769ab2027c2a44eae5bd1ceac","observation_id":"6a002a93-21cd-434c-999b-91f53cd56a61","resolution":{"observed_at":"2026-08-14T14:16:48.061155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.066200Z","title":"Implementation and Benchmarking of Perceptual Image Hash Functions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.066200Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:57e08864c4c51faaa86606b8c8b398893924ff8e65132636276398297645123b","observation_id":"a5ed4380-73a4-49e7-933d-e0b7be7cf543","resolution":{"observed_at":"2026-08-14T14:16:48.066200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03917","last_updated":"2018-08-07T08:00:22Z","snapshot_observed_at":"2026-07-06T05:59:17.615576Z","submitted_at":"2017-09-12T15:41:34Z","title":"Image Matching: An Application-oriented Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03917","snapshot_observed_at":"2026-08-14T14:16:48.070681Z","title":"Image Matching: An Application-oriented Benchmark","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.070681Z"},"links":{"cited_paper":"/paper/1709.03917","citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:1080d9e2dc0c45c91ea34b647b302415fbf45c54a151f8b2b01277c2ae00a083","observation_id":"0cc9aec0-27b8-463c-8e75-2339083cacb9","resolution":{"observed_at":"2026-08-14T14:16:48.070681Z","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-14T14:16:48.699802Z","title":"Classificator for pictures matching and clustering. Fast and visual.: Vincent- CIRCL/visjs_classificator","venue":null,"work_id":"369905b9-df46-4b92-8ec0-cd083f62c585","year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.075755Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:7715ce468ccdab6b5c1a1595c0776b8d7dfbaffe50e5b55c16ca43a34a5f7f95","observation_id":"5da2a139-de53-43ad-93a5-eae3bfca6b35","resolution":{"observed_at":"2026-08-14T14:16:48.704050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:16:48.079712Z","title":"TLSH – A Locality Sensitive Hash,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.079712Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:3cad9c4204f281e3b7a85b464423bf9115c049da9c5188d12aad94095b8d5afb","observation_id":"517e18f9-7fc4-42bf-90e7-fdd4027d7b47","resolution":{"observed_at":"2026-08-14T14:16:48.079712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.084044Z","title":"Distinctive Image Features from Scale-Invariant Keypoints,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.084044Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:a4e6e47855c93aeac944fa8ecef6b9d4eb0757d39c9c024e3d4da224b386c7f9","observation_id":"f3cc9375-9b18-43fd-a835-c7e6b72468c2","resolution":{"observed_at":"2026-08-14T14:16:48.084044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.087917Z","title":"Anatomy of the SIFT Method,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.087917Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:99426efdbf8123b573c3156536adef7a73922736b2bbc2166942c93beb5ca50e","observation_id":"cc974cb3-6acf-43dd-8a02-56fe0a837dba","resolution":{"observed_at":"2026-08-14T14:16:48.087917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.092658Z","title":"SURF: Speeded Up Robust Features,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.092658Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:c1de501fd016f327c7f8ac02a84996653fa53844e4658f0646c82b3865bbfff4","observation_id":"3119ec34-7965-42f0-8a37-991af3715137","resolution":{"observed_at":"2026-08-14T14:16:48.092658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.097048Z","title":"ORB: An efficient alternative to SIFT or SURF,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.097048Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:37b222ab158faa33ef6c37db60b4594db9d6495c92969eb87a86c9bf050116ca","observation_id":"6e8420ad-84aa-4495-aa25-129171fdc487","resolution":{"observed_at":"2026-08-14T14:16:48.097048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.101671Z","title":"A comparative analysis of SIFT, SURF, KAZE, AKAZE, ORB, and BRISK,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.101671Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:07e760d8b58ec4c9d5eb19f87013a9e4ff980d7db2b74be19723b020946219b7","observation_id":"27b162fe-f011-4aff-b161-fd4990b5fcfa","resolution":{"observed_at":"2026-08-14T14:16:48.101671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/isre.2.1.63","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:48.146225Z","title":"Cognitive Fit: An Empirical Study of Information Acquisition,","venue":null,"work_id":"63e33667-ff14-4846-b944-66ac09a0ddde","year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.105587Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:b02ea31cfcae9e23865a5dc5620616677ab8acc75e73ff7a77291dcbc46df2cf","observation_id":"23343b71-1be0-4bc8-96a4-8c8a4e8b124b","resolution":{"observed_at":"2026-08-14T14:16:48.153894Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:16:48.678676Z","title":"[Online]","venue":null,"work_id":"b8723ba6-6821-4ccf-8a44-c7a1853e70dc","year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.110354Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:5f22d8058f4552ed0b0a9a19447919883047976cb264cc2b1d7ce85e9c194b90","observation_id":"a1cb2503-da87-4558-b43f-3843fbc57e97","resolution":{"observed_at":"2026-08-14T14:16:48.683519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:16:48.664612Z","title":"A Procedure for Clique Detection Using the Group Matrix,","venue":null,"work_id":"35b385f4-ec89-47a4-8b42-5e0297766a48","year":null},"citing_paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:48.114805Z"},"links":{"citing_paper":"/paper/1908.03449"},"observation_digest":"sha256:5ed01c139c69131abfdfaf9007f1a06be9baf591555a3aa847d356db6e8b2812","observation_id":"1b3c0e2f-991c-4ce8-a8c1-983ef3d8c70b","resolution":{"observed_at":"2026-08-14T14:16:48.670269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03449","last_updated":"2019-08-09T13:22:47Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-16T03:36:20.918388Z","submitted_at":"2019-08-09T13:22:47Z","title":"Carl-Hauser -- Open Source Image Matching Algorithms Benchmarking Framework"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":18},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:1908.03449."}