{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GTGV5A5TUMF2HFEVXUD62ENELX","short_pith_number":"pith:GTGV5A5T","schema_version":"1.0","canonical_sha256":"34cd5e83b3a30ba39495bd07ed11a45dc854b70ce55724588d068944f69e6467","source":{"kind":"arxiv","id":"1804.00443","version":1},"attestation_state":"computed","paper":{"title":"A Note on the Hardness of the Critical Tuple Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Egor V. Kostylev","submitted_at":"2018-04-02T10:22:51Z","abstract_excerpt":"The notion of critical tuple was introduced by Miklau and Suciu (Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci., 73(3):507-534, 2007), who also claimed that the problem of checking whether a tuple is non-critical is complete for the second level of the polynomial hierarchy. Kostylev identified an error in the 12-page-long hardness proof. It turns out that the issue is rather fundamental: the proof can be adapted to show hardness of a relative variant of tuple-non-criticality, but we have neither been able to prove the original c"},"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":"1804.00443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-02T10:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"96790e09cc73aba8201e7ab579c79ab8269a7ff554f4397fdcd4d070919eb095","abstract_canon_sha256":"066b1200431e35f1b5003cc805aaaeeaf384e033e3d14514062c9130e381bab2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:37.145526Z","signature_b64":"gheZjFY4VO++Ww3SfBB+Ln5Rz6045Fa7uOgP1hxQPdlS7t5ib8BrTNkVon9PQZWf+qAqCMIXcW9nKQEPtI4lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34cd5e83b3a30ba39495bd07ed11a45dc854b70ce55724588d068944f69e6467","last_reissued_at":"2026-05-18T00:19:37.144891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:37.144891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Hardness of the Critical Tuple Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Egor V. Kostylev","submitted_at":"2018-04-02T10:22:51Z","abstract_excerpt":"The notion of critical tuple was introduced by Miklau and Suciu (Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci., 73(3):507-534, 2007), who also claimed that the problem of checking whether a tuple is non-critical is complete for the second level of the polynomial hierarchy. Kostylev identified an error in the 12-page-long hardness proof. It turns out that the issue is rather fundamental: the proof can be adapted to show hardness of a relative variant of tuple-non-criticality, but we have neither been able to prove the original c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00443","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":"1804.00443","created_at":"2026-05-18T00:19:37.144972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00443v1","created_at":"2026-05-18T00:19:37.144972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00443","created_at":"2026-05-18T00:19:37.144972+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTGV5A5TUMF2","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTGV5A5TUMF2HFEV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTGV5A5T","created_at":"2026-05-18T12:32:25.280505+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/GTGV5A5TUMF2HFEVXUD62ENELX","json":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX.json","graph_json":"https://pith.science/api/pith-number/GTGV5A5TUMF2HFEVXUD62ENELX/graph.json","events_json":"https://pith.science/api/pith-number/GTGV5A5TUMF2HFEVXUD62ENELX/events.json","paper":"https://pith.science/paper/GTGV5A5T"},"agent_actions":{"view_html":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX","download_json":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX.json","view_paper":"https://pith.science/paper/GTGV5A5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00443&json=true","fetch_graph":"https://pith.science/api/pith-number/GTGV5A5TUMF2HFEVXUD62ENELX/graph.json","fetch_events":"https://pith.science/api/pith-number/GTGV5A5TUMF2HFEVXUD62ENELX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/action/storage_attestation","attest_author":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/action/author_attestation","sign_citation":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/action/citation_signature","submit_replication":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/action/replication_record"}},"created_at":"2026-05-18T00:19:37.144972+00:00","updated_at":"2026-05-18T00:19:37.144972+00:00"}