{"as_of":"2026-08-09T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:426c8113b2ddef79c94a6211697b8b57a94666507c73d9a30bfb9b7fb075602b","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T17:17:47.372417Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-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.23632/citation-record","integrity":"/paper/2607.23632/integrity","json":"/paper/2607.23632/citation-record.json","paper":"/paper/2607.23632"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T17:17:47.266653Z","title":"Holistic data cleani ng: Putting violations into context,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.266653Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:3f66512bb06c2437e203351b028ef5b04261bd17fcf5696f9a74c0c47e96e2a3","observation_id":"6385f6ef-aaf4-4922-a522-cc0087288b0c","resolution":{"observed_at":"2026-07-30T17:17:47.266653Z","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-30T17:17:47.271010Z","title":"Abedjan, L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.271010Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:4af0957b6b1b777ae485f9900acb21497e7957f0c66531ee9294d4122f4a7953","observation_id":"894683a0-6195-4876-9681-3199aebc3be1","resolution":{"observed_at":"2026-07-30T17:17:47.271010Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.05965","snapshot_observed_at":"2026-07-30T17:17:47.274800Z","title":"Desbordante: from benchmarking suite to high-performance science-intensive data profiler,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.274800Z"},"links":{"cited_paper":"/paper/2301.05965","citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:ccf353a55d019d7052ea515d2d80fa0d744eb4970881b0e4c4d051aa1a93b934","observation_id":"af8a17d8-4d63-4e0d-a2cd-9c76dd65803a","resolution":{"observed_at":"2026-07-30T17:17:47.274800Z","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-30T17:17:47.278952Z","title":"Functional dependency discovery: an experimental evaluation of seven algorithms,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.278952Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:7ecbddd22cd574acea409151e29a96838b9866bb9d85a2f5e4f774232bb14ba0","observation_id":"cd8b1a05-a73e-4250-8956-ac5f56518060","resolution":{"observed_at":"2026-07-30T17:17:47.278952Z","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-30T17:17:47.283446Z","title":"Inclusion dependency discovery: An experimental evaluation of thirteen algorithms,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.283446Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:e167ec91a76e9a7d9bdea4207d2894c17309232fa58556ec82a8fcb7e4babbd7","observation_id":"b9532d28-90e1-48a2-9d67-25fbe3671b3f","resolution":{"observed_at":"2026-07-30T17:17:47.283446Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T17:17:47.287516Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.287516Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:f9f587bc46230fa5476a9bdc3d6250fdf06a245a85aec18f8ff911c83e923ed1","observation_id":"6670b19a-6447-4df0-bdca-671435e6dbe7","resolution":{"observed_at":"2026-07-30T17:17:47.287516Z","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-30T17:17:47.291466Z","title":"Bhunt: Automatic discovery of fuzzy alge- braic constraints in relational data,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.291466Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:d2e2f99a31c99a5841efc3ee49961bdd1d0b0ca4369e6b9e19ece6f9787a4fb9","observation_id":"074e0fdf-2ce6-48a7-901b-86a1fc97bc0b","resolution":{"observed_at":"2026-07-30T17:17:47.291466Z","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-30T17:17:47.294852Z","title":"Sherlock: A deep learning approach to semantic data type detection,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.294852Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:a48efe8148dd91f180c01980c6a1e24749fcf29daa82f1c4abdf012e606688c3","observation_id":"96b5b5ae-17ac-46fc-8aa1-9af81fd5b712","resolution":{"observed_at":"2026-07-30T17:17:47.294852Z","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-30T17:17:47.298177Z","title":"Effective and complete discovery of order dependencies vi a set-based axiomatization,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.298177Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:ed65c36eb877a803ecef5dd4ff7d83e746023da44276b3cd1dcd34978a8c655a","observation_id":"fce914ae-5461-4cd7-81ae-619d29dbfee0","resolution":{"observed_at":"2026-07-30T17:17:47.298177Z","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-30T17:17:47.301779Z","title":"Expre ssiveness and complexity of order dependencies,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.301779Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:42236caa28734ad0aad57c31226b5a0d779b2ce748fe23209cbb0670d1fc1574","observation_id":"b30a0a15-3673-4ae3-a498-d18ac212f013","resolution":{"observed_at":"2026-07-30T17:17:47.301779Z","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-30T17:17:47.305148Z","title":"Order dependency in the relati onal model,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.305148Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:8ce391848b7d40703fea1f4dd9fd02d07035e57a84536f7ab3b0e3dbadd85232","observation_id":"d74a902b-6e3e-45d4-82b0-4029394eb9bc","resolution":{"observed_at":"2026-07-30T17:17:47.305148Z","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.1007/s00778-015-0412-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient order dependency de tection,","venue":"The VLDB Journal","work_id":"3bdc74d5-3078-446b-adb4-64c46be329f3","year":2016},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.308802Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:70c4ad3f09558cf8f2c48611880e967c20c7e4af82c74c2bf7797bcaf5136ffa","observation_id":"2a1843d8-f887-40e5-a1d5-4421bfb88c33","resolution":{"observed_at":"2026-07-30T17:20:57.818685Z","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-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-30T17:17:47.312436Z","title":"Des- bordante: a framework for exploring limits of dependency di scovery algorithms,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.312436Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:9d29c06be6f618379fe2a908df3219ecc108d74371d3f2e8f221f4fdca844ce0","observation_id":"ca22e6e8-69fa-4e2c-8775-b0396d07c4c0","resolution":{"observed_at":"2026-07-30T17:17:47.312436Z","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-30T17:17:47.315970Z","title":"Fast discovery of inclusion dependencies with desbordant e,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.315970Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:29119c3ebd3d0f579ed2b7fc950a48c814f955da95ef0ca3adf47cf727c7f5d7","observation_id":"f8b59e86-2ace-44db-868b-1fea42f8c605","resolution":{"observed_at":"2026-07-30T17:17:47.315970Z","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-30T17:17:47.319391Z","title":"Fundamentals of o rder dependencies,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.319391Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:d54e990aa987a5dc8b346060e6fdd7b226c986a841308a2797dd865e99b86322","observation_id":"3d6ec739-a248-45e8-b4ef-dd80ef5e695f","resolution":{"observed_at":"2026-07-30T17:17:47.319391Z","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-30T17:17:47.326475Z","title":"An extension of the relational data model to inco rporate ordered domains,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.326475Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:6ffaf999175e05a77e9061886251207bbba81712811a5db9af0ca08b5866c83d","observation_id":"789af739-71d4-4b5c-a9aa-61dd50305e0e","resolution":{"observed_at":"2026-07-30T17:17:47.326475Z","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-30T17:17:47.334193Z","title":"Effective and complete discovery of bidirectional order d ependencies via set-based axioms,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.334193Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:2772a9c5740f4c4dbbe094a5f4ce14f8ad590ed0bb6451b813b4318e5909911f","observation_id":"706590cd-1142-411e-aaf1-44d252717614","resolution":{"observed_at":"2026-07-30T17:17:47.334193Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T17:17:47.337675Z","title":"Fast incremental disco very of pointwise order dependencies,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.337675Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:a81a2dd5a8e998b15cba36e7a78d4de3eaa535344c1048209408aad089d9030a","observation_id":"990f2e75-76d8-4ab1-a8b8-4a2c3af9d0a1","resolution":{"observed_at":"2026-07-30T17:17:47.337675Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T17:17:47.341266Z","title":"Discovering denial constraints,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.341266Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:8801710c3f13c397a915c4d88a1bb8b55530eb9179d11f2b33f023f550acda32","observation_id":"29bc09cc-1ae1-402e-a42b-eb0d7b740c67","resolution":{"observed_at":"2026-07-30T17:17:47.341266Z","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-30T17:17:47.344737Z","title":"Efficient bidirectional orde r dependency discovery,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.344737Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:f25a499e7ccf5606d1cea826d420473258637027be25887ac1a7ab7174b2be0a","observation_id":"66b34af2-0925-4021-8787-59e09aa9aef8","resolution":{"observed_at":"2026-07-30T17:17:47.344737Z","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-30T17:17:47.348236Z","title":"Distributed imple mentations of dependency discovery algorithms,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.348236Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:57fd901d7d3b672a548425a4e8868b2202e2fb97f416ad9101eef9cae460151a","observation_id":"ec0918eb-78fc-44e8-a1c2-c4e7d25c76d8","resolution":{"observed_at":"2026-07-30T17:17:47.348236Z","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-30T17:17:47.352032Z","title":"Efficient distributed di scovery of bidirectional order dependencies,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.352032Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:474c29698dc3562c0b1d40848f8cb6d7afbe8248f8a49ef1b93d145543b66cbb","observation_id":"962a7e2e-03a5-482d-a2ad-d6ad5b8209f8","resolution":{"observed_at":"2026-07-30T17:17:47.352032Z","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-30T17:17:47.355834Z","title":"Mining functional dependenc ies from data,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.355834Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:663956623328971b27c7c0a78379202ea6d258eff2126efab2ae432051a4d773","observation_id":"3343813c-1ae4-4037-8d0e-f68e9aa973a0","resolution":{"observed_at":"2026-07-30T17:17:47.355834Z","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-30T17:17:47.359191Z","title":"Fastfds: A heu ristic-driven, depth-first algorithm for mining functional dependencies f rom relation instances extended abstract,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.359191Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:dd46b8631760e7606c60c365fa3617f8eabee2277c69c4fd936c449a332f8c45","observation_id":"b28f7553-ecb5-4b68-9547-5780c686afa8","resolution":{"observed_at":"2026-07-30T17:17:47.359191Z","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-30T17:17:47.362406Z","title":"Tane: An efficient algorithm for discovering functional and approxi mate depen- dencies,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.362406Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:045cd8806614d625b544134b4510c0cbc6ad11b3dbfdf69e87e85155356d3f20","observation_id":"81f4fba9-4388-4225-bd7c-df3f1645e7c2","resolution":{"observed_at":"2026-07-30T17:17:47.362406Z","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-30T17:17:47.365591Z","title":"Discovering domain orders via order dependen- cies,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.365591Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:d04d6785b24cabf66737dfbed294d96e84824553c685df62f28d17d57b0d6c1d","observation_id":"6b93b0e7-2539-46e7-9333-6ea97656b377","resolution":{"observed_at":"2026-07-30T17:17:47.365591Z","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-30T17:17:47.369157Z","title":"Discovering order dependencies through order com- patibility,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.369157Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:b3000c28f606365fde7697ef0abe06d2e308d566361bb08b7cea70c5dfbc77ec","observation_id":"933ed3e7-3c91-48ee-a2fd-d2f0fdb76432","resolution":{"observed_at":"2026-07-30T17:17:47.369157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.02010","last_updated":"2019-05-06T13:02:54Z","snapshot_observed_at":"2026-07-06T07:50:39.195368Z","submitted_at":"2019-05-06T13:02:54Z","title":"Errata Note: Discovering Order Dependencies through Order Compatibility","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.02010","snapshot_observed_at":"2026-07-30T17:17:47.372417Z","title":"Errata note: Discovering order dependencies through order compat ibility,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.372417Z"},"links":{"cited_paper":"/paper/1905.02010","citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:d4cb78c755376f7c5efc3bfa4576cc889318a6511c2de71f0cf19eafadae4bf6","observation_id":"e7abd958-3592-4b3c-a8b6-ad15c88951b7","resolution":{"observed_at":"2026-07-30T17:17:47.372417Z","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/502","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T17:20:57.670011Z","title":"Available: https://doi.org/10.1145/502 030.502033","venue":null,"work_id":"e5742ca3-1ad2-4ba6-bac4-8df2b02bee8a","year":null},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.330525Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:c3dd794f1ccdfa2cd9f9e83383359693feec706bc9357e927ddf57b4d346a9ef","observation_id":"24f0fa48-d410-4e5c-b675-288107fa37e5","resolution":{"observed_at":"2026-07-30T17:20:57.746907Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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-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-30T17:17:47.323083Z","title":"Available: https://doi.org/10.14778/23 50229.2350241","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-07-30T17:17:47.323083Z"},"links":{"citing_paper":"/paper/2607.23632"},"observation_digest":"sha256:c80ae602a24d34fd34008dca0a784cc62075c167ba08cc9be0b4a7c77c45073b","observation_id":"ded5541f-f10f-4344-88fc-503b3fd60cc6","resolution":{"observed_at":"2026-07-30T17:17:47.323083Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23632","last_updated":"2026-07-26T12:36:31Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-08T00:41:06.486427Z","submitted_at":"2026-07-26T12:36:31Z","title":"Order in Desbordante: Techniques for Efficient Implementation of Order Dependency Discovery Algorithms"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":5,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.23632."}