{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U5NQHZWFK33QI3XHD7NC5XB6UB","short_pith_number":"pith:U5NQHZWF","canonical_record":{"source":{"id":"1301.3833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:48:42Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"aa1af7eecb790c5464f1ebe2ddfded5c336f6b66800c1163d0cbfe6350481056","abstract_canon_sha256":"5a95c9b0cbeff277afd623611eaeeb6fe7fe1aa248afb119afb9c530651f14e6"},"schema_version":"1.0"},"canonical_sha256":"a75b03e6c556f7046ee71fda2edc3ea068d353a08444b19ac72664d56fe23ef7","source":{"kind":"arxiv","id":"1301.3833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3833","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3833v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3833","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"U5NQHZWFK33Q","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U5NQHZWFK33QI3XH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U5NQHZWF","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U5NQHZWFK33QI3XHD7NC5XB6UB","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:48:42Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"aa1af7eecb790c5464f1ebe2ddfded5c336f6b66800c1163d0cbfe6350481056","abstract_canon_sha256":"5a95c9b0cbeff277afd623611eaeeb6fe7fe1aa248afb119afb9c530651f14e6"},"schema_version":"1.0"},"canonical_sha256":"a75b03e6c556f7046ee71fda2edc3ea068d353a08444b19ac72664d56fe23ef7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.524628Z","signature_b64":"dwl2euIn0kL1/o6wJWR8eSHe+DfhpoymVWLB6RpoPn3D9eIQCo+q4zvyzeOkgZAYIa9sOf6czenuvCTVYubLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75b03e6c556f7046ee71fda2edc3ea068d353a08444b19ac72664d56fe23ef7","last_reissued_at":"2026-05-18T03:36:15.524047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.524047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3833","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:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JHItiYfo+SXk7mspf8hd8ErX8Bj9e1uiWDVkG5GVlP1rmXtEtvG1WkikP2v9MoHzqnFjDxuD8HABabjmrVAODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:44:42.904679Z"},"content_sha256":"2f2917d8e1e5c4297979bdac01bd47d94d72451f8374c230cd3f8206003f9540","schema_version":"1.0","event_id":"sha256:2f2917d8e1e5c4297979bdac01bd47d94d72451f8374c230cd3f8206003f9540"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U5NQHZWFK33QI3XHD7NC5XB6UB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reversible Jump MCMC Simulated Annealing for Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arnaud Doucet, Christophe Andrieu, Nando de Freitas","submitted_at":"2013-01-16T15:48:42Z","abstract_excerpt":"We propose a novel reversible jump Markov chain Monte Carlo (MCMC) simulated annealing algorithm to optimize radial basis function (RBF) networks. This algorithm enables us to maximize the joint posterior distribution of the network parameters and the number of basis functions. It performs a global search in the joint space of the parameters and number of parameters, thereby surmounting the problem of local minima. We also show that by calibrating a Bayesian model, we can obtain the classical AIC, BIC and MDL model selection criteria within a penalized likelihood framework. Finally, we show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3833","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:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOqeiHWN/x79PuWA0V07jGy33UhOwy162LJM/NhzF+dkwcE2RBuFo+nq+YEBy44Hsc8VJFQKJR6LINqsucJ0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:44:42.905033Z"},"content_sha256":"a8928f25ac91b047d228c700199a916cd7884f05de0328b8dcb7c8d673b92e0c","schema_version":"1.0","event_id":"sha256:a8928f25ac91b047d228c700199a916cd7884f05de0328b8dcb7c8d673b92e0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5NQHZWFK33QI3XHD7NC5XB6UB/bundle.json","state_url":"https://pith.science/pith/U5NQHZWFK33QI3XHD7NC5XB6UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5NQHZWFK33QI3XHD7NC5XB6UB/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-07T08:44:42Z","links":{"resolver":"https://pith.science/pith/U5NQHZWFK33QI3XHD7NC5XB6UB","bundle":"https://pith.science/pith/U5NQHZWFK33QI3XHD7NC5XB6UB/bundle.json","state":"https://pith.science/pith/U5NQHZWFK33QI3XHD7NC5XB6UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5NQHZWFK33QI3XHD7NC5XB6UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U5NQHZWFK33QI3XHD7NC5XB6UB","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":"5a95c9b0cbeff277afd623611eaeeb6fe7fe1aa248afb119afb9c530651f14e6","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:48:42Z","title_canon_sha256":"aa1af7eecb790c5464f1ebe2ddfded5c336f6b66800c1163d0cbfe6350481056"},"schema_version":"1.0","source":{"id":"1301.3833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3833","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3833v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3833","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"U5NQHZWFK33Q","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U5NQHZWFK33QI3XH","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U5NQHZWF","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:a8928f25ac91b047d228c700199a916cd7884f05de0328b8dcb7c8d673b92e0c","target":"graph","created_at":"2026-05-18T03:36:15Z","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 propose a novel reversible jump Markov chain Monte Carlo (MCMC) simulated annealing algorithm to optimize radial basis function (RBF) networks. This algorithm enables us to maximize the joint posterior distribution of the network parameters and the number of basis functions. It performs a global search in the joint space of the parameters and number of parameters, thereby surmounting the problem of local minima. We also show that by calibrating a Bayesian model, we can obtain the classical AIC, BIC and MDL model selection criteria within a penalized likelihood framework. Finally, we show th","authors_text":"Arnaud Doucet, Christophe Andrieu, Nando de Freitas","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:48:42Z","title":"Reversible Jump MCMC Simulated Annealing for Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3833","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:2f2917d8e1e5c4297979bdac01bd47d94d72451f8374c230cd3f8206003f9540","target":"record","created_at":"2026-05-18T03:36:15Z","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":"5a95c9b0cbeff277afd623611eaeeb6fe7fe1aa248afb119afb9c530651f14e6","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:48:42Z","title_canon_sha256":"aa1af7eecb790c5464f1ebe2ddfded5c336f6b66800c1163d0cbfe6350481056"},"schema_version":"1.0","source":{"id":"1301.3833","kind":"arxiv","version":1}},"canonical_sha256":"a75b03e6c556f7046ee71fda2edc3ea068d353a08444b19ac72664d56fe23ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a75b03e6c556f7046ee71fda2edc3ea068d353a08444b19ac72664d56fe23ef7","first_computed_at":"2026-05-18T03:36:15.524047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:15.524047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dwl2euIn0kL1/o6wJWR8eSHe+DfhpoymVWLB6RpoPn3D9eIQCo+q4zvyzeOkgZAYIa9sOf6czenuvCTVYubLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:15.524628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f2917d8e1e5c4297979bdac01bd47d94d72451f8374c230cd3f8206003f9540","sha256:a8928f25ac91b047d228c700199a916cd7884f05de0328b8dcb7c8d673b92e0c"],"state_sha256":"0bd3b29e15e1bb365f64f3370590e9ed142a1740cfa66ca736c1983cd087ab1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NapOwpLifvNXJ2sW6BQGrQZ2+X6bPmtNSQSBnsxsyKK+PfbzYeSVheyMAhZcirXxyR9u7EQlwwNWPkS4pVOJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:44:42.908370Z","bundle_sha256":"f6e84096403511dab09db73e8252a5157d293a88d19cf18ccf43b36dc9fda517"}}