{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VPDADFKDRNDVKICUUJPFOFLJO6","short_pith_number":"pith:VPDADFKD","canonical_record":{"source":{"id":"1704.01087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-04T16:18:07Z","cross_cats_sorted":["cs.DB","cs.LG","stat.ML"],"title_canon_sha256":"437f14743037f72a4f2e76d1bb929b90f79d52e71fd5bdeb9df4114707cd4765","abstract_canon_sha256":"c7f85f7daa5f7f38c89c5cc48464429e3fba7079d9122d456c64c46187c9537f"},"schema_version":"1.0"},"canonical_sha256":"abc60195438b47552054a25e57156977a7a144d2321ac2a84caa5f6c9d420a7b","source":{"kind":"arxiv","id":"1704.01087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01087","created_at":"2026-05-18T00:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01087v1","created_at":"2026-05-18T00:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01087","created_at":"2026-05-18T00:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"VPDADFKDRNDV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPDADFKDRNDVKICU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPDADFKD","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VPDADFKDRNDVKICUUJPFOFLJO6","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-04T16:18:07Z","cross_cats_sorted":["cs.DB","cs.LG","stat.ML"],"title_canon_sha256":"437f14743037f72a4f2e76d1bb929b90f79d52e71fd5bdeb9df4114707cd4765","abstract_canon_sha256":"c7f85f7daa5f7f38c89c5cc48464429e3fba7079d9122d456c64c46187c9537f"},"schema_version":"1.0"},"canonical_sha256":"abc60195438b47552054a25e57156977a7a144d2321ac2a84caa5f6c9d420a7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:16.262160Z","signature_b64":"KRSrkPaFQSyuGM5dUcutiT0SjgKRtTbfYypGIdLaeqMBKrJ/BdARD093STF5AKqLo+D4ApdFnDeCXIOFG05kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abc60195438b47552054a25e57156977a7a144d2321ac2a84caa5f6c9d420a7b","last_reissued_at":"2026-05-18T00:47:16.261625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:16.261625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01087","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:47:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTqno7mibrI7a6JxWdkngEhyFz4Lv0+pwEovJV/IGLSui94Ic/rrX6P18msoz/+wXUEJWOhu8bnSxWyOxwBKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:26:13.350818Z"},"content_sha256":"cc338ec460414b91a6b1aecc8084990d14b3967d93dd571daf67de4a9de1e842","schema_version":"1.0","event_id":"sha256:cc338ec460414b91a6b1aecc8084990d14b3967d93dd571daf67de4a9de1e842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VPDADFKDRNDVKICUUJPFOFLJO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Search for Structured Data via Probabilistic Programming and Nonparametric Bayes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Feras Saad, Leonardo Casarsa, Vikash Mansinghka","submitted_at":"2017-04-04T16:18:07Z","abstract_excerpt":"Databases are widespread, yet extracting relevant data can be difficult. Without substantial domain knowledge, multivariate search queries often return sparse or uninformative results. This paper introduces an approach for searching structured data based on probabilistic programming and nonparametric Bayes. Users specify queries in a probabilistic language that combines standard SQL database search operators with an information theoretic ranking function called predictive relevance. Predictive relevance can be calculated by a fast sparse matrix algorithm based on posterior samples from CrossCa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01087","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:47:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GBKZxIjn2mQkOZp9astR5kelOQM8D4xSHd/5AEnZ+mpNtIfCazrYbEIMj931hz2p8yrUGZ90W14RztVHYdaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:26:13.351378Z"},"content_sha256":"be7151b04f73edec44bdd55b595c0a5aeef1cd08f47bfa625098451bdfc48ab1","schema_version":"1.0","event_id":"sha256:be7151b04f73edec44bdd55b595c0a5aeef1cd08f47bfa625098451bdfc48ab1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPDADFKDRNDVKICUUJPFOFLJO6/bundle.json","state_url":"https://pith.science/pith/VPDADFKDRNDVKICUUJPFOFLJO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPDADFKDRNDVKICUUJPFOFLJO6/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-27T22:26:13Z","links":{"resolver":"https://pith.science/pith/VPDADFKDRNDVKICUUJPFOFLJO6","bundle":"https://pith.science/pith/VPDADFKDRNDVKICUUJPFOFLJO6/bundle.json","state":"https://pith.science/pith/VPDADFKDRNDVKICUUJPFOFLJO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPDADFKDRNDVKICUUJPFOFLJO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VPDADFKDRNDVKICUUJPFOFLJO6","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":"c7f85f7daa5f7f38c89c5cc48464429e3fba7079d9122d456c64c46187c9537f","cross_cats_sorted":["cs.DB","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-04T16:18:07Z","title_canon_sha256":"437f14743037f72a4f2e76d1bb929b90f79d52e71fd5bdeb9df4114707cd4765"},"schema_version":"1.0","source":{"id":"1704.01087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01087","created_at":"2026-05-18T00:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01087v1","created_at":"2026-05-18T00:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01087","created_at":"2026-05-18T00:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"VPDADFKDRNDV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPDADFKDRNDVKICU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPDADFKD","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:be7151b04f73edec44bdd55b595c0a5aeef1cd08f47bfa625098451bdfc48ab1","target":"graph","created_at":"2026-05-18T00:47:16Z","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":"Databases are widespread, yet extracting relevant data can be difficult. Without substantial domain knowledge, multivariate search queries often return sparse or uninformative results. This paper introduces an approach for searching structured data based on probabilistic programming and nonparametric Bayes. Users specify queries in a probabilistic language that combines standard SQL database search operators with an information theoretic ranking function called predictive relevance. Predictive relevance can be calculated by a fast sparse matrix algorithm based on posterior samples from CrossCa","authors_text":"Feras Saad, Leonardo Casarsa, Vikash Mansinghka","cross_cats":["cs.DB","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-04T16:18:07Z","title":"Probabilistic Search for Structured Data via Probabilistic Programming and Nonparametric Bayes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01087","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:cc338ec460414b91a6b1aecc8084990d14b3967d93dd571daf67de4a9de1e842","target":"record","created_at":"2026-05-18T00:47:16Z","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":"c7f85f7daa5f7f38c89c5cc48464429e3fba7079d9122d456c64c46187c9537f","cross_cats_sorted":["cs.DB","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-04T16:18:07Z","title_canon_sha256":"437f14743037f72a4f2e76d1bb929b90f79d52e71fd5bdeb9df4114707cd4765"},"schema_version":"1.0","source":{"id":"1704.01087","kind":"arxiv","version":1}},"canonical_sha256":"abc60195438b47552054a25e57156977a7a144d2321ac2a84caa5f6c9d420a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abc60195438b47552054a25e57156977a7a144d2321ac2a84caa5f6c9d420a7b","first_computed_at":"2026-05-18T00:47:16.261625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:16.261625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRSrkPaFQSyuGM5dUcutiT0SjgKRtTbfYypGIdLaeqMBKrJ/BdARD093STF5AKqLo+D4ApdFnDeCXIOFG05kAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:16.262160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc338ec460414b91a6b1aecc8084990d14b3967d93dd571daf67de4a9de1e842","sha256:be7151b04f73edec44bdd55b595c0a5aeef1cd08f47bfa625098451bdfc48ab1"],"state_sha256":"c1b62e9dff44ba67067a250444b03fd36d29602abb256d01bbf07a3f2b24f010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msDJFIqAZ7sHrHcBSiLga5xxDr9GMLUJdwxkqUts38hBdxmZp6jlfzWehfxBI/TD3W/QPDWcVBl8dCkyGCz3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:26:13.354591Z","bundle_sha256":"230d1ef5b71d0ce81b445c3653f4f350dca2ccbbdf819c50415e6ff4152eea2f"}}