{"as_of":"2026-08-09T20:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e4ca5daf6fb0dacf1c61389f072d9c62a94a1f2c0da617f8f1c26dd4d4458f1","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T09:23:22.580600Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.10771/citation-record","integrity":"/paper/2607.10771/integrity","json":"/paper/2607.10771/citation-record.json","paper":"/paper/2607.10771"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:23:22.580600Z","title":"Abedjan, L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:2121640e6f28366759568dd83ee84adae2982a1694032daa9c5c9d4130f771f9","observation_id":"a395e147-478a-49cd-a43c-baf04fa0e974","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.05965","last_updated":"2023-01-14T19:14:51Z","snapshot_observed_at":"2026-08-09T09:49:04.151689Z","submitted_at":"2023-01-14T19:14:51Z","title":"Desbordante: from benchmarking suite to high-performance science-intensive data profiler (preprint)","version":1},"cited_work":{"arxiv_id":"2301.05965","doi":"10.48550/arxiv.2301.05965","metadata_source":"pith","pith_arxiv_id":"2301.05965","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Desbordante: from benchmarking suite to high-performance science-intensive data profiler (preprint)","venue":"cs.DB","work_id":"ef616aa2-213b-4a38-8624-ecbb9eb7ed2d","year":2023},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"cited_paper":"/paper/2301.05965","citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:c786fc90e54efb55e9db024efa4ca47bd50bc9bbf3a83b6b4e977f07d7aca4f6","observation_id":"a38a4218-f71c-4e24-b403-ae94d23cc13c","resolution":{"observed_at":"2026-07-14T09:30:22.703730Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-14T19:50:06.354942+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T19:50:06.354942+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-14T09:23:22.580600Z","title":"Functional dependency discovery: an experimental evaluation of seven algorithms,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:dd283583195eea4f6846989d088a577a66bf0bc7c566d8287fe45f30e97266af","observation_id":"de7cb252-2ee8-418c-8d0d-313fe4644a3c","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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":"7384.335791","doi":"10.1145/3357384.3357916","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Inclusion dependency discovery: An experimental evaluation of thirteen algorithms,","venue":null,"work_id":"4274763d-16dd-42e1-9c2e-17dd9d84ccc2","year":2019},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:e8e2624165c8c5b6d4c58cea7dda78dcb6948726cfb5af238660a58786dfceef","observation_id":"056c48f2-d825-4931-8f77-18522397a52a","resolution":{"observed_at":"2026-07-14T09:30:22.720791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-14T19:50:06.592549+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T19:50:06.592549+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-14T09:23:22.580600Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:12ec3d9c2ccd4ac2588c20bfe837449f5f9d84eded3095d2ca8aa6ce91cf5672","observation_id":"bf999a9e-fc7c-46f4-9bf5-c80564600a86","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Bhunt: Automatic discovery of fuzzy algebraic constraints in relational data,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:e7df806b5f6d29c7938ca2c9648b5dc5134c982dbc1ebd2205fa94d82b48b6fb","observation_id":"6a8d013b-aebd-40fb-9ce5-4ca06ca4f18a","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Sherlock: A deep learning approach to semantic data type detection,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:64477ae0611aa2d921d0c81ae4ad4b82b00d10d9042cf25db0a611154f96e2e5","observation_id":"50faa165-34ef-4fc6-bbbc-10f28e7e3cff","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Differential dependencies: Reasoning and discov- ery,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:e3029ce2f5e6e82487bbf6aec29257177e67927c1ebf8252c4fa60114c611ea0","observation_id":"184e117f-d9d3-46c9-9f2a-069e8345a807","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Reasoning about record matching rules,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:11255e6e4bdba6a02b9cfed40a6700f7cbb35e3e292c8c00f40b6f063d0b6018","observation_id":"acfb09ce-a19c-4aa9-9721-063798c1be65","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Data cleaning and query answering with matching dependencies and matching functions,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:c47ddbc09d81ed4de7a47add54cab51714953cd9fc11d135fefce1a595409eef","observation_id":"909cd1f8-d151-4f08-bacd-4d382631a9dd","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Mdedup: Duplicate detection with matching dependencies,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:d337b262dad474aa7b4bc6480c6c67c43573f8c93ec5c898d06c7b54d490db7a","observation_id":"58b286bd-2360-4cf4-9f9e-86d049e4ea19","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.14935","last_updated":"2023-07-28T11:02:25Z","snapshot_observed_at":"2026-08-03T18:04:50.342014Z","submitted_at":"2023-07-27T15:26:26Z","title":"Solving Data Quality Problems with Desbordante: a Demo","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.14935","snapshot_observed_at":"2026-07-14T09:23:22.580600Z","title":"Solving data quality problems with desbordante: a demo,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"cited_paper":"/paper/2307.14935","citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:1ab4697e2c2e5df498389d99906ca3ee10240f7e05ac685a7f24cedc406a8c8b","observation_id":"c5a35239-e696-4d70-bdfc-1064a0ed1f83","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8615.2023","doi":"10.23919/fruct58615.2023.10143047","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast discovery of inclusion dependencies with desbordante,","venue":null,"work_id":"b47d9a78-85d1-4441-b579-5a20a8a5dc63","year":2023},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:53e0382aa1a9a3bb6e1cff3e8b4fe2666fa81f1222bfbaade076689fcaceec5d","observation_id":"3c8e7aa2-5137-4eb1-a7a1-fbdc6a1e00c2","resolution":{"observed_at":"2026-07-14T09:30:22.714202Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-14T19:50:07.150425+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T19:50:07.150425+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-14T09:23:22.580600Z","title":"Order in desbordante: Techniques for efficient implementation of order dependency discovery algorithms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:2ab60d10006dc1fc7326506aeec9ffe94306e8dc993bd2874fa53d2f36377fba","observation_id":"a4a1fd99-3b7e-45e4-a6ff-86c3bda9f392","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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.1145/3392778","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient discovery of matching dependencies,","venue":"ACM Transactions on Database Systems","work_id":"07b4aae7-5adf-4922-a42d-20922a3cdfb3","year":2020},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:5b9a542fde20f6e9e7b4fd003bcf220ba597f601b3330f4c76420c022c079eb9","observation_id":"dd7227a4-9b6d-467c-921f-43310ee72556","resolution":{"observed_at":"2026-07-14T09:30:22.733718Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-14T19:50:07.412053+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T19:50:07.412053+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-14T09:23:22.580600Z","title":"Dependencies revisited for improving data quality,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:9deeecb1cdda3b14a910dc7172f871ca87105a7a888c102c3c3dc7c1ad57db38","observation_id":"8cef41ea-5480-43f2-b7fb-4a474047dadf","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Discovering matching dependencies,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:e61938d2adfbbeeea7fddcd7df5778eb332f193883a4f3adc21c5a840f7aa224","observation_id":"ed20d2f8-d3cc-4a5e-8d04-be7f328cb80f","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Efficient discovery of similarity constraints for matching depen- dencies,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:743a29cfc9b921b80e87b8eec2783b5b22fe2a04f432aaa2686d033acc9dd272","observation_id":"f668de2f-2184-4a43-b6c5-507943526cc9","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"A hybrid approach to functional dependency discovery,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:6fdb2d200820ea316306c0fb7dacb8cb170510c036852a4b41124bacef25aadf","observation_id":"a77d2c87-491f-4a4c-808d-67ae1ee7cbfa","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Efficient differential dependency discovery,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:ea6f88b0064d330f9eb9bc3bc47e29307dfe323b18e63e5b2fc1325f65fab1a0","observation_id":"6ca55a4e-d584-4254-9a28-9fc735f0776e","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Data dependencies extended for variety and veracity: A family tree,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:d198f94fb480f24bc0df10bbe1f5658d7b72b23809bffa73f529808b633eea54","observation_id":"ebf040ca-15fa-4984-aa67-de2a51313c0d","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Tane: An efficient algorithm for discovering functional and approximate depen- dencies,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:e7ac993a3524d3180770803980822f6db916e64e633de3b7cfd08c96ee2f5392","observation_id":"5799e1b6-cebc-4e68-ae04-4818d92a008c","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Des- bordante: a framework for exploring limits of dependency discovery algorithms,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:35ef6b82d4fe14d3154df05f4c8c07db7100796f81020205613524b12976b7d5","observation_id":"463276bd-8549-4e7f-92cd-b422fe241183","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Allen and D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:f3179dfa4ecc6311ec4c1c69bec23c1b9ae3462b7f4890295e4ca7604f90f086","observation_id":"5ab6e6f6-c80f-4c9f-a09f-9b701d761ca3","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","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-07-14T09:23:22.580600Z","title":"Loshin,Master Data Management","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T09:23:22.580600Z"},"links":{"citing_paper":"/paper/2607.10771"},"observation_digest":"sha256:eb3751491b1e5a35bff043d66c839431bcbe209eeb596070e101d1baff108e25","observation_id":"3f91ec65-20e0-414a-9560-1f4c8fbf2ee1","resolution":{"observed_at":"2026-07-14T09:23:22.580600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10771","last_updated":"2026-07-12T13:59:54Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T13:29:06.429964Z","submitted_at":"2026-07-12T13:59:54Z","title":"Lightning Fast Matching Dependency Discovery with Desbordante"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":25},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.10771."}