{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:THMDQQKGCA5QJHYCUBP22IMYIZ","short_pith_number":"pith:THMDQQKG","schema_version":"1.0","canonical_sha256":"99d8384146103b049f02a05fad21984644a8403c98f6410cf58553b6f85bc96a","source":{"kind":"arxiv","id":"1507.06103","version":1},"attestation_state":"computed","paper":{"title":"Taming Primary Key Violations to Query Large Inconsistent Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Francesco Ricca, Giorgio Terracina, Marco Manna","submitted_at":"2015-07-22T08:56:03Z","abstract_excerpt":"Consistent query answering over a database that violates primary key constraints is a classical hard problem in database research that has been traditionally dealt with logic programming. However, the applicability of existing logic-based solutions is restricted to data sets of moderate size. This paper presents a novel decomposition and pruning strategy that reduces, in polynomial time, the problem of computing the consistent answer to a conjunctive query over a database subject to primary key constraints to a collection of smaller problems of the same sort that can be solved independently. 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":"1507.06103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-22T08:56:03Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"825ecdba7edae3824c1adc30c8d2b8392d945d6714f04995cf1836c97170c2f0","abstract_canon_sha256":"a1d23a64d36a8fa2f31a47c91ee899cb41cec5891a27017d4773033472998156"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:26.685771Z","signature_b64":"Sq8icLsNabu+34cnBApWQqeqPIeql+H0L3SgVHkbxOPJBRZOJYLJUCHIzZ05WjfoQDOI8hWmINBR3YZI/ivXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d8384146103b049f02a05fad21984644a8403c98f6410cf58553b6f85bc96a","last_reissued_at":"2026-05-18T01:36:26.685049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:26.685049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Taming Primary Key Violations to Query Large Inconsistent Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Francesco Ricca, Giorgio Terracina, Marco Manna","submitted_at":"2015-07-22T08:56:03Z","abstract_excerpt":"Consistent query answering over a database that violates primary key constraints is a classical hard problem in database research that has been traditionally dealt with logic programming. However, the applicability of existing logic-based solutions is restricted to data sets of moderate size. This paper presents a novel decomposition and pruning strategy that reduces, in polynomial time, the problem of computing the consistent answer to a conjunctive query over a database subject to primary key constraints to a collection of smaller problems of the same sort that can be solved independently. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06103","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":"1507.06103","created_at":"2026-05-18T01:36:26.685168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06103v1","created_at":"2026-05-18T01:36:26.685168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06103","created_at":"2026-05-18T01:36:26.685168+00:00"},{"alias_kind":"pith_short_12","alias_value":"THMDQQKGCA5Q","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"THMDQQKGCA5QJHYC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"THMDQQKG","created_at":"2026-05-18T12:29:42.218222+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/THMDQQKGCA5QJHYCUBP22IMYIZ","json":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ.json","graph_json":"https://pith.science/api/pith-number/THMDQQKGCA5QJHYCUBP22IMYIZ/graph.json","events_json":"https://pith.science/api/pith-number/THMDQQKGCA5QJHYCUBP22IMYIZ/events.json","paper":"https://pith.science/paper/THMDQQKG"},"agent_actions":{"view_html":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ","download_json":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ.json","view_paper":"https://pith.science/paper/THMDQQKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06103&json=true","fetch_graph":"https://pith.science/api/pith-number/THMDQQKGCA5QJHYCUBP22IMYIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/THMDQQKGCA5QJHYCUBP22IMYIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ/action/storage_attestation","attest_author":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ/action/author_attestation","sign_citation":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ/action/citation_signature","submit_replication":"https://pith.science/pith/THMDQQKGCA5QJHYCUBP22IMYIZ/action/replication_record"}},"created_at":"2026-05-18T01:36:26.685168+00:00","updated_at":"2026-05-18T01:36:26.685168+00:00"}