{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TPY72Y54GRBUYHYK2FPW5JSGEP","short_pith_number":"pith:TPY72Y54","schema_version":"1.0","canonical_sha256":"9bf1fd63bc34434c1f0ad15f6ea64623dbc2377841bd031d6dca0b15918a23ea","source":{"kind":"arxiv","id":"1712.07705","version":1},"attestation_state":"computed","paper":{"title":"Computing Optimal Repairs for Functional Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Ester Livshits, Sudeepa Roy","submitted_at":"2017-12-20T20:56:52Z","abstract_excerpt":"We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two types of repairs: an optimal subset repair (optimal S-repair) that is obtained by a minimum number of tuple deletions, and an optimal update repair (optimal U-repair) that is obtained by a minimum number of value (cell) updates. For computing an optimal S-repair, we present a polynomial-time algorithm that succeeds on certain sets of FDs and fails on others. We prove the following about the algorithm. When it succee"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.07705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-20T20:56:52Z","cross_cats_sorted":[],"title_canon_sha256":"0c648df6c81cbedd55d5d86b7fe1ce202ec86f3865ad1a5566528c3b3fea8e2a","abstract_canon_sha256":"ea4634fe6fb9095b5a94decacf790259e3fe668b985f9e1d0e8de19b6f9dc89f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:31.155909Z","signature_b64":"QwsE/SEHMeycMBMvHX3KkNP0/op//z04N9r7NVZUKROWILNMRoVnshldVRK2LAOQMaHC5By/mr3dWi7Iz267Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bf1fd63bc34434c1f0ad15f6ea64623dbc2377841bd031d6dca0b15918a23ea","last_reissued_at":"2026-05-18T00:27:31.155204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:31.155204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Optimal Repairs for Functional Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Ester Livshits, Sudeepa Roy","submitted_at":"2017-12-20T20:56:52Z","abstract_excerpt":"We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two types of repairs: an optimal subset repair (optimal S-repair) that is obtained by a minimum number of tuple deletions, and an optimal update repair (optimal U-repair) that is obtained by a minimum number of value (cell) updates. For computing an optimal S-repair, we present a polynomial-time algorithm that succeeds on certain sets of FDs and fails on others. We prove the following about the algorithm. When it succee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07705","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.07705","created_at":"2026-05-18T00:27:31.155279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07705v1","created_at":"2026-05-18T00:27:31.155279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07705","created_at":"2026-05-18T00:27:31.155279+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPY72Y54GRBU","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPY72Y54GRBUYHYK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPY72Y54","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP","json":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP.json","graph_json":"https://pith.science/api/pith-number/TPY72Y54GRBUYHYK2FPW5JSGEP/graph.json","events_json":"https://pith.science/api/pith-number/TPY72Y54GRBUYHYK2FPW5JSGEP/events.json","paper":"https://pith.science/paper/TPY72Y54"},"agent_actions":{"view_html":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP","download_json":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP.json","view_paper":"https://pith.science/paper/TPY72Y54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07705&json=true","fetch_graph":"https://pith.science/api/pith-number/TPY72Y54GRBUYHYK2FPW5JSGEP/graph.json","fetch_events":"https://pith.science/api/pith-number/TPY72Y54GRBUYHYK2FPW5JSGEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP/action/storage_attestation","attest_author":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP/action/author_attestation","sign_citation":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP/action/citation_signature","submit_replication":"https://pith.science/pith/TPY72Y54GRBUYHYK2FPW5JSGEP/action/replication_record"}},"created_at":"2026-05-18T00:27:31.155279+00:00","updated_at":"2026-05-18T00:27:31.155279+00:00"}