{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A3TVDM5NYA4R7KF2LDJAHJ3OUT","short_pith_number":"pith:A3TVDM5N","canonical_record":{"source":{"id":"1603.06732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-22T10:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"b5107ead469db0d9f404d85a2fd90ef885f8a812a74d0c6e1640339d325ce373","abstract_canon_sha256":"d0fcf499b8a457deaed2e5a406348e5fee654066ca9bcb386d8a39dba17b445f"},"schema_version":"1.0"},"canonical_sha256":"06e751b3adc0391fa8ba58d203a76ea4c8de999c171107c6b329db922f81580d","source":{"kind":"arxiv","id":"1603.06732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06732","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06732v1","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06732","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"A3TVDM5NYA4R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A3TVDM5NYA4R7KF2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A3TVDM5N","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A3TVDM5NYA4R7KF2LDJAHJ3OUT","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-22T10:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"b5107ead469db0d9f404d85a2fd90ef885f8a812a74d0c6e1640339d325ce373","abstract_canon_sha256":"d0fcf499b8a457deaed2e5a406348e5fee654066ca9bcb386d8a39dba17b445f"},"schema_version":"1.0"},"canonical_sha256":"06e751b3adc0391fa8ba58d203a76ea4c8de999c171107c6b329db922f81580d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.834516Z","signature_b64":"7Ah/6ne8y9teW9c0kHyFJZFPfCCsbwVz+1OTOonY7W0EesaCNTt8rRYOoXQzKEGwyDIfp3BCZshI/eWDGUAFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e751b3adc0391fa8ba58d203a76ea4c8de999c171107c6b329db922f81580d","last_reissued_at":"2026-05-18T01:18:34.834038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.834038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06732","source_version":1,"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:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILrBohVh3XkIQoyD2csu6JpoST40n7cP7+fEtc/Gm0agE//6nPzycBp26CV4J3tUEng4RqCI0+YIJazyxpsDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:11:21.260633Z"},"content_sha256":"9975bf1f116cbee8b6537fb1504379ce337d22f3c3cc4ca3055568c6fc641464","schema_version":"1.0","event_id":"sha256:9975bf1f116cbee8b6537fb1504379ce337d22f3c3cc4ca3055568c6fc641464"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A3TVDM5NYA4R7KF2LDJAHJ3OUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Approximation of Well-Designed SPARQL Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guozheng Rao, Xiaowang Zhang, Xin Wang, Zhenyu Song, Zhiyong Feng","submitted_at":"2016-03-22T10:51:01Z","abstract_excerpt":"Query response time often influences user experience in the real world. However, it possibly takes more time to answer a query with its all exact solutions, especially when it contains the OPT operations since the OPT operation is the least conventional operator in SPARQL. So it becomes essential to make a trade-off between the query response time and the accuracy of their solutions. In this paper, based on the depth of the OPT operation occurring in a query, we propose an approach to obtain its all approximate queries with less depth of the OPT operation. This paper mainly discusses those que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06732","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"},"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:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYAO4eZRyIRCNkXbOV6NElc+qq4UgnVc7uGR7vPB6xDqeDqyYxOwYpd4oI9iBIjldYteZV7gx0J/BpZhPAezBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:11:21.261265Z"},"content_sha256":"6d986ce73f50f9924f0550852ce39543ba184a867625ef17e64f92151c188592","schema_version":"1.0","event_id":"sha256:6d986ce73f50f9924f0550852ce39543ba184a867625ef17e64f92151c188592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT/bundle.json","state_url":"https://pith.science/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT/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-05-26T16:11:21Z","links":{"resolver":"https://pith.science/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT","bundle":"https://pith.science/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT/bundle.json","state":"https://pith.science/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3TVDM5NYA4R7KF2LDJAHJ3OUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A3TVDM5NYA4R7KF2LDJAHJ3OUT","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":"d0fcf499b8a457deaed2e5a406348e5fee654066ca9bcb386d8a39dba17b445f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-22T10:51:01Z","title_canon_sha256":"b5107ead469db0d9f404d85a2fd90ef885f8a812a74d0c6e1640339d325ce373"},"schema_version":"1.0","source":{"id":"1603.06732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06732","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06732v1","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06732","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"A3TVDM5NYA4R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A3TVDM5NYA4R7KF2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A3TVDM5N","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:6d986ce73f50f9924f0550852ce39543ba184a867625ef17e64f92151c188592","target":"graph","created_at":"2026-05-18T01:18:34Z","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":"Query response time often influences user experience in the real world. However, it possibly takes more time to answer a query with its all exact solutions, especially when it contains the OPT operations since the OPT operation is the least conventional operator in SPARQL. So it becomes essential to make a trade-off between the query response time and the accuracy of their solutions. In this paper, based on the depth of the OPT operation occurring in a query, we propose an approach to obtain its all approximate queries with less depth of the OPT operation. This paper mainly discusses those que","authors_text":"Guozheng Rao, Xiaowang Zhang, Xin Wang, Zhenyu Song, Zhiyong Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-22T10:51:01Z","title":"Efficient Approximation of Well-Designed SPARQL Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06732","kind":"arxiv","version":1},"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:9975bf1f116cbee8b6537fb1504379ce337d22f3c3cc4ca3055568c6fc641464","target":"record","created_at":"2026-05-18T01:18:34Z","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":"d0fcf499b8a457deaed2e5a406348e5fee654066ca9bcb386d8a39dba17b445f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-22T10:51:01Z","title_canon_sha256":"b5107ead469db0d9f404d85a2fd90ef885f8a812a74d0c6e1640339d325ce373"},"schema_version":"1.0","source":{"id":"1603.06732","kind":"arxiv","version":1}},"canonical_sha256":"06e751b3adc0391fa8ba58d203a76ea4c8de999c171107c6b329db922f81580d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06e751b3adc0391fa8ba58d203a76ea4c8de999c171107c6b329db922f81580d","first_computed_at":"2026-05-18T01:18:34.834038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:34.834038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Ah/6ne8y9teW9c0kHyFJZFPfCCsbwVz+1OTOonY7W0EesaCNTt8rRYOoXQzKEGwyDIfp3BCZshI/eWDGUAFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:34.834516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9975bf1f116cbee8b6537fb1504379ce337d22f3c3cc4ca3055568c6fc641464","sha256:6d986ce73f50f9924f0550852ce39543ba184a867625ef17e64f92151c188592"],"state_sha256":"afb8be1875712c87b111caf9d75691ff0bb4d50f9d1f9976d1dec9731d254f8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WtaED7XPGAdNiTzOR6b3zI5NSZpdw94EVm0UnBH9yQ7ndT+kbpecq+qKFmlvJatMD22QD5Y+4tfYMYrY3cxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:11:21.264693Z","bundle_sha256":"105f0ec70bd36f4ee6ebccef25621fe12a80fcce649a67a3d00215f45be74ab1"}}