{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2ESVDLLHBNVDW4UMRWBKS6LOAI","short_pith_number":"pith:2ESVDLLH","schema_version":"1.0","canonical_sha256":"d12551ad670b6a3b728c8d82a9796e02262c737aa0b87ad9cd65a205109c5e4c","source":{"kind":"arxiv","id":"1406.1404","version":2},"attestation_state":"computed","paper":{"title":"On the satisfiability problem for SPARQL patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Fran\\c{c}ois Picalausa, Jan Van den Bussche, Xiaowang Zhang","submitted_at":"2014-06-05T14:48:04Z","abstract_excerpt":"The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of satisfiability in terms of the constraints allowed in filter conditions. The classes of constraints considered are bound-constraints, negated bound-constraints, equalities, nonequalities, constant-equalities, and constant-nonequalities. The main result of the paper can be summarized by saying that, as soon as inconsistent filter conditions can be formed, satisf"},"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":"1406.1404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-05T14:48:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f24864b7a6aa4ffda52305f333a9d8f2b9299cc908b7e804d4eaf90f762e74c5","abstract_canon_sha256":"4d1eca238006f45788f7172da452dd9d9b0a6c3cf2e3634636b4708e17c029d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.203389Z","signature_b64":"70qeeDLZRw/jRiBgjgtYre0NUbmXW3Vc1vjFICIeoY2fc+MiKpWDHP+fiKuVyrVoL5hhx7TgXXo/PHq/S3DVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d12551ad670b6a3b728c8d82a9796e02262c737aa0b87ad9cd65a205109c5e4c","last_reissued_at":"2026-05-18T01:13:05.203017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.203017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the satisfiability problem for SPARQL patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Fran\\c{c}ois Picalausa, Jan Van den Bussche, Xiaowang Zhang","submitted_at":"2014-06-05T14:48:04Z","abstract_excerpt":"The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of satisfiability in terms of the constraints allowed in filter conditions. The classes of constraints considered are bound-constraints, negated bound-constraints, equalities, nonequalities, constant-equalities, and constant-nonequalities. The main result of the paper can be summarized by saying that, as soon as inconsistent filter conditions can be formed, satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1404","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":""},"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":"1406.1404","created_at":"2026-05-18T01:13:05.203076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1404v2","created_at":"2026-05-18T01:13:05.203076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1404","created_at":"2026-05-18T01:13:05.203076+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ESVDLLHBNVD","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ESVDLLHBNVDW4UM","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ESVDLLH","created_at":"2026-05-18T12:28:09.283467+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/2ESVDLLHBNVDW4UMRWBKS6LOAI","json":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI.json","graph_json":"https://pith.science/api/pith-number/2ESVDLLHBNVDW4UMRWBKS6LOAI/graph.json","events_json":"https://pith.science/api/pith-number/2ESVDLLHBNVDW4UMRWBKS6LOAI/events.json","paper":"https://pith.science/paper/2ESVDLLH"},"agent_actions":{"view_html":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI","download_json":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI.json","view_paper":"https://pith.science/paper/2ESVDLLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1404&json=true","fetch_graph":"https://pith.science/api/pith-number/2ESVDLLHBNVDW4UMRWBKS6LOAI/graph.json","fetch_events":"https://pith.science/api/pith-number/2ESVDLLHBNVDW4UMRWBKS6LOAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/action/storage_attestation","attest_author":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/action/author_attestation","sign_citation":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/action/citation_signature","submit_replication":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/action/replication_record"}},"created_at":"2026-05-18T01:13:05.203076+00:00","updated_at":"2026-05-18T01:13:05.203076+00:00"}