{"as_of":"2026-08-05T17:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39ec96e56f6b0930c3e42f0c7ecb334d6c2e7ac0f1cb982de1e238fc7ba91652","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:23:00.406841Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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.24021/citation-record","integrity":"/paper/2607.24021/integrity","json":"/paper/2607.24021/citation-record.json","paper":"/paper/2607.24021"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:22:57.551649Z","title":"Silberschatz, H","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:57.551649Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:56b11193b7702e7321830f2bc5a04c676b61a0b4ea77b5c5fdcf1f71a9930516","observation_id":"88386ae1-8289-453e-8cae-b500a94afb16","resolution":{"observed_at":"2026-07-31T23:22:57.551649Z","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-31T23:22:57.678604Z","title":"Discovering denial c onstraints","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:57.678604Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:1416d97d911f6f81c43483616da9c106c2f16d8dc425273b707ef1a7eb2b4df9","observation_id":"d7d36049-e1a7-4a2e-8de8-50af9d92303e","resolution":{"observed_at":"2026-07-31T23:22:57.678604Z","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-31T23:22:57.900143Z","title":"Data depend encies for query optimization: a survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:57.900143Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:cfe38433962a9663b587794339ff7abce8fd529f909727e35c5e59ecca6a6b96","observation_id":"3410a0ac-5553-471c-9296-695ce8cf2174","resolution":{"observed_at":"2026-07-31T23:22:57.900143Z","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-31T23:22:58.080130Z","title":"Mind your dependencies for semantic query optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:58.080130Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:61ef960eb9f451eb1fc6f598b2c9e26da2ad5cfb3bd06e49d2ae37be1d5b45ad","observation_id":"b7d25ed6-6992-4030-aa35-442e8fbdf92c","resolution":{"observed_at":"2026-07-31T23:22:58.080130Z","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-31T23:22:58.231425Z","title":"Improving data quality: Co nsistency and accuracy","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:58.231425Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:80f66c0ab69586c07585080a15bd48b8aa15bb7f86ee486553b1b9a20d556589","observation_id":"78e8a3af-e1c4-4119-a224-e6a16775bb02","resolution":{"observed_at":"2026-07-31T23:22:58.231425Z","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-31T23:22:58.484940Z","title":"Holistic data cleani ng: Putting violations into context,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:58.484940Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:217c8020d2858c6bced02e91f5f4c57490b158f52191deae07421d2cda3c0223","observation_id":"a7b8096b-6881-4302-893a-80c99749d7ee","resolution":{"observed_at":"2026-07-31T23:22:58.484940Z","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-31T23:22:58.657459Z","title":"Data cleani ng: Overview and emerging challenges,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:58.657459Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:15c0a854a53d2f2c9b884746f90f7383b3e22a4fa24f57cd21481c846b6daa1b","observation_id":"9ce833a1-a296-4567-8c61-0beee5a8b322","resolution":{"observed_at":"2026-07-31T23:22:58.657459Z","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-31T23:22:58.881391Z","title":"Detect ing unique column combinations on dynamic data,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:58.881391Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:08d835be8f0d43447a96c44868c0874068a9be6b84b45909a160db22624cecb2","observation_id":"61549e18-4952-4c50-9054-298287ec1719","resolution":{"observed_at":"2026-07-31T23:22:58.881391Z","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-31T23:22:59.060414Z","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.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.060414Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:76f3a0e79ce98bbb3a70eeca2c96ece49e7a3a5e799db5968219ef424f3cc95c","observation_id":"5f68105c-7d6d-4b00-bd2a-50bfda6c5dcb","resolution":{"observed_at":"2026-07-31T23:22:59.060414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1208.0084","last_updated":"2012-08-01T03:51:05Z","snapshot_observed_at":"2026-07-06T02:52:56.435184Z","submitted_at":"2012-08-01T03:51:05Z","title":"Fundamentals of Order Dependencies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1208.0084","snapshot_observed_at":"2026-07-31T23:22:59.089793Z","title":"Fundamentals of o rder dependen- cies,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.089793Z"},"links":{"cited_paper":"/paper/1208.0084","citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:967d540507566642f8c6d9d3308cd1b74ea357a98673dd38d209a59df6fc95f9","observation_id":"181b5e66-9c60-434e-b9e1-232d3fab0db8","resolution":{"observed_at":"2026-07-31T23:22:59.089793Z","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-31T23:22:59.137318Z","title":"Abedjan, L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.137318Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:baf181effd6ed68fb8dd27bfdfb1c9d46b1b4b4011497451ac8701e7e9a17c1a","observation_id":"e93733f5-c71c-4984-a3a6-943b2201441b","resolution":{"observed_at":"2026-07-31T23:22:59.137318Z","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-31T23:22:59.187137Z","title":"Discovering denial c onstraints based on deep reinforcement learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.187137Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:04c6a03899d912d57e57d56b12f489e02e4baa6ca734c4e4883fc0029de8bfb3","observation_id":"6f10e556-418f-4613-81c4-af23ae4867c4","resolution":{"observed_at":"2026-07-31T23:22:59.187137Z","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-31T23:22:59.267493Z","title":"Efficient denial c onstraint discovery with hydra","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.267493Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:9ee9462a62a2575665690b53fba56f765474248442c739d2549128d90d0d0e85","observation_id":"93fcb653-decf-4815-b485-bb592b7fad0d","resolution":{"observed_at":"2026-07-31T23:22:59.267493Z","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-31T23:22:59.324688Z","title":"Discovery o f approximate (and exact) denial constraints,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.324688Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:b2c8e43a6e5ad0f5f1854c34c82c02367321c4409fc77d0e7b18724a57a0b1dd","observation_id":"81434eaf-0dec-481b-b1e6-f6417da54231","resolution":{"observed_at":"2026-07-31T23:22:59.324688Z","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-31T23:22:59.387002Z","title":"An overview of electro nic commerce (e-commerce),","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.387002Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:2c6c0995c1a74c4f5bbebfbc7273c13d6f897102274a439f77a60c86b8bb6458","observation_id":"4036df15-7b96-4ba3-8be4-db420a7fe304","resolution":{"observed_at":"2026-07-31T23:22:59.387002Z","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-31T23:22:59.438158Z","title":"Fault detection in transmission lines: a deni al constraint approach,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.438158Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:a656662372ca2e356d1a5e1ddbc9aab2b5562a6c5e6246b5f145fbc0a978b1ec","observation_id":"c87f47e7-8b36-4a69-a417-98e7ad713c01","resolution":{"observed_at":"2026-07-31T23:22:59.438158Z","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-31T23:22:59.497377Z","title":"Fast incremental disco very of pointwise order dependencies,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.497377Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:410339eb8806f5ec6515af32719bfb31690153709f9ddf858282652b911d0243","observation_id":"a286ef65-d2d1-4a40-9d9a-89b5b4ebd067","resolution":{"observed_at":"2026-07-31T23:22:59.497377Z","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-31T23:22:59.554721Z","title":"Incremental dis covery of denial constraints,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.554721Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:0acb6ba74b718aeef5ecc62347a734433533306745f8ab8d1baae4912f71de5e","observation_id":"9d80ceed-67e3-4152-ba55-efc9759b0acb","resolution":{"observed_at":"2026-07-31T23:22:59.554721Z","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-31T23:22:59.616683Z","title":"Discovering denia l constraints in dynamic datasets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.616683Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:c5b1595f7106ee114cb93e8e927ce255aa735cb1a5820ae06374c4af1d79a4bb","observation_id":"b972fda7-8887-4f07-a4f0-d2132518bd1c","resolution":{"observed_at":"2026-07-31T23:22:59.616683Z","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-31T23:22:59.674737Z","title":"Bfastdc: A bitwise algor ithm for mining denial constraints,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.674737Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:27b4ca17bd1554aac60ce2dfc911afddd7531d43443535f0ace2c9558c279558","observation_id":"049f4584-128f-49a1-8a7e-47af1fbd32ee","resolution":{"observed_at":"2026-07-31T23:22:59.674737Z","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-31T23:22:59.746977Z","title":"Fast algorithms fo r denial constraint discovery,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.746977Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:ccd20f2ba2568e4459a665efdd366d4f9e1f3677734d311b5b3b8eb9605917d3","observation_id":"9abd5187-153a-454c-baae-6694dee82709","resolution":{"observed_at":"2026-07-31T23:22:59.746977Z","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-31T23:22:59.824981Z","title":"Fast approximate den ial constraint discovery,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.824981Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:7cf18e57b40ee72a3b1fcf45922f2adad9aa19b8c9dbade62c207359bcad9fa1","observation_id":"89784e23-ba95-4ba7-b231-75bc74410e8f","resolution":{"observed_at":"2026-07-31T23:22:59.824981Z","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-31T23:22:59.884268Z","title":"Discovering denial constraints u sing boolean patterns,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.884268Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:564c9034db29fad76139a2d4c7a51cf0135d68f9626776a748cc925ee64f86ce","observation_id":"d15d00bb-0e22-4e67-b031-cbf26451c000","resolution":{"observed_at":"2026-07-31T23:22:59.884268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08540","last_updated":"2020-05-18T09:06:29Z","snapshot_observed_at":"2026-07-06T09:21:10.633484Z","submitted_at":"2020-05-18T09:06:29Z","title":"Approximate Denial Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08540","snapshot_observed_at":"2026-07-31T23:22:59.929958Z","title":"Approximate denial constraints,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.929958Z"},"links":{"cited_paper":"/paper/2005.08540","citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:52e6bba904281d0883464ebe54a7e593eb718c3582762aacf1216f54e6a26563","observation_id":"fe63877e-97ef-44ec-aa7d-a347f99b8c09","resolution":{"observed_at":"2026-07-31T23:22:59.929958Z","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-31T23:22:59.987889Z","title":"Efficient algorithms for dualiz ing large- scale hypergraphs,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.987889Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:ca002eb9e54365fe43a8c4a231a904c3bb4e072c40353d180b586985ca3064f9","observation_id":"f57e74ef-5b35-430b-ae19-2d537e24448f","resolution":{"observed_at":"2026-07-31T23:22:59.987889Z","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-31T23:23:00.062329Z","title":"A deep reinforcement l earning framework for denial constraint discovery,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T23:23:00.062329Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:3bf0233b70431e57337b274161411843f564553be61ebbe4652806cd51d453de","observation_id":"72957fb8-f154-4876-a736-d2c8d53580ba","resolution":{"observed_at":"2026-07-31T23:23:00.062329Z","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-31T23:23:00.118959Z","title":"Discovery of denial constraints with hardware accelerati on,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T23:23:00.118959Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:8ad0054d5b12b37d07b0fe06ef80ebd439cd84e65ba90f81e8ff2a6d5b641c04","observation_id":"75f3308d-ddcf-469b-b7e6-8583632ecce1","resolution":{"observed_at":"2026-07-31T23:23:00.118959Z","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-31T23:23:00.195327Z","title":"Dynfd: Functional depe ndency discovery in dynamic datasets","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T23:23:00.195327Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:31128345fea3594fd7c09825863147f12dd6131ca1d9a2e155bd5b7b82d0a7b3","observation_id":"8355b330-120a-463e-b52e-737ccfb3e942","resolution":{"observed_at":"2026-07-31T23:23:00.195327Z","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-31T23:23:00.275914Z","title":"Dynamic func tional dependency discovery with dynamic hitting set enumeration ,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T23:23:00.275914Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:9bf0390ddf8f59eb261d3f76978d0c0dea25da37d947d7218288197a0962c07d","observation_id":"5cb10500-0f9b-4aad-ac1a-92f1646cd5d1","resolution":{"observed_at":"2026-07-31T23:23:00.275914Z","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-31T23:23:00.333141Z","title":"Incremental discovery of functional dependencies with a bit-vector alg orithm","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T23:23:00.333141Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:d557e1995e0fe8e5b8a7d2a5ea92b1fc3f0ec5cd39330a32d165db01884ba11a","observation_id":"ad996541-2055-4dcc-bbfc-1c66b6b299bd","resolution":{"observed_at":"2026-07-31T23:23:00.333141Z","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-31T23:23:00.406841Z","title":"Conditional functional dependencies for data cleaning,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T23:23:00.406841Z"},"links":{"citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:1769affa29c8b6c65089541988ba365b790c73dbacfc1d20754296da0bc25424","observation_id":"8c53c794-2f4e-4cc2-bcfa-d520900932d3","resolution":{"observed_at":"2026-07-31T23:23:00.406841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2607.24021."}