{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CA6QVVAHF3PA2CUY45HV5EMVAP","short_pith_number":"pith:CA6QVVAH","schema_version":"1.0","canonical_sha256":"103d0ad4072ede0d0a98e74f5e919503dadc8f955d74e565668c849d52a74d6e","source":{"kind":"arxiv","id":"1907.01129","version":2},"attestation_state":"computed","paper":{"title":"New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DB","authors_text":"Alexandra Meliou, Cibele Freire, Neil Immerman, Wolfgang Gatterbauer","submitted_at":"2019-07-02T02:34:59Z","abstract_excerpt":"The resilience of a Boolean query is the minimum number of tuples that need to be deleted from the input tables in order to make the query false. A solution to this problem immediately translates into a solution for the more widely known problem of deletion propagation with source-side effects. In this paper, we give several novel results on the hardness of the resilience problem for $\\textit{binary conjunctive queries with self-joins}$ (i.e. conjunctive queries with relations of maximal arity 2) with one repeated relation. Unlike in the self-join free case, the concept of triad is not enough "},"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":"1907.01129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-07-02T02:34:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6b4eab3d7fe6403c87bb4e2e5c5ccdd4495800d741a62ff43c465d66c75b9e1b","abstract_canon_sha256":"7a0d9c9bda5c9ca12233eaccf0ec8e8cec12c543f4575839ff7f71c82a5bc1e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:26.397195Z","signature_b64":"ZlW2IQgyozvJkkHt6inc6zsw3zbTBfGksWI2o+MIl23F2VLNRrlG4lKKvGKFNFYA1OW9E2iMgE0i4wgcI+qpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103d0ad4072ede0d0a98e74f5e919503dadc8f955d74e565668c849d52a74d6e","last_reissued_at":"2026-07-05T01:10:26.396660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:26.396660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DB","authors_text":"Alexandra Meliou, Cibele Freire, Neil Immerman, Wolfgang Gatterbauer","submitted_at":"2019-07-02T02:34:59Z","abstract_excerpt":"The resilience of a Boolean query is the minimum number of tuples that need to be deleted from the input tables in order to make the query false. A solution to this problem immediately translates into a solution for the more widely known problem of deletion propagation with source-side effects. In this paper, we give several novel results on the hardness of the resilience problem for $\\textit{binary conjunctive queries with self-joins}$ (i.e. conjunctive queries with relations of maximal arity 2) with one repeated relation. Unlike in the self-join free case, the concept of triad is not enough "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01129","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.01129/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.01129","created_at":"2026-07-05T01:10:26.396721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01129v2","created_at":"2026-07-05T01:10:26.396721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01129","created_at":"2026-07-05T01:10:26.396721+00:00"},{"alias_kind":"pith_short_12","alias_value":"CA6QVVAHF3PA","created_at":"2026-07-05T01:10:26.396721+00:00"},{"alias_kind":"pith_short_16","alias_value":"CA6QVVAHF3PA2CUY","created_at":"2026-07-05T01:10:26.396721+00:00"},{"alias_kind":"pith_short_8","alias_value":"CA6QVVAH","created_at":"2026-07-05T01:10:26.396721+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/CA6QVVAHF3PA2CUY45HV5EMVAP","json":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP.json","graph_json":"https://pith.science/api/pith-number/CA6QVVAHF3PA2CUY45HV5EMVAP/graph.json","events_json":"https://pith.science/api/pith-number/CA6QVVAHF3PA2CUY45HV5EMVAP/events.json","paper":"https://pith.science/paper/CA6QVVAH"},"agent_actions":{"view_html":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP","download_json":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP.json","view_paper":"https://pith.science/paper/CA6QVVAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01129&json=true","fetch_graph":"https://pith.science/api/pith-number/CA6QVVAHF3PA2CUY45HV5EMVAP/graph.json","fetch_events":"https://pith.science/api/pith-number/CA6QVVAHF3PA2CUY45HV5EMVAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP/action/storage_attestation","attest_author":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP/action/author_attestation","sign_citation":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP/action/citation_signature","submit_replication":"https://pith.science/pith/CA6QVVAHF3PA2CUY45HV5EMVAP/action/replication_record"}},"created_at":"2026-07-05T01:10:26.396721+00:00","updated_at":"2026-07-05T01:10:26.396721+00:00"}