{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NNPM3BBXNJ5WHUSLSUJ2AMH2LY","short_pith_number":"pith:NNPM3BBX","canonical_record":{"source":{"id":"1210.4663","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-17T08:14:50Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"5f487b5c85ed07dc83cdac455c2206a506809c1bae98d0604ada7380267003bb","abstract_canon_sha256":"b083d991ae6b69a0413e571944d456639fe4a2f020e11abb766753e65e4c8fbe"},"schema_version":"1.0"},"canonical_sha256":"6b5ecd84376a7b63d24b9513a030fa5e13ad039b8979f45001f45bbdc3ecaa07","source":{"kind":"arxiv","id":"1210.4663","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4663","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4663v7","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4663","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"NNPM3BBXNJ5W","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NNPM3BBXNJ5WHUSL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NNPM3BBX","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NNPM3BBXNJ5WHUSLSUJ2AMH2LY","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4663","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-17T08:14:50Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"5f487b5c85ed07dc83cdac455c2206a506809c1bae98d0604ada7380267003bb","abstract_canon_sha256":"b083d991ae6b69a0413e571944d456639fe4a2f020e11abb766753e65e4c8fbe"},"schema_version":"1.0"},"canonical_sha256":"6b5ecd84376a7b63d24b9513a030fa5e13ad039b8979f45001f45bbdc3ecaa07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:51.289714Z","signature_b64":"IYIfvV5GR9yWckY8W5ZuQ3Kl99bdWdfeuNGVV08WmHwGbECy/87IyWhYxRWzjKQyaI6m8u1ORoVoZSLixC0YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5ecd84376a7b63d24b9513a030fa5e13ad039b8979f45001f45bbdc3ecaa07","last_reissued_at":"2026-05-18T00:11:51.288971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:51.288971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4663","source_version":7,"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:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tm1PXM0uxxvWqy9kbDOGyrDUX6o85vERxq1etvibHCRZJj1+qoyz2HdEP0a0GDxSpCQztzt05lY/HrBpSzGPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:27:11.107571Z"},"content_sha256":"4dc13f686f1eddfadc107f32e7e08be377e17ae87294d4d7c2549e513716a98d","schema_version":"1.0","event_id":"sha256:4dc13f686f1eddfadc107f32e7e08be377e17ae87294d4d7c2549e513716a98d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NNPM3BBXNJ5WHUSLSUJ2AMH2LY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A PRQ Search Method for Probabilistic Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DB","authors_text":"Jack Wang","submitted_at":"2012-10-17T08:14:50Z","abstract_excerpt":"This article proposes an PQR search method for probabilistic objects. The main idea of our method is to use a strategy called \\textit{pre-approximation} that can reduce the initial problem to a highly simplified version, implying that it makes the rest of steps easy to tackle. In particular, this strategy itself is pretty simple and easy to implement. Furthermore, motivated by the cost analysis, we further optimize our solution. The optimizations are mainly based on two insights: (\\romannumeral 1) the number of \\textit{effective subdivision}s is no more than 1; and (\\romannumeral 2) an entity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4663","kind":"arxiv","version":7},"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:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9kiHuumlAypowc2iJej6n3LvoqdpTOSwxpjO3R2koL1BMzuDNmRUb3sGtpQRmG4pFPpD3IHBFb2TTX6amVhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:27:11.107917Z"},"content_sha256":"3c139797daf9994fe42b9e0caa147d1868279b21153a9a21931f989ede2f011f","schema_version":"1.0","event_id":"sha256:3c139797daf9994fe42b9e0caa147d1868279b21153a9a21931f989ede2f011f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY/bundle.json","state_url":"https://pith.science/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY/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-25T10:27:11Z","links":{"resolver":"https://pith.science/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY","bundle":"https://pith.science/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY/bundle.json","state":"https://pith.science/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNPM3BBXNJ5WHUSLSUJ2AMH2LY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NNPM3BBXNJ5WHUSLSUJ2AMH2LY","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":"b083d991ae6b69a0413e571944d456639fe4a2f020e11abb766753e65e4c8fbe","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-17T08:14:50Z","title_canon_sha256":"5f487b5c85ed07dc83cdac455c2206a506809c1bae98d0604ada7380267003bb"},"schema_version":"1.0","source":{"id":"1210.4663","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4663","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4663v7","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4663","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"NNPM3BBXNJ5W","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NNPM3BBXNJ5WHUSL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NNPM3BBX","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:3c139797daf9994fe42b9e0caa147d1868279b21153a9a21931f989ede2f011f","target":"graph","created_at":"2026-05-18T00:11:51Z","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":"This article proposes an PQR search method for probabilistic objects. The main idea of our method is to use a strategy called \\textit{pre-approximation} that can reduce the initial problem to a highly simplified version, implying that it makes the rest of steps easy to tackle. In particular, this strategy itself is pretty simple and easy to implement. Furthermore, motivated by the cost analysis, we further optimize our solution. The optimizations are mainly based on two insights: (\\romannumeral 1) the number of \\textit{effective subdivision}s is no more than 1; and (\\romannumeral 2) an entity ","authors_text":"Jack Wang","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-17T08:14:50Z","title":"A PRQ Search Method for Probabilistic Objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4663","kind":"arxiv","version":7},"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:4dc13f686f1eddfadc107f32e7e08be377e17ae87294d4d7c2549e513716a98d","target":"record","created_at":"2026-05-18T00:11:51Z","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":"b083d991ae6b69a0413e571944d456639fe4a2f020e11abb766753e65e4c8fbe","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-17T08:14:50Z","title_canon_sha256":"5f487b5c85ed07dc83cdac455c2206a506809c1bae98d0604ada7380267003bb"},"schema_version":"1.0","source":{"id":"1210.4663","kind":"arxiv","version":7}},"canonical_sha256":"6b5ecd84376a7b63d24b9513a030fa5e13ad039b8979f45001f45bbdc3ecaa07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5ecd84376a7b63d24b9513a030fa5e13ad039b8979f45001f45bbdc3ecaa07","first_computed_at":"2026-05-18T00:11:51.288971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:51.288971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IYIfvV5GR9yWckY8W5ZuQ3Kl99bdWdfeuNGVV08WmHwGbECy/87IyWhYxRWzjKQyaI6m8u1ORoVoZSLixC0YAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:51.289714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4663","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc13f686f1eddfadc107f32e7e08be377e17ae87294d4d7c2549e513716a98d","sha256:3c139797daf9994fe42b9e0caa147d1868279b21153a9a21931f989ede2f011f"],"state_sha256":"810a71f6ecdfd902a2367cdc9d0756d0a33e2c84d2095f460126329242e6de59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RFdc5Cxxpzl90qVDDMhy8dVBtG5hz4jvppI0OtoQpgaa6mZV4UBOGDVRrMMja0lcsF7Take3CmFrMTIjHzrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:27:11.109869Z","bundle_sha256":"f0aade93436f5b8de7b6332064b24d173c6d3313144fed5df7df6bfbf9ca42b4"}}