{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DEAYYCN4AC7PEG5G5EOULOKN23","short_pith_number":"pith:DEAYYCN4","schema_version":"1.0","canonical_sha256":"19018c09bc00bef21ba6e91d45b94dd6dd1b5136df01bd4d456fed5c37e348bd","source":{"kind":"arxiv","id":"1701.04626","version":1},"attestation_state":"computed","paper":{"title":"Circuit Treewidth, Sentential Decision, and Query Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Simone Bova, Stefan Szeider","submitted_at":"2017-01-17T11:34:07Z","abstract_excerpt":"The evaluation of a query over a probabilistic database boils down to computing the probability of a suitable Boolean function, the lineage of the query over the database. The method of query compilation approaches the task in two stages: first, the query lineage is implemented (compiled) in a circuit form where probability computation is tractable; and second, the desired probability is computed over the compiled circuit. A basic theoretical quest in query compilation is that of identifying pertinent classes of queries whose lineages admit compact representations over increasingly succinct, 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":"1701.04626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-17T11:34:07Z","cross_cats_sorted":[],"title_canon_sha256":"c8dcb0d9606a36b6ec665ba799bdace796b46b60d8988053f44f2deeaa1abd15","abstract_canon_sha256":"d1c6ae280f3ce533e0be6a2088d3130e08749da4f52a0db89f9b2210af3e0d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:43.084573Z","signature_b64":"aiIQwGfiYexstCnIH+j41HEAMAOED/vjJOcGsmg4QXy8a7PhZ4kyALKE1t2uEkw7pqV+F1duIxJMbbDa5CNoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19018c09bc00bef21ba6e91d45b94dd6dd1b5136df01bd4d456fed5c37e348bd","last_reissued_at":"2026-05-18T00:52:43.084085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:43.084085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit Treewidth, Sentential Decision, and Query Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Simone Bova, Stefan Szeider","submitted_at":"2017-01-17T11:34:07Z","abstract_excerpt":"The evaluation of a query over a probabilistic database boils down to computing the probability of a suitable Boolean function, the lineage of the query over the database. The method of query compilation approaches the task in two stages: first, the query lineage is implemented (compiled) in a circuit form where probability computation is tractable; and second, the desired probability is computed over the compiled circuit. A basic theoretical quest in query compilation is that of identifying pertinent classes of queries whose lineages admit compact representations over increasingly succinct, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04626","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":"1701.04626","created_at":"2026-05-18T00:52:43.084164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04626v1","created_at":"2026-05-18T00:52:43.084164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04626","created_at":"2026-05-18T00:52:43.084164+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEAYYCN4AC7P","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEAYYCN4AC7PEG5G","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEAYYCN4","created_at":"2026-05-18T12:31:10.602751+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/DEAYYCN4AC7PEG5G5EOULOKN23","json":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23.json","graph_json":"https://pith.science/api/pith-number/DEAYYCN4AC7PEG5G5EOULOKN23/graph.json","events_json":"https://pith.science/api/pith-number/DEAYYCN4AC7PEG5G5EOULOKN23/events.json","paper":"https://pith.science/paper/DEAYYCN4"},"agent_actions":{"view_html":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23","download_json":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23.json","view_paper":"https://pith.science/paper/DEAYYCN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04626&json=true","fetch_graph":"https://pith.science/api/pith-number/DEAYYCN4AC7PEG5G5EOULOKN23/graph.json","fetch_events":"https://pith.science/api/pith-number/DEAYYCN4AC7PEG5G5EOULOKN23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23/action/storage_attestation","attest_author":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23/action/author_attestation","sign_citation":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23/action/citation_signature","submit_replication":"https://pith.science/pith/DEAYYCN4AC7PEG5G5EOULOKN23/action/replication_record"}},"created_at":"2026-05-18T00:52:43.084164+00:00","updated_at":"2026-05-18T00:52:43.084164+00:00"}