{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2ESVDLLHBNVDW4UMRWBKS6LOAI","short_pith_number":"pith:2ESVDLLH","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"},"canonical_sha256":"d12551ad670b6a3b728c8d82a9796e02262c737aa0b87ad9cd65a205109c5e4c","source":{"kind":"arxiv","id":"1406.1404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1404","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1404v2","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1404","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"2ESVDLLHBNVD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2ESVDLLHBNVDW4UM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2ESVDLLH","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2ESVDLLHBNVDW4UMRWBKS6LOAI","target":"record","payload":{"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"},"canonical_sha256":"d12551ad670b6a3b728c8d82a9796e02262c737aa0b87ad9cd65a205109c5e4c","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"},"source_kind":"arxiv","source_id":"1406.1404","source_version":2,"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-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5eVYlRZqSial1bvmKGU/iKCwYVyf4HJqGVQF1J66YGBHtvMUnfCTDOZTZXblkzVXq3bwDWIQtnDKpbOrRCgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:33:56.808356Z"},"content_sha256":"cab1c236c0aee1d73e9f43f3fe4fb0ae29a243a6b729da4fce700d11376269bc","schema_version":"1.0","event_id":"sha256:cab1c236c0aee1d73e9f43f3fe4fb0ae29a243a6b729da4fce700d11376269bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2ESVDLLHBNVDW4UMRWBKS6LOAI","target":"graph","payload":{"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"},"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-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+JIgeniKv0ZA6Odgdyv1lUPZKj3ECZiCVreotMopB2JDvJ1fBrg2dXYPbYgatXt7y8jWL3tDiLDdk9m4UVYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:33:56.808709Z"},"content_sha256":"f8db2b685e5b6531b2e182fd3b757099bab93ae118720c21177bc9a4ec0ea4a6","schema_version":"1.0","event_id":"sha256:f8db2b685e5b6531b2e182fd3b757099bab93ae118720c21177bc9a4ec0ea4a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/bundle.json","state_url":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/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-06-08T13:33:56Z","links":{"resolver":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI","bundle":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/bundle.json","state":"https://pith.science/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ESVDLLHBNVDW4UMRWBKS6LOAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2ESVDLLHBNVDW4UMRWBKS6LOAI","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":"4d1eca238006f45788f7172da452dd9d9b0a6c3cf2e3634636b4708e17c029d5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-05T14:48:04Z","title_canon_sha256":"f24864b7a6aa4ffda52305f333a9d8f2b9299cc908b7e804d4eaf90f762e74c5"},"schema_version":"1.0","source":{"id":"1406.1404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1404","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1404v2","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1404","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"2ESVDLLHBNVD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2ESVDLLHBNVDW4UM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2ESVDLLH","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:f8db2b685e5b6531b2e182fd3b757099bab93ae118720c21177bc9a4ec0ea4a6","target":"graph","created_at":"2026-05-18T01:13:05Z","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 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","authors_text":"Fran\\c{c}ois Picalausa, Jan Van den Bussche, Xiaowang Zhang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-05T14:48:04Z","title":"On the satisfiability problem for SPARQL patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1404","kind":"arxiv","version":2},"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:cab1c236c0aee1d73e9f43f3fe4fb0ae29a243a6b729da4fce700d11376269bc","target":"record","created_at":"2026-05-18T01:13:05Z","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":"4d1eca238006f45788f7172da452dd9d9b0a6c3cf2e3634636b4708e17c029d5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-05T14:48:04Z","title_canon_sha256":"f24864b7a6aa4ffda52305f333a9d8f2b9299cc908b7e804d4eaf90f762e74c5"},"schema_version":"1.0","source":{"id":"1406.1404","kind":"arxiv","version":2}},"canonical_sha256":"d12551ad670b6a3b728c8d82a9796e02262c737aa0b87ad9cd65a205109c5e4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d12551ad670b6a3b728c8d82a9796e02262c737aa0b87ad9cd65a205109c5e4c","first_computed_at":"2026-05-18T01:13:05.203017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:05.203017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"70qeeDLZRw/jRiBgjgtYre0NUbmXW3Vc1vjFICIeoY2fc+MiKpWDHP+fiKuVyrVoL5hhx7TgXXo/PHq/S3DVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:05.203389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab1c236c0aee1d73e9f43f3fe4fb0ae29a243a6b729da4fce700d11376269bc","sha256:f8db2b685e5b6531b2e182fd3b757099bab93ae118720c21177bc9a4ec0ea4a6"],"state_sha256":"581871c71dd44d9613a09cb6c6457d5279661baa12cd67199d76486c595cd3b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ony9NMj6SeBFL60P2V6mL7O8Cb/dP32mq1vLvaNPb+dFi3JDPWrCJQlUXy2i3mwerHbX7dOQ24surSNr6CSqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:33:56.810614Z","bundle_sha256":"aa6944e0d57141ebdf71f396d92a0c0d0b784bc85b496e41cb7e776df5d6b98c"}}