{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HKEKSSPUMPUNHATHOWKOMSVEMT","short_pith_number":"pith:HKEKSSPU","canonical_record":{"source":{"id":"1807.11054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-29T13:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"3d3571f317950faf6a095b57ca3aeb0335779d11b1fa3e305c5370aa4fb3e31a","abstract_canon_sha256":"f3d419b7d3a933a5578164d5a91755fdb58ba17c66c40ebe9143a4629e8c9f30"},"schema_version":"1.0"},"canonical_sha256":"3a88a949f463e8d382677594e64aa464d433a05e92af7cecefeb5c65353f27be","source":{"kind":"arxiv","id":"1807.11054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11054","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11054v1","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11054","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"HKEKSSPUMPUN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKEKSSPUMPUNHATH","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKEKSSPU","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HKEKSSPUMPUNHATHOWKOMSVEMT","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-29T13:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"3d3571f317950faf6a095b57ca3aeb0335779d11b1fa3e305c5370aa4fb3e31a","abstract_canon_sha256":"f3d419b7d3a933a5578164d5a91755fdb58ba17c66c40ebe9143a4629e8c9f30"},"schema_version":"1.0"},"canonical_sha256":"3a88a949f463e8d382677594e64aa464d433a05e92af7cecefeb5c65353f27be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:33.076568Z","signature_b64":"CJRcD7bMxsDQSwYwnIWPDLHKiPQp5iTl2PJO68bbESlFSU7Cfv3dRQWfSo/qmNp4h7uOIo/DiIuXEcRhJFZ2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a88a949f463e8d382677594e64aa464d433a05e92af7cecefeb5c65353f27be","last_reissued_at":"2026-05-18T00:09:33.076162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:33.076162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11054","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:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvL7SmoC3FJJjyBDCw3mDOREQzb5xoLqpVy076VfiK0r+OJDf0DD5CFwlRkJ9Uwts5VizfXaxL4icdPOvUqACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:17:22.429847Z"},"content_sha256":"b5c2ed4d654de9035367b98de6614e0cfe025fd83213dbe9e40129ae16e21376","schema_version":"1.0","event_id":"sha256:b5c2ed4d654de9035367b98de6614e0cfe025fd83213dbe9e40129ae16e21376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HKEKSSPUMPUNHATHOWKOMSVEMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MISS: Finding Optimal Sample Sizes for Approximate Analytics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hong Gao, Hongzhi Wang, Jianzhong Li, Xuebin Su","submitted_at":"2018-07-29T13:36:58Z","abstract_excerpt":"Nowadays, sampling-based Approximate Query Processing (AQP) is widely regarded as a promising way to achieve interactivity in big data analytics. To build such an AQP system, finding the minimal sample size for a query regarding given error constraints in general, called Sample Size Optimization (SSO), is an essential yet unsolved problem. Ideally, the goal of solving the SSO problem is to achieve statistical accuracy, computational efficiency and broad applicability all at the same time. Existing approaches either make idealistic assumptions on the statistical properties of the query, or comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11054","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:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dadnG9s9BnbH89d2BdpWIdRuDko4eBCpKbrL3W6TF3bYscBMTvbnOsYDur49GZQHVmSb5VJiwXjmukWZ1mvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:17:22.430500Z"},"content_sha256":"82db079bacae1559a44fb955b360312aaf13aeff0d488ff3e51dbabb76e0cced","schema_version":"1.0","event_id":"sha256:82db079bacae1559a44fb955b360312aaf13aeff0d488ff3e51dbabb76e0cced"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKEKSSPUMPUNHATHOWKOMSVEMT/bundle.json","state_url":"https://pith.science/pith/HKEKSSPUMPUNHATHOWKOMSVEMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKEKSSPUMPUNHATHOWKOMSVEMT/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-25T18:17:22Z","links":{"resolver":"https://pith.science/pith/HKEKSSPUMPUNHATHOWKOMSVEMT","bundle":"https://pith.science/pith/HKEKSSPUMPUNHATHOWKOMSVEMT/bundle.json","state":"https://pith.science/pith/HKEKSSPUMPUNHATHOWKOMSVEMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKEKSSPUMPUNHATHOWKOMSVEMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HKEKSSPUMPUNHATHOWKOMSVEMT","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":"f3d419b7d3a933a5578164d5a91755fdb58ba17c66c40ebe9143a4629e8c9f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-29T13:36:58Z","title_canon_sha256":"3d3571f317950faf6a095b57ca3aeb0335779d11b1fa3e305c5370aa4fb3e31a"},"schema_version":"1.0","source":{"id":"1807.11054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11054","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11054v1","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11054","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"HKEKSSPUMPUN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKEKSSPUMPUNHATH","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKEKSSPU","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:82db079bacae1559a44fb955b360312aaf13aeff0d488ff3e51dbabb76e0cced","target":"graph","created_at":"2026-05-18T00:09:33Z","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":"Nowadays, sampling-based Approximate Query Processing (AQP) is widely regarded as a promising way to achieve interactivity in big data analytics. To build such an AQP system, finding the minimal sample size for a query regarding given error constraints in general, called Sample Size Optimization (SSO), is an essential yet unsolved problem. Ideally, the goal of solving the SSO problem is to achieve statistical accuracy, computational efficiency and broad applicability all at the same time. Existing approaches either make idealistic assumptions on the statistical properties of the query, or comp","authors_text":"Hong Gao, Hongzhi Wang, Jianzhong Li, Xuebin Su","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-29T13:36:58Z","title":"MISS: Finding Optimal Sample Sizes for Approximate Analytics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11054","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:b5c2ed4d654de9035367b98de6614e0cfe025fd83213dbe9e40129ae16e21376","target":"record","created_at":"2026-05-18T00:09:33Z","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":"f3d419b7d3a933a5578164d5a91755fdb58ba17c66c40ebe9143a4629e8c9f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-29T13:36:58Z","title_canon_sha256":"3d3571f317950faf6a095b57ca3aeb0335779d11b1fa3e305c5370aa4fb3e31a"},"schema_version":"1.0","source":{"id":"1807.11054","kind":"arxiv","version":1}},"canonical_sha256":"3a88a949f463e8d382677594e64aa464d433a05e92af7cecefeb5c65353f27be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a88a949f463e8d382677594e64aa464d433a05e92af7cecefeb5c65353f27be","first_computed_at":"2026-05-18T00:09:33.076162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:33.076162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CJRcD7bMxsDQSwYwnIWPDLHKiPQp5iTl2PJO68bbESlFSU7Cfv3dRQWfSo/qmNp4h7uOIo/DiIuXEcRhJFZ2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:33.076568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5c2ed4d654de9035367b98de6614e0cfe025fd83213dbe9e40129ae16e21376","sha256:82db079bacae1559a44fb955b360312aaf13aeff0d488ff3e51dbabb76e0cced"],"state_sha256":"aed9f8bb5026af3b9ff93644375a94c5a6e01b5ec38571058d02bf29bf77fb91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQq6GL2lWBEtOxrKTigTb+3tqQAzh/4Y61Ypr//vDrmE14QI6sumWwnlWBysqHQs/bx0QHJnO1sNG+krF0LNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:17:22.434120Z","bundle_sha256":"f559660882154b39bf283595b667cc1f4393e1ccbbbbc22fe24b54c6383affe5"}}