{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GTGV5A5TUMF2HFEVXUD62ENELX","short_pith_number":"pith:GTGV5A5T","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"},"canonical_sha256":"34cd5e83b3a30ba39495bd07ed11a45dc854b70ce55724588d068944f69e6467","source":{"kind":"arxiv","id":"1804.00443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00443","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00443v1","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00443","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"GTGV5A5TUMF2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GTGV5A5TUMF2HFEV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GTGV5A5T","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GTGV5A5TUMF2HFEVXUD62ENELX","target":"record","payload":{"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"},"canonical_sha256":"34cd5e83b3a30ba39495bd07ed11a45dc854b70ce55724588d068944f69e6467","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"},"source_kind":"arxiv","source_id":"1804.00443","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEIIAfzqrAdReN8TuZoUroku5cY6H+zHAG06XduWgGqCFsCkJgbrmjMrETVtuxJrV2BNUAwfY40mPx0LTXuzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:22:30.696035Z"},"content_sha256":"b11f02222abd6854e74811a64bea90ad71689d857665b0f1030f93258b482fde","schema_version":"1.0","event_id":"sha256:b11f02222abd6854e74811a64bea90ad71689d857665b0f1030f93258b482fde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GTGV5A5TUMF2HFEVXUD62ENELX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvVS1jcBJCo5jG0AL3W3FgbD4t8mbHXchKM9mSkDM7qU/oaxLp7clAli/NpJXoMj4h69dHhTYy2oDXolnhuYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:22:30.696700Z"},"content_sha256":"c05e5c35b9e40a063b710bfdbfc399db52f290636ce40e09155446af7e179323","schema_version":"1.0","event_id":"sha256:c05e5c35b9e40a063b710bfdbfc399db52f290636ce40e09155446af7e179323"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/bundle.json","state_url":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTGV5A5TUMF2HFEVXUD62ENELX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T06:22:30Z","links":{"resolver":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX","bundle":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/bundle.json","state":"https://pith.science/pith/GTGV5A5TUMF2HFEVXUD62ENELX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTGV5A5TUMF2HFEVXUD62ENELX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GTGV5A5TUMF2HFEVXUD62ENELX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"066b1200431e35f1b5003cc805aaaeeaf384e033e3d14514062c9130e381bab2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-02T10:22:51Z","title_canon_sha256":"96790e09cc73aba8201e7ab579c79ab8269a7ff554f4397fdcd4d070919eb095"},"schema_version":"1.0","source":{"id":"1804.00443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00443","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00443v1","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00443","created_at":"2026-05-18T00:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"GTGV5A5TUMF2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GTGV5A5TUMF2HFEV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GTGV5A5T","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:c05e5c35b9e40a063b710bfdbfc399db52f290636ce40e09155446af7e179323","target":"graph","created_at":"2026-05-18T00:19:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dan Suciu, Egor V. Kostylev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-02T10:22:51Z","title":"A Note on the Hardness of the Critical Tuple Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00443","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b11f02222abd6854e74811a64bea90ad71689d857665b0f1030f93258b482fde","target":"record","created_at":"2026-05-18T00:19:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"066b1200431e35f1b5003cc805aaaeeaf384e033e3d14514062c9130e381bab2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-02T10:22:51Z","title_canon_sha256":"96790e09cc73aba8201e7ab579c79ab8269a7ff554f4397fdcd4d070919eb095"},"schema_version":"1.0","source":{"id":"1804.00443","kind":"arxiv","version":1}},"canonical_sha256":"34cd5e83b3a30ba39495bd07ed11a45dc854b70ce55724588d068944f69e6467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34cd5e83b3a30ba39495bd07ed11a45dc854b70ce55724588d068944f69e6467","first_computed_at":"2026-05-18T00:19:37.144891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:37.144891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gheZjFY4VO++Ww3SfBB+Ln5Rz6045Fa7uOgP1hxQPdlS7t5ib8BrTNkVon9PQZWf+qAqCMIXcW9nKQEPtI4lBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:37.145526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11f02222abd6854e74811a64bea90ad71689d857665b0f1030f93258b482fde","sha256:c05e5c35b9e40a063b710bfdbfc399db52f290636ce40e09155446af7e179323"],"state_sha256":"b34a7612a34ea89ab5d92f984c960cb6c4d3412379d41386be29a63061c1f358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlDhUjW+5nPEXGrhOJLnlMMHjMdXbHjeuVOrwFDBpSJwuGX3RuXPF8dx9Pc1cIsiRHmIpmDF+UHCYt+MHNsNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:22:30.700162Z","bundle_sha256":"a452c24ed0f6af96e2d5d2208d5549d1c880b5e8a3676df466f47cf09eac2558"}}