{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C4L47FYHAGOAXE6MQK62K2FC36","short_pith_number":"pith:C4L47FYH","canonical_record":{"source":{"id":"1406.6288","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-24T16:03:32Z","cross_cats_sorted":["q-bio.PE","stat.CO","stat.ME"],"title_canon_sha256":"c6aef5ba7794aba6ba84921412785426840519382849d2870d18291fa9f66b9a","abstract_canon_sha256":"f3f59cf15bf880a65afd71b43f027bc9d14ebed20981a7ec3d32c15471360e0d"},"schema_version":"1.0"},"canonical_sha256":"1717cf9707019c0b93cc82bda568a2dface9d72ffe9e5d3d8ed19f6c8b0da215","source":{"kind":"arxiv","id":"1406.6288","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6288","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6288v3","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6288","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"C4L47FYHAGOA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C4L47FYHAGOAXE6M","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C4L47FYH","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C4L47FYHAGOAXE6MQK62K2FC36","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6288","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-24T16:03:32Z","cross_cats_sorted":["q-bio.PE","stat.CO","stat.ME"],"title_canon_sha256":"c6aef5ba7794aba6ba84921412785426840519382849d2870d18291fa9f66b9a","abstract_canon_sha256":"f3f59cf15bf880a65afd71b43f027bc9d14ebed20981a7ec3d32c15471360e0d"},"schema_version":"1.0"},"canonical_sha256":"1717cf9707019c0b93cc82bda568a2dface9d72ffe9e5d3d8ed19f6c8b0da215","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.477505Z","signature_b64":"tFYGnv3XTY4pWiRu1z/8ETUsRdUT5BDDOgHR0ws4RkF4/PqMh98LNxiwIrPUnk74koN4ylyRwOYRCS9N/r62Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1717cf9707019c0b93cc82bda568a2dface9d72ffe9e5d3d8ed19f6c8b0da215","last_reissued_at":"2026-05-18T01:34:13.476792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.476792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6288","source_version":3,"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WD0X8EmsAzY+4Qxv0c2eIib1jxykhC72jcXwC/RAQsDPC5It8Jq6ilXDkphfe1ezuORGN+BGse8uvmWFbfZPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:46:41.766506Z"},"content_sha256":"621f46c46f623ba02c46bc52f9d86ce771828060984c211e251712880adb6bdb","schema_version":"1.0","event_id":"sha256:621f46c46f623ba02c46bc52f9d86ce771828060984c211e251712880adb6bdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C4L47FYHAGOAXE6MQK62K2FC36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable ABC model choice via random forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Arnaud Estoup, Christian P. Robert (Universite Paris-Dauphine, IBC, INRA, Jean-Marie Cornuet, Jean-Michel Marin (IMAG, Mathieu Gautier (CBGP, Montpellier), Pierre Pudlo, Universite de Montpellier), University of Warwick)","submitted_at":"2014-06-24T16:03:32Z","abstract_excerpt":"Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian inference on complex models, including model choice. Both theoretical arguments and simulation experiments indicate, however, that model posterior probabilities may be poorly evaluated by standard ABC techniques. We propose a novel approach based on a machine learning tool named random forests to conduct selection among the highly complex models covered by ABC algorithms. We thus modify the way Bayesian model selection is both understood and operated, in that we rephrase the inferential goal as a classific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6288","kind":"arxiv","version":3},"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2K87OhAUgow3JU893XLUMadUHUc46Iq9aCaJoFcp9SUuVrHogFKJcZk4q/nfOp9btm51T5eQ8wo1hOG0cvNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:46:41.767183Z"},"content_sha256":"37c58af609ad242017d24ef07b55723f26da0d8c636d40fe308c7912bb316cbc","schema_version":"1.0","event_id":"sha256:37c58af609ad242017d24ef07b55723f26da0d8c636d40fe308c7912bb316cbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4L47FYHAGOAXE6MQK62K2FC36/bundle.json","state_url":"https://pith.science/pith/C4L47FYHAGOAXE6MQK62K2FC36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4L47FYHAGOAXE6MQK62K2FC36/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-05T01:46:41Z","links":{"resolver":"https://pith.science/pith/C4L47FYHAGOAXE6MQK62K2FC36","bundle":"https://pith.science/pith/C4L47FYHAGOAXE6MQK62K2FC36/bundle.json","state":"https://pith.science/pith/C4L47FYHAGOAXE6MQK62K2FC36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4L47FYHAGOAXE6MQK62K2FC36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C4L47FYHAGOAXE6MQK62K2FC36","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":"f3f59cf15bf880a65afd71b43f027bc9d14ebed20981a7ec3d32c15471360e0d","cross_cats_sorted":["q-bio.PE","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-24T16:03:32Z","title_canon_sha256":"c6aef5ba7794aba6ba84921412785426840519382849d2870d18291fa9f66b9a"},"schema_version":"1.0","source":{"id":"1406.6288","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6288","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6288v3","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6288","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"C4L47FYHAGOA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C4L47FYHAGOAXE6M","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C4L47FYH","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:37c58af609ad242017d24ef07b55723f26da0d8c636d40fe308c7912bb316cbc","target":"graph","created_at":"2026-05-18T01:34:13Z","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":"Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian inference on complex models, including model choice. Both theoretical arguments and simulation experiments indicate, however, that model posterior probabilities may be poorly evaluated by standard ABC techniques. We propose a novel approach based on a machine learning tool named random forests to conduct selection among the highly complex models covered by ABC algorithms. We thus modify the way Bayesian model selection is both understood and operated, in that we rephrase the inferential goal as a classific","authors_text":"Arnaud Estoup, Christian P. Robert (Universite Paris-Dauphine, IBC, INRA, Jean-Marie Cornuet, Jean-Michel Marin (IMAG, Mathieu Gautier (CBGP, Montpellier), Pierre Pudlo, Universite de Montpellier), University of Warwick)","cross_cats":["q-bio.PE","stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-24T16:03:32Z","title":"Reliable ABC model choice via random forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6288","kind":"arxiv","version":3},"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:621f46c46f623ba02c46bc52f9d86ce771828060984c211e251712880adb6bdb","target":"record","created_at":"2026-05-18T01:34:13Z","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":"f3f59cf15bf880a65afd71b43f027bc9d14ebed20981a7ec3d32c15471360e0d","cross_cats_sorted":["q-bio.PE","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-24T16:03:32Z","title_canon_sha256":"c6aef5ba7794aba6ba84921412785426840519382849d2870d18291fa9f66b9a"},"schema_version":"1.0","source":{"id":"1406.6288","kind":"arxiv","version":3}},"canonical_sha256":"1717cf9707019c0b93cc82bda568a2dface9d72ffe9e5d3d8ed19f6c8b0da215","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1717cf9707019c0b93cc82bda568a2dface9d72ffe9e5d3d8ed19f6c8b0da215","first_computed_at":"2026-05-18T01:34:13.476792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:13.476792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFYGnv3XTY4pWiRu1z/8ETUsRdUT5BDDOgHR0ws4RkF4/PqMh98LNxiwIrPUnk74koN4ylyRwOYRCS9N/r62Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:13.477505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6288","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:621f46c46f623ba02c46bc52f9d86ce771828060984c211e251712880adb6bdb","sha256:37c58af609ad242017d24ef07b55723f26da0d8c636d40fe308c7912bb316cbc"],"state_sha256":"08051ea7415e1c76b4306ff6e51ceadf16b6c45b79517d5e2a57c6a4a9383504"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlDaUqEPJ3WL8CK5PRi4DoDSTcbm1jyHZMfpQNZ3xR1rc7ctzGSk6mmChrSAO/oiw/k+upY3fq3bzdXY8a/6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:46:41.770882Z","bundle_sha256":"ffd77a9c5570ddafdb887e14a3fb393faf9d77b4c169cce7d4b3a3048c750632"}}