{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R4TPZFUOEHIIPGCD2HQGALDI5A","short_pith_number":"pith:R4TPZFUO","schema_version":"1.0","canonical_sha256":"8f26fc968e21d0879843d1e0602c68e83de671508b75ba7851427150ef995dc7","source":{"kind":"arxiv","id":"1908.07093","version":9},"attestation_state":"computed","paper":{"title":"Uniform Reliability of Self-Join-Free Conjunctive Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Antoine Amarilli, Benny Kimelfeld","submitted_at":"2019-08-19T22:51:40Z","abstract_excerpt":"The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are sampled one by one, independently, with their associated probability. For queries without self-joins (repeated relation symbols), the data complexity of this problem is fully characterized by a known dichotomy: reliability can be computed in polynomial time for hierarchical queries, and is #P-hard for non-hierarchical queries.\n  Inspired by this dichotomy, we investigate a fundamental counting problem for CQs without"},"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":"1908.07093","kind":"arxiv","version":9},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2019-08-19T22:51:40Z","cross_cats_sorted":[],"title_canon_sha256":"b86bed9edc154e350524b4645724206dd611614c58b3ac5916cf1a35fe1a8ba1","abstract_canon_sha256":"3b29a3934c478986257f449f821289cc84e36a1f05d175892c1a77bf400464a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:27.824153Z","signature_b64":"6DsezYvBKOLeXS/avGnWHwoCXnlTP1p0I9E1iX0Jmedsn72GUBYrFRHCSSm6ZLYEnTDyCEvyIFZLVqJ1Nng7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f26fc968e21d0879843d1e0602c68e83de671508b75ba7851427150ef995dc7","last_reissued_at":"2026-07-05T06:23:27.823720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:27.823720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform Reliability of Self-Join-Free Conjunctive Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Antoine Amarilli, Benny Kimelfeld","submitted_at":"2019-08-19T22:51:40Z","abstract_excerpt":"The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are sampled one by one, independently, with their associated probability. For queries without self-joins (repeated relation symbols), the data complexity of this problem is fully characterized by a known dichotomy: reliability can be computed in polynomial time for hierarchical queries, and is #P-hard for non-hierarchical queries.\n  Inspired by this dichotomy, we investigate a fundamental counting problem for CQs without"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07093","kind":"arxiv","version":9},"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/1908.07093/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":"1908.07093","created_at":"2026-07-05T06:23:27.823789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07093v9","created_at":"2026-07-05T06:23:27.823789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07093","created_at":"2026-07-05T06:23:27.823789+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4TPZFUOEHII","created_at":"2026-07-05T06:23:27.823789+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4TPZFUOEHIIPGCD","created_at":"2026-07-05T06:23:27.823789+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4TPZFUO","created_at":"2026-07-05T06:23:27.823789+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/R4TPZFUOEHIIPGCD2HQGALDI5A","json":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A.json","graph_json":"https://pith.science/api/pith-number/R4TPZFUOEHIIPGCD2HQGALDI5A/graph.json","events_json":"https://pith.science/api/pith-number/R4TPZFUOEHIIPGCD2HQGALDI5A/events.json","paper":"https://pith.science/paper/R4TPZFUO"},"agent_actions":{"view_html":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A","download_json":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A.json","view_paper":"https://pith.science/paper/R4TPZFUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07093&json=true","fetch_graph":"https://pith.science/api/pith-number/R4TPZFUOEHIIPGCD2HQGALDI5A/graph.json","fetch_events":"https://pith.science/api/pith-number/R4TPZFUOEHIIPGCD2HQGALDI5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A/action/storage_attestation","attest_author":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A/action/author_attestation","sign_citation":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A/action/citation_signature","submit_replication":"https://pith.science/pith/R4TPZFUOEHIIPGCD2HQGALDI5A/action/replication_record"}},"created_at":"2026-07-05T06:23:27.823789+00:00","updated_at":"2026-07-05T06:23:27.823789+00:00"}