{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E5BVLS7CLK42LPIO5FQBIULXSK","short_pith_number":"pith:E5BVLS7C","canonical_record":{"source":{"id":"1801.06408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-01-19T14:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"dd8aa095d95de0243a0c518928283e9a06b21cba57ba2c43f4a8319d06d69146","abstract_canon_sha256":"e571942f82764d6e86a97d29edc4dd0919354d83535fb4f0223af73b95bcc08c"},"schema_version":"1.0"},"canonical_sha256":"274355cbe25ab9a5bd0ee96014517792a1755bc56bcb6d66e4ee2d52c219af1c","source":{"kind":"arxiv","id":"1801.06408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06408","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06408v1","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06408","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"E5BVLS7CLK42","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5BVLS7CLK42LPIO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5BVLS7C","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E5BVLS7CLK42LPIO5FQBIULXSK","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-01-19T14:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"dd8aa095d95de0243a0c518928283e9a06b21cba57ba2c43f4a8319d06d69146","abstract_canon_sha256":"e571942f82764d6e86a97d29edc4dd0919354d83535fb4f0223af73b95bcc08c"},"schema_version":"1.0"},"canonical_sha256":"274355cbe25ab9a5bd0ee96014517792a1755bc56bcb6d66e4ee2d52c219af1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:30.238980Z","signature_b64":"Jg/2Q1XZQcevuIA0vKtbysIEHd26isMp49qGMxYM9LlmortV0z33908wmJSbmT58XRCemXFEpV6zJNEvvAizAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"274355cbe25ab9a5bd0ee96014517792a1755bc56bcb6d66e4ee2d52c219af1c","last_reissued_at":"2026-05-18T00:25:30.238331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:30.238331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06408","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-18T00:25:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ET3WdsPqJ1RL4Z2zRHzfT8hD/hqjoQO5sp44qHhlVoBfeLdqzPU5tWvLDmgt05zSAFV/xV7kKiqA5fQdrCjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:06.337173Z"},"content_sha256":"5aa0eaf575891fdf6432beee65bc3f910121724699ee8dd0de023ac8c3012e30","schema_version":"1.0","event_id":"sha256:5aa0eaf575891fdf6432beee65bc3f910121724699ee8dd0de023ac8c3012e30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E5BVLS7CLK42LPIO5FQBIULXSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PRESTO: Probabilistic Cardinality Estimation for RDF Queries Based on Subgraph Overlapping","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aastha Madaan, Eugene Siow, Thanassis Tiropanis, Xin Wang","submitted_at":"2018-01-19T14:11:45Z","abstract_excerpt":"In query optimisation accurate cardinality estimation is essential for finding optimal query plans. It is especially challenging for RDF due to the lack of explicit schema and the excessive occurrence of joins in RDF queries. Existing approaches typically collect statistics based on the counts of triples and estimate the cardinality of a query as the product of its join components, where errors can accumulate even when the estimation of each component is accurate. As opposed to existing methods, we propose PRESTO, a cardinality estimation method that is based on the counts of subgraphs instead"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06408","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-18T00:25:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AGZ9j24ZkgVo2cWrYzL04vfI4BsyQD/BRFN3BogC8mdvXZsP30X1F+eNhfA83Zf/OyPj33kXNA2e7Zh1HDHDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:06.337514Z"},"content_sha256":"5a62ad1cb523c4cb2666ef26484a7e6eb05300e97fa646c747eeccba75bd368f","schema_version":"1.0","event_id":"sha256:5a62ad1cb523c4cb2666ef26484a7e6eb05300e97fa646c747eeccba75bd368f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5BVLS7CLK42LPIO5FQBIULXSK/bundle.json","state_url":"https://pith.science/pith/E5BVLS7CLK42LPIO5FQBIULXSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5BVLS7CLK42LPIO5FQBIULXSK/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-02T19:26:06Z","links":{"resolver":"https://pith.science/pith/E5BVLS7CLK42LPIO5FQBIULXSK","bundle":"https://pith.science/pith/E5BVLS7CLK42LPIO5FQBIULXSK/bundle.json","state":"https://pith.science/pith/E5BVLS7CLK42LPIO5FQBIULXSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5BVLS7CLK42LPIO5FQBIULXSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E5BVLS7CLK42LPIO5FQBIULXSK","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":"e571942f82764d6e86a97d29edc4dd0919354d83535fb4f0223af73b95bcc08c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-01-19T14:11:45Z","title_canon_sha256":"dd8aa095d95de0243a0c518928283e9a06b21cba57ba2c43f4a8319d06d69146"},"schema_version":"1.0","source":{"id":"1801.06408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06408","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06408v1","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06408","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"E5BVLS7CLK42","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5BVLS7CLK42LPIO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5BVLS7C","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:5a62ad1cb523c4cb2666ef26484a7e6eb05300e97fa646c747eeccba75bd368f","target":"graph","created_at":"2026-05-18T00:25:30Z","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":"In query optimisation accurate cardinality estimation is essential for finding optimal query plans. It is especially challenging for RDF due to the lack of explicit schema and the excessive occurrence of joins in RDF queries. Existing approaches typically collect statistics based on the counts of triples and estimate the cardinality of a query as the product of its join components, where errors can accumulate even when the estimation of each component is accurate. As opposed to existing methods, we propose PRESTO, a cardinality estimation method that is based on the counts of subgraphs instead","authors_text":"Aastha Madaan, Eugene Siow, Thanassis Tiropanis, Xin Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-01-19T14:11:45Z","title":"PRESTO: Probabilistic Cardinality Estimation for RDF Queries Based on Subgraph Overlapping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06408","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:5aa0eaf575891fdf6432beee65bc3f910121724699ee8dd0de023ac8c3012e30","target":"record","created_at":"2026-05-18T00:25:30Z","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":"e571942f82764d6e86a97d29edc4dd0919354d83535fb4f0223af73b95bcc08c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-01-19T14:11:45Z","title_canon_sha256":"dd8aa095d95de0243a0c518928283e9a06b21cba57ba2c43f4a8319d06d69146"},"schema_version":"1.0","source":{"id":"1801.06408","kind":"arxiv","version":1}},"canonical_sha256":"274355cbe25ab9a5bd0ee96014517792a1755bc56bcb6d66e4ee2d52c219af1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"274355cbe25ab9a5bd0ee96014517792a1755bc56bcb6d66e4ee2d52c219af1c","first_computed_at":"2026-05-18T00:25:30.238331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:30.238331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jg/2Q1XZQcevuIA0vKtbysIEHd26isMp49qGMxYM9LlmortV0z33908wmJSbmT58XRCemXFEpV6zJNEvvAizAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:30.238980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aa0eaf575891fdf6432beee65bc3f910121724699ee8dd0de023ac8c3012e30","sha256:5a62ad1cb523c4cb2666ef26484a7e6eb05300e97fa646c747eeccba75bd368f"],"state_sha256":"e52832c5ade3e27f30e627c719e7a4d389ccc90d3aa57ec52e70e3dc24f3f8f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMVDCOD9HPE14KsV2Ji/2GbFTsZgEOXte15gkUYu5ulqusgyFl0NUusAiPe8H3lIahMCRzs9EMnUdrq2Q3xiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:26:06.339386Z","bundle_sha256":"13eb2fe2c73da7ca841887c38b079a6ebf33562e5553a1ebfa4d54175755ee2c"}}