{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K2G7NZNYQNB6KID4A65O7G22U6","short_pith_number":"pith:K2G7NZNY","schema_version":"1.0","canonical_sha256":"568df6e5b88343e5207c07baef9b5aa789d8d50301ab35435cc478e635657f6e","source":{"kind":"arxiv","id":"1708.09140","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Computing a Cardinality Repair 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","submitted_at":"2017-08-30T07:03:58Z","abstract_excerpt":"For a relation that violates a set of functional dependencies, we consider the task of finding a maximum number of pairwise-consistent tuples, or what is known as a \"cardinality repair.\" We present a polynomial-time algorithm that, for certain fixed relation schemas (with functional dependencies), computes a cardinality repair. Moreover, we prove that on any of the schemas not covered by the algorithm, finding a cardinality repair is, in fact, an NP-hard problem. In particular, we establish a dichotomy in the complexity of computing a cardinality repair, and we present an efficient algorithm t"},"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":"1708.09140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-08-30T07:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"078091751bca8b90ca17202d5fe39707d12f099b3ac46a9765c5c96e715ef6aa","abstract_canon_sha256":"48c837df20291d0279da8884ca790e4d6696290ca332e7670cdaf193d39ac464"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:20.831953Z","signature_b64":"ACqcwoxQ2EtGX0Gul6JUbt4/nXrIOjl4nOrQ2aNrvYe+A37UHHVRxywEhGbgSbrcjzuxIVz6g8tqXj/txI6LCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"568df6e5b88343e5207c07baef9b5aa789d8d50301ab35435cc478e635657f6e","last_reissued_at":"2026-05-18T00:36:20.831333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:20.831333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Computing a Cardinality Repair 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","submitted_at":"2017-08-30T07:03:58Z","abstract_excerpt":"For a relation that violates a set of functional dependencies, we consider the task of finding a maximum number of pairwise-consistent tuples, or what is known as a \"cardinality repair.\" We present a polynomial-time algorithm that, for certain fixed relation schemas (with functional dependencies), computes a cardinality repair. Moreover, we prove that on any of the schemas not covered by the algorithm, finding a cardinality repair is, in fact, an NP-hard problem. In particular, we establish a dichotomy in the complexity of computing a cardinality repair, and we present an efficient algorithm t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09140","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":"1708.09140","created_at":"2026-05-18T00:36:20.831407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09140v1","created_at":"2026-05-18T00:36:20.831407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09140","created_at":"2026-05-18T00:36:20.831407+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2G7NZNYQNB6","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2G7NZNYQNB6KID4","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2G7NZNY","created_at":"2026-05-18T12:31:24.725408+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/K2G7NZNYQNB6KID4A65O7G22U6","json":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6.json","graph_json":"https://pith.science/api/pith-number/K2G7NZNYQNB6KID4A65O7G22U6/graph.json","events_json":"https://pith.science/api/pith-number/K2G7NZNYQNB6KID4A65O7G22U6/events.json","paper":"https://pith.science/paper/K2G7NZNY"},"agent_actions":{"view_html":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6","download_json":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6.json","view_paper":"https://pith.science/paper/K2G7NZNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09140&json=true","fetch_graph":"https://pith.science/api/pith-number/K2G7NZNYQNB6KID4A65O7G22U6/graph.json","fetch_events":"https://pith.science/api/pith-number/K2G7NZNYQNB6KID4A65O7G22U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6/action/storage_attestation","attest_author":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6/action/author_attestation","sign_citation":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6/action/citation_signature","submit_replication":"https://pith.science/pith/K2G7NZNYQNB6KID4A65O7G22U6/action/replication_record"}},"created_at":"2026-05-18T00:36:20.831407+00:00","updated_at":"2026-05-18T00:36:20.831407+00:00"}