{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:JJIJLOJOKYVXOFFUIQWDZCR5BM","short_pith_number":"pith:JJIJLOJO","canonical_record":{"source":{"id":"0906.3215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-06-17T15:29:16Z","cross_cats_sorted":[],"title_canon_sha256":"e759d267e5be03abca6f53666ce1ee292c4b348a96c0a94e25b187dcc2ef5ddd","abstract_canon_sha256":"ca00f3d53b7e821afb51dc1746bec38a29c6da82ff7dc36fef2fe25196da58ad"},"schema_version":"1.0"},"canonical_sha256":"4a5095b92e562b7714b4442c3c8a3d0b1ab2d9ef0f56b205f1f6d021c3991109","source":{"kind":"arxiv","id":"0906.3215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3215","created_at":"2026-05-18T04:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3215v1","created_at":"2026-05-18T04:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3215","created_at":"2026-05-18T04:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"JJIJLOJOKYVX","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JJIJLOJOKYVXOFFU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JJIJLOJO","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:JJIJLOJOKYVXOFFUIQWDZCR5BM","target":"record","payload":{"canonical_record":{"source":{"id":"0906.3215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-06-17T15:29:16Z","cross_cats_sorted":[],"title_canon_sha256":"e759d267e5be03abca6f53666ce1ee292c4b348a96c0a94e25b187dcc2ef5ddd","abstract_canon_sha256":"ca00f3d53b7e821afb51dc1746bec38a29c6da82ff7dc36fef2fe25196da58ad"},"schema_version":"1.0"},"canonical_sha256":"4a5095b92e562b7714b4442c3c8a3d0b1ab2d9ef0f56b205f1f6d021c3991109","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:53.653172Z","signature_b64":"g6tIpLGPpEHePn1Dhgos0qyepYV1o6LSDKbulS5C6Wsahpt5Bt5PVXPhHrXzRGkSFKVPHYpRRtbJRa4ODEL3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5095b92e562b7714b4442c3c8a3d0b1ab2d9ef0f56b205f1f6d021c3991109","last_reissued_at":"2026-05-18T04:04:53.652620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:53.652620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.3215","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:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ag8HkrxNWSI+86DAdB7gxRqgeDMnNsksp385SrN1b8lykM0tQbJObBlhAbT6IjjSMHwm4sLGpwG7wrXy7mVeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:13:46.083631Z"},"content_sha256":"93daa4a50bd22c3681c7a40883b23233675fb93668d8264f6a14d57d88987ae6","schema_version":"1.0","event_id":"sha256:93daa4a50bd22c3681c7a40883b23233675fb93668d8264f6a14d57d88987ae6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:JJIJLOJOKYVXOFFUIQWDZCR5BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduction algorithm for the NPMLE for the distribution function of bivariate interval censored data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Marloes H. Maathuis","submitted_at":"2009-06-17T15:29:16Z","abstract_excerpt":"We study computational aspects of the nonparametric maximum likelihood estimator (NPMLE) for the distribution function of bivariate interval censored data. The computation of the NPMLE consists of two steps: a parameter reduction step and an optimization step. In this paper we focus on the reduction step. We introduce two new reduction algorithms: the Tree algorithm and the HeightMap algorithm. The Tree algorithm is only mentioned briefly. The HeightMap algorithm is discussed in detail and also given in pseudo code. It is a very fast and simple algorithm of time complexity O(n^2). This is an o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3215","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:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqs2ymCh0vnHiVr1mW53DjHChLM3hPcaicFwYnLcozNoLcyNhNg8G7ZUgpPW3D1Vqe/qn2LwDIjzOws/d7hyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:13:46.083971Z"},"content_sha256":"e44a5bb988ab3f140844694cc10d5e9823a2b8f4474b748e9ebf58718839e672","schema_version":"1.0","event_id":"sha256:e44a5bb988ab3f140844694cc10d5e9823a2b8f4474b748e9ebf58718839e672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM/bundle.json","state_url":"https://pith.science/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM/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-27T17:13:46Z","links":{"resolver":"https://pith.science/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM","bundle":"https://pith.science/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM/bundle.json","state":"https://pith.science/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJIJLOJOKYVXOFFUIQWDZCR5BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:JJIJLOJOKYVXOFFUIQWDZCR5BM","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":"ca00f3d53b7e821afb51dc1746bec38a29c6da82ff7dc36fef2fe25196da58ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-06-17T15:29:16Z","title_canon_sha256":"e759d267e5be03abca6f53666ce1ee292c4b348a96c0a94e25b187dcc2ef5ddd"},"schema_version":"1.0","source":{"id":"0906.3215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3215","created_at":"2026-05-18T04:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3215v1","created_at":"2026-05-18T04:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3215","created_at":"2026-05-18T04:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"JJIJLOJOKYVX","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JJIJLOJOKYVXOFFU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JJIJLOJO","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:e44a5bb988ab3f140844694cc10d5e9823a2b8f4474b748e9ebf58718839e672","target":"graph","created_at":"2026-05-18T04:04:53Z","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 study computational aspects of the nonparametric maximum likelihood estimator (NPMLE) for the distribution function of bivariate interval censored data. The computation of the NPMLE consists of two steps: a parameter reduction step and an optimization step. In this paper we focus on the reduction step. We introduce two new reduction algorithms: the Tree algorithm and the HeightMap algorithm. The Tree algorithm is only mentioned briefly. The HeightMap algorithm is discussed in detail and also given in pseudo code. It is a very fast and simple algorithm of time complexity O(n^2). This is an o","authors_text":"Marloes H. Maathuis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-06-17T15:29:16Z","title":"Reduction algorithm for the NPMLE for the distribution function of bivariate interval censored data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3215","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:93daa4a50bd22c3681c7a40883b23233675fb93668d8264f6a14d57d88987ae6","target":"record","created_at":"2026-05-18T04:04:53Z","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":"ca00f3d53b7e821afb51dc1746bec38a29c6da82ff7dc36fef2fe25196da58ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-06-17T15:29:16Z","title_canon_sha256":"e759d267e5be03abca6f53666ce1ee292c4b348a96c0a94e25b187dcc2ef5ddd"},"schema_version":"1.0","source":{"id":"0906.3215","kind":"arxiv","version":1}},"canonical_sha256":"4a5095b92e562b7714b4442c3c8a3d0b1ab2d9ef0f56b205f1f6d021c3991109","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a5095b92e562b7714b4442c3c8a3d0b1ab2d9ef0f56b205f1f6d021c3991109","first_computed_at":"2026-05-18T04:04:53.652620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:53.652620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g6tIpLGPpEHePn1Dhgos0qyepYV1o6LSDKbulS5C6Wsahpt5Bt5PVXPhHrXzRGkSFKVPHYpRRtbJRa4ODEL3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:53.653172Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.3215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93daa4a50bd22c3681c7a40883b23233675fb93668d8264f6a14d57d88987ae6","sha256:e44a5bb988ab3f140844694cc10d5e9823a2b8f4474b748e9ebf58718839e672"],"state_sha256":"47312f16c9a444be3d8580c03560bf0b28ef31f6770e245f91ee6b2b4cbd18d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnsNjoY7I8ULQlQ+wxuI3wcy9zF0TBlo0JYJZqW0BLeLy8+8nTQKseamyZxcz9STFYN9pi9bNdQjxGQMtDCUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:13:46.086276Z","bundle_sha256":"e98e43220b688196a378b3741d707ec5549a8681b049bfa5870067fccdb47b18"}}