{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O4VP7BONYCWUVG7WJ4IAU4D2DI","short_pith_number":"pith:O4VP7BON","canonical_record":{"source":{"id":"1008.5057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-30T11:30:32Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"bd264423fab55f38ed66143a4eed52d8570188fc868805c7a8da64d099e244a6","abstract_canon_sha256":"51486d9a2e77e7d02117333082b78da8b9e27c51722e4595e80e81656b80d706"},"schema_version":"1.0"},"canonical_sha256":"772aff85cdc0ad4a9bf64f100a707a1a0ddc204416368294942c80dfcacdb791","source":{"kind":"arxiv","id":"1008.5057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5057","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5057v1","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5057","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"pith_short_12","alias_value":"O4VP7BONYCWU","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O4VP7BONYCWUVG7W","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O4VP7BON","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O4VP7BONYCWUVG7WJ4IAU4D2DI","target":"record","payload":{"canonical_record":{"source":{"id":"1008.5057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-30T11:30:32Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"bd264423fab55f38ed66143a4eed52d8570188fc868805c7a8da64d099e244a6","abstract_canon_sha256":"51486d9a2e77e7d02117333082b78da8b9e27c51722e4595e80e81656b80d706"},"schema_version":"1.0"},"canonical_sha256":"772aff85cdc0ad4a9bf64f100a707a1a0ddc204416368294942c80dfcacdb791","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:37.215178Z","signature_b64":"fLXQ1x6t+reEVXemd01/gmexXY9mLlR3qixbJu1OihePdopJjGTBkloZ28nAreO3jLs0tbcpjP5y3a8Xat01Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"772aff85cdc0ad4a9bf64f100a707a1a0ddc204416368294942c80dfcacdb791","last_reissued_at":"2026-05-18T04:41:37.214730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:37.214730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.5057","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-18T04:41:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxf5ievp9H7tkfozDS88L8lBZzcqqhZEpypLuLaRtUwXz6mXPQDB06kaEFjmO1N+6zHg6JEz8iwWYQRSX9AaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:37:32.936542Z"},"content_sha256":"b041f64e26262be02c4a74586b397476da39b8e3e0085b0fcc8d086245329875","schema_version":"1.0","event_id":"sha256:b041f64e26262be02c4a74586b397476da39b8e3e0085b0fcc8d086245329875"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O4VP7BONYCWUVG7WJ4IAU4D2DI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Top-k Retrieval from Hidden Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Antti Ukkonen","submitted_at":"2010-08-30T11:30:32Z","abstract_excerpt":"We consider the evaluation of approximate top-k queries from relations with a-priori unknown values. Such relations can arise for example in the context of expensive predicates, or cloud-based data sources. The task is to find an approximate top-k set that is close to the exact one while keeping the total processing cost low. The cost of a query is the sum of the costs of the entries that are read from the hidden relation. A novel aspect of this work is that we consider prior information about the values in the hidden matrix. We propose an algorithm that uses regression models at query time to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5057","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-18T04:41:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cvi5hCFXrCuIjjQsg25yFHEkJiQ8SAYNHaiHzugVj+ErW6oroFT4FYPKrc6xo0w3DffZ5Kv8ODPbmeGKJDBLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:37:32.936885Z"},"content_sha256":"f1478d32ad5b6f391ce0f00f8320b3b06c0d65aaa5299d10a502bdf1962c86c0","schema_version":"1.0","event_id":"sha256:f1478d32ad5b6f391ce0f00f8320b3b06c0d65aaa5299d10a502bdf1962c86c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI/bundle.json","state_url":"https://pith.science/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI/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-23T04:37:32Z","links":{"resolver":"https://pith.science/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI","bundle":"https://pith.science/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI/bundle.json","state":"https://pith.science/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4VP7BONYCWUVG7WJ4IAU4D2DI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O4VP7BONYCWUVG7WJ4IAU4D2DI","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":"51486d9a2e77e7d02117333082b78da8b9e27c51722e4595e80e81656b80d706","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-30T11:30:32Z","title_canon_sha256":"bd264423fab55f38ed66143a4eed52d8570188fc868805c7a8da64d099e244a6"},"schema_version":"1.0","source":{"id":"1008.5057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5057","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5057v1","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5057","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"pith_short_12","alias_value":"O4VP7BONYCWU","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O4VP7BONYCWUVG7W","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O4VP7BON","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:f1478d32ad5b6f391ce0f00f8320b3b06c0d65aaa5299d10a502bdf1962c86c0","target":"graph","created_at":"2026-05-18T04:41:37Z","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":"We consider the evaluation of approximate top-k queries from relations with a-priori unknown values. Such relations can arise for example in the context of expensive predicates, or cloud-based data sources. The task is to find an approximate top-k set that is close to the exact one while keeping the total processing cost low. The cost of a query is the sum of the costs of the entries that are read from the hidden relation. A novel aspect of this work is that we consider prior information about the values in the hidden matrix. We propose an algorithm that uses regression models at query time to","authors_text":"Antti Ukkonen","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-30T11:30:32Z","title":"Approximate Top-k Retrieval from Hidden Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5057","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:b041f64e26262be02c4a74586b397476da39b8e3e0085b0fcc8d086245329875","target":"record","created_at":"2026-05-18T04:41:37Z","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":"51486d9a2e77e7d02117333082b78da8b9e27c51722e4595e80e81656b80d706","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-30T11:30:32Z","title_canon_sha256":"bd264423fab55f38ed66143a4eed52d8570188fc868805c7a8da64d099e244a6"},"schema_version":"1.0","source":{"id":"1008.5057","kind":"arxiv","version":1}},"canonical_sha256":"772aff85cdc0ad4a9bf64f100a707a1a0ddc204416368294942c80dfcacdb791","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"772aff85cdc0ad4a9bf64f100a707a1a0ddc204416368294942c80dfcacdb791","first_computed_at":"2026-05-18T04:41:37.214730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:37.214730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fLXQ1x6t+reEVXemd01/gmexXY9mLlR3qixbJu1OihePdopJjGTBkloZ28nAreO3jLs0tbcpjP5y3a8Xat01Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:37.215178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.5057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b041f64e26262be02c4a74586b397476da39b8e3e0085b0fcc8d086245329875","sha256:f1478d32ad5b6f391ce0f00f8320b3b06c0d65aaa5299d10a502bdf1962c86c0"],"state_sha256":"a72233a2d53bdb03e1c1d5b0ea694ac801d020034bccfc0e73248c421f3c1c59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zodI2FsnPtN1ixMG8sF9vAU8YoFU9tb9AfqreJuUUHObTkovvQuVyaUMQzhgHSmp/ARJJVmk83vHEKS/IWneAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:37:32.938766Z","bundle_sha256":"2007c4a4103302799a0b91dfb16723c49a4177936f63c9d76041f5f19900caa7"}}