{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DO3H35X56THJJTEDH5HXULA7TT","short_pith_number":"pith:DO3H35X5","canonical_record":{"source":{"id":"1009.5103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-26T15:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"4d785d4732352281337e9c1e4a9497b107ae2b27f25e1942e2b9bc7b6ea4f39f","abstract_canon_sha256":"3f8306e219aa620bacd3fc14ad72aaa36087eb5d0eccf2c4e45a26208b205412"},"schema_version":"1.0"},"canonical_sha256":"1bb67df6fdf4ce94cc833f4f7a2c1f9cf03186df7445ea88a95d8dec0bade30f","source":{"kind":"arxiv","id":"1009.5103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5103","created_at":"2026-05-18T02:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5103v1","created_at":"2026-05-18T02:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5103","created_at":"2026-05-18T02:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"DO3H35X56THJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DO3H35X56THJJTED","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DO3H35X5","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DO3H35X56THJJTEDH5HXULA7TT","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-26T15:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"4d785d4732352281337e9c1e4a9497b107ae2b27f25e1942e2b9bc7b6ea4f39f","abstract_canon_sha256":"3f8306e219aa620bacd3fc14ad72aaa36087eb5d0eccf2c4e45a26208b205412"},"schema_version":"1.0"},"canonical_sha256":"1bb67df6fdf4ce94cc833f4f7a2c1f9cf03186df7445ea88a95d8dec0bade30f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:17.156498Z","signature_b64":"iuJiJwEFX4v4IDAlSt7FUCDDAjUyl5A35fNY7M+Ntj1RqVJMfQZhuDKrJS+ylm62qBztycSAlMG/eyaJbigfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb67df6fdf4ce94cc833f4f7a2c1f9cf03186df7445ea88a95d8dec0bade30f","last_reissued_at":"2026-05-18T02:05:17.155748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:17.155748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5103","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-18T02:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMMVrwaXi4zWOOjgS5trvh3tkZSoOppdi8uFvwRuPHJWxlO+jr4RPZSltk++3tEUyTGylLA17b5hutJ3BiEJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:43.207028Z"},"content_sha256":"6143eb008ad420a1617847c2ae7b0c6b1d4d9fea2427a246d1394fe876e13027","schema_version":"1.0","event_id":"sha256:6143eb008ad420a1617847c2ae7b0c6b1d4d9fea2427a246d1394fe876e13027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DO3H35X56THJJTEDH5HXULA7TT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Time Machine: A Simulation Approach for Stochastic Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Marc Chadeau-Hyam, Maria De Iorio","submitted_at":"2010-09-26T15:40:21Z","abstract_excerpt":"In the following paper we consider a simulation technique for stochastic trees. One of the most important areas in computational genetics is the calculation and subsequent maximization of the likelihood function associated to such models. This typically consists of using importance sampling (IS) and sequential Monte Carlo (SMC) techniques. The approach proceeds by simulating the tree, backward in time from observed data, to a most recent common ancestor (MRCA). However, in many cases, the computational time and variance of estimators are often too high to make standard approaches useful. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5103","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-18T02:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzyPBg6SmSuBLLTuIBnw1OnPJ9+IDhywghFYYVFl3NAD+2FGtxKRVKiWUFJzBJ73si053kxOo+urtF9HJ9u6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:43.207689Z"},"content_sha256":"701057509745a4ab5aa891993939c6bf156896d8082e2f7e2e943b78f93bcdb6","schema_version":"1.0","event_id":"sha256:701057509745a4ab5aa891993939c6bf156896d8082e2f7e2e943b78f93bcdb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO3H35X56THJJTEDH5HXULA7TT/bundle.json","state_url":"https://pith.science/pith/DO3H35X56THJJTEDH5HXULA7TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO3H35X56THJJTEDH5HXULA7TT/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-28T18:15:43Z","links":{"resolver":"https://pith.science/pith/DO3H35X56THJJTEDH5HXULA7TT","bundle":"https://pith.science/pith/DO3H35X56THJJTEDH5HXULA7TT/bundle.json","state":"https://pith.science/pith/DO3H35X56THJJTEDH5HXULA7TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO3H35X56THJJTEDH5HXULA7TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DO3H35X56THJJTEDH5HXULA7TT","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":"3f8306e219aa620bacd3fc14ad72aaa36087eb5d0eccf2c4e45a26208b205412","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-26T15:40:21Z","title_canon_sha256":"4d785d4732352281337e9c1e4a9497b107ae2b27f25e1942e2b9bc7b6ea4f39f"},"schema_version":"1.0","source":{"id":"1009.5103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5103","created_at":"2026-05-18T02:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5103v1","created_at":"2026-05-18T02:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5103","created_at":"2026-05-18T02:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"DO3H35X56THJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DO3H35X56THJJTED","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DO3H35X5","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:701057509745a4ab5aa891993939c6bf156896d8082e2f7e2e943b78f93bcdb6","target":"graph","created_at":"2026-05-18T02:05:17Z","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":"In the following paper we consider a simulation technique for stochastic trees. One of the most important areas in computational genetics is the calculation and subsequent maximization of the likelihood function associated to such models. This typically consists of using importance sampling (IS) and sequential Monte Carlo (SMC) techniques. The approach proceeds by simulating the tree, backward in time from observed data, to a most recent common ancestor (MRCA). However, in many cases, the computational time and variance of estimators are often too high to make standard approaches useful. In th","authors_text":"Ajay Jasra, Marc Chadeau-Hyam, Maria De Iorio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-26T15:40:21Z","title":"The Time Machine: A Simulation Approach for Stochastic Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5103","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:6143eb008ad420a1617847c2ae7b0c6b1d4d9fea2427a246d1394fe876e13027","target":"record","created_at":"2026-05-18T02:05:17Z","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":"3f8306e219aa620bacd3fc14ad72aaa36087eb5d0eccf2c4e45a26208b205412","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-26T15:40:21Z","title_canon_sha256":"4d785d4732352281337e9c1e4a9497b107ae2b27f25e1942e2b9bc7b6ea4f39f"},"schema_version":"1.0","source":{"id":"1009.5103","kind":"arxiv","version":1}},"canonical_sha256":"1bb67df6fdf4ce94cc833f4f7a2c1f9cf03186df7445ea88a95d8dec0bade30f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bb67df6fdf4ce94cc833f4f7a2c1f9cf03186df7445ea88a95d8dec0bade30f","first_computed_at":"2026-05-18T02:05:17.155748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:17.155748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iuJiJwEFX4v4IDAlSt7FUCDDAjUyl5A35fNY7M+Ntj1RqVJMfQZhuDKrJS+ylm62qBztycSAlMG/eyaJbigfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:17.156498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6143eb008ad420a1617847c2ae7b0c6b1d4d9fea2427a246d1394fe876e13027","sha256:701057509745a4ab5aa891993939c6bf156896d8082e2f7e2e943b78f93bcdb6"],"state_sha256":"7e1fc1a823bb5af880eed138075ae060a77c5567b9172f2095b0d82de555dc82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1Uk+G73Wq3pOthgD0N1S0rEznsL2iKxOF97rK4l4wacDmdeThf78DppDKUkMtOWwqSNJpJ7dMM5g5hV1JTkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:15:43.211365Z","bundle_sha256":"b638720ce2dee860d5760afb18f9007f9fb430fbfa54bae1a74f885639c4e6bb"}}