{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PJW4CA7THT6IAOMBNYE7C5VLGW","short_pith_number":"pith:PJW4CA7T","canonical_record":{"source":{"id":"1309.5489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-09-21T15:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"839d74fcb2083d94482455fc565ed58fbf75550cafde3884ec0f3e55906249b7","abstract_canon_sha256":"b5244fbdddd6f8788ea05a278dfadbc9ba34b7d42c0d7cb4ec807d0a4d3ef499"},"schema_version":"1.0"},"canonical_sha256":"7a6dc103f33cfc8039816e09f176ab359d4621525165fb73037f4b5e0bcf08df","source":{"kind":"arxiv","id":"1309.5489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5489","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5489v1","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5489","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"PJW4CA7THT6I","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PJW4CA7THT6IAOMB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PJW4CA7T","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PJW4CA7THT6IAOMBNYE7C5VLGW","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-09-21T15:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"839d74fcb2083d94482455fc565ed58fbf75550cafde3884ec0f3e55906249b7","abstract_canon_sha256":"b5244fbdddd6f8788ea05a278dfadbc9ba34b7d42c0d7cb4ec807d0a4d3ef499"},"schema_version":"1.0"},"canonical_sha256":"7a6dc103f33cfc8039816e09f176ab359d4621525165fb73037f4b5e0bcf08df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:36.236704Z","signature_b64":"IriDVggECZMMshZkVhdUbdeMqqBIR7rDEiToBxsUJMWzFp6vjSnEnY751WTcTtbQVYic1a6TbpNrgom0OVkDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6dc103f33cfc8039816e09f176ab359d4621525165fb73037f4b5e0bcf08df","last_reissued_at":"2026-05-18T03:12:36.235952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:36.235952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5489","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-18T03:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1R+Zc1ptK1LXKxJnSBCDR7gy6Gtzpz1/SonKeBa93aVespKWmaGPtaXGDTHt2tghNR4iykLajxtxA69xP4DhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:58:34.836233Z"},"content_sha256":"b2c2fd8b9e2ae057f71c1e59d6986f26eca65ddf5db42ee59113ccecb58e541d","schema_version":"1.0","event_id":"sha256:b2c2fd8b9e2ae057f71c1e59d6986f26eca65ddf5db42ee59113ccecb58e541d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PJW4CA7THT6IAOMBNYE7C5VLGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Aspects of Optional P\\'{o}lya Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Chao Du, Hui Jiang, John C. Mu, Kun Yang, Luo Lu, Wing Hung Wong","submitted_at":"2013-09-21T15:18:34Z","abstract_excerpt":"Optional P\\'{o}lya Tree (OPT) is a flexible non-parametric Bayesian model for density estimation. Despite its merits, the computation for OPT inference is challenging. In this paper we present time complexity analysis for OPT inference and propose two algorithmic improvements. The first improvement, named Limited-Lookahead Optional P\\'{o}lya Tree (LL-OPT), aims at greatly accelerate the computation for OPT inference. The second improvement modifies the output of OPT or LL-OPT and produces a continuous piecewise linear density estimate. We demonstrate the performance of these two improvements u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5489","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-18T03:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m40hNGTrVbK78wcmLwdGuQoFuWSO3O2CcA6J+cK6P02fhrSUKWCH1NHgcCtdRwCKAau3iLqrPbBFfNz14z1LDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:58:34.836626Z"},"content_sha256":"add7466d05146fd5c69af47775cae45cf147a6453adb58c2d6dc10f4faa63eaf","schema_version":"1.0","event_id":"sha256:add7466d05146fd5c69af47775cae45cf147a6453adb58c2d6dc10f4faa63eaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJW4CA7THT6IAOMBNYE7C5VLGW/bundle.json","state_url":"https://pith.science/pith/PJW4CA7THT6IAOMBNYE7C5VLGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJW4CA7THT6IAOMBNYE7C5VLGW/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-03T22:58:34Z","links":{"resolver":"https://pith.science/pith/PJW4CA7THT6IAOMBNYE7C5VLGW","bundle":"https://pith.science/pith/PJW4CA7THT6IAOMBNYE7C5VLGW/bundle.json","state":"https://pith.science/pith/PJW4CA7THT6IAOMBNYE7C5VLGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJW4CA7THT6IAOMBNYE7C5VLGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PJW4CA7THT6IAOMBNYE7C5VLGW","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":"b5244fbdddd6f8788ea05a278dfadbc9ba34b7d42c0d7cb4ec807d0a4d3ef499","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-09-21T15:18:34Z","title_canon_sha256":"839d74fcb2083d94482455fc565ed58fbf75550cafde3884ec0f3e55906249b7"},"schema_version":"1.0","source":{"id":"1309.5489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5489","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5489v1","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5489","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"PJW4CA7THT6I","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PJW4CA7THT6IAOMB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PJW4CA7T","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:add7466d05146fd5c69af47775cae45cf147a6453adb58c2d6dc10f4faa63eaf","target":"graph","created_at":"2026-05-18T03:12:36Z","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":"Optional P\\'{o}lya Tree (OPT) is a flexible non-parametric Bayesian model for density estimation. Despite its merits, the computation for OPT inference is challenging. In this paper we present time complexity analysis for OPT inference and propose two algorithmic improvements. The first improvement, named Limited-Lookahead Optional P\\'{o}lya Tree (LL-OPT), aims at greatly accelerate the computation for OPT inference. The second improvement modifies the output of OPT or LL-OPT and produces a continuous piecewise linear density estimate. We demonstrate the performance of these two improvements u","authors_text":"Chao Du, Hui Jiang, John C. Mu, Kun Yang, Luo Lu, Wing Hung Wong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-09-21T15:18:34Z","title":"Computational Aspects of Optional P\\'{o}lya Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5489","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:b2c2fd8b9e2ae057f71c1e59d6986f26eca65ddf5db42ee59113ccecb58e541d","target":"record","created_at":"2026-05-18T03:12:36Z","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":"b5244fbdddd6f8788ea05a278dfadbc9ba34b7d42c0d7cb4ec807d0a4d3ef499","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-09-21T15:18:34Z","title_canon_sha256":"839d74fcb2083d94482455fc565ed58fbf75550cafde3884ec0f3e55906249b7"},"schema_version":"1.0","source":{"id":"1309.5489","kind":"arxiv","version":1}},"canonical_sha256":"7a6dc103f33cfc8039816e09f176ab359d4621525165fb73037f4b5e0bcf08df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a6dc103f33cfc8039816e09f176ab359d4621525165fb73037f4b5e0bcf08df","first_computed_at":"2026-05-18T03:12:36.235952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:36.235952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IriDVggECZMMshZkVhdUbdeMqqBIR7rDEiToBxsUJMWzFp6vjSnEnY751WTcTtbQVYic1a6TbpNrgom0OVkDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:36.236704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2c2fd8b9e2ae057f71c1e59d6986f26eca65ddf5db42ee59113ccecb58e541d","sha256:add7466d05146fd5c69af47775cae45cf147a6453adb58c2d6dc10f4faa63eaf"],"state_sha256":"6fc5acd06301971215b819c170fee5b16df8bbb436ccff7215f67ecad8feeaab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d1tyRNmGkdYsdzO/qhomao9MSE6dPlPhtLGYZo8pVZ5F31/aki2kJrpvu3EOKyNjT3wnLXZGkmf4BTnfh65Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:58:34.838752Z","bundle_sha256":"3e467fb7cd7e78d08dac98d1b1cb035545a4f499a23e28369d0f897b003cbec8"}}