{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XVMTLQSBTAMDSRYD5JHCSNDKEC","short_pith_number":"pith:XVMTLQSB","canonical_record":{"source":{"id":"1505.03350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-13T12:11:11Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"11990906ea9db3832b203996f096991c65a9fb096260bdbe98b4a14e80afd015","abstract_canon_sha256":"5597556d32251bdb9bc8b2b3d1fd9ed4c95eb58ef46cef45835846a01c31a3f0"},"schema_version":"1.0"},"canonical_sha256":"bd5935c2419818394703ea4e29346a20bd1f0f44bd2ee51a2c9ecfaf684fd7ae","source":{"kind":"arxiv","id":"1505.03350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03350","created_at":"2026-05-18T02:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03350v1","created_at":"2026-05-18T02:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03350","created_at":"2026-05-18T02:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"XVMTLQSBTAMD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XVMTLQSBTAMDSRYD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XVMTLQSB","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XVMTLQSBTAMDSRYD5JHCSNDKEC","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-13T12:11:11Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"11990906ea9db3832b203996f096991c65a9fb096260bdbe98b4a14e80afd015","abstract_canon_sha256":"5597556d32251bdb9bc8b2b3d1fd9ed4c95eb58ef46cef45835846a01c31a3f0"},"schema_version":"1.0"},"canonical_sha256":"bd5935c2419818394703ea4e29346a20bd1f0f44bd2ee51a2c9ecfaf684fd7ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:09.473459Z","signature_b64":"G4guJmBv57ho27Hls6gWmZCvP7aumNPsYi4l9yaq4CrR4Zh/s/39bTBJmMwQywQ1XamgDRp8CXxKZQtuPyPkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd5935c2419818394703ea4e29346a20bd1f0f44bd2ee51a2c9ecfaf684fd7ae","last_reissued_at":"2026-05-18T02:12:09.472654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:09.472654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03350","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:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oaDR1NbZf3RNl/ZHo3ZA+ITbekiNtISzh80RcVX7RAj/xnQUiSuwRrJTpr7r4p8CegalAjwln1fb/++cbX49CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:19:09.587861Z"},"content_sha256":"09829a3747fa7c71f99c619e52bb017335d14043a2f80d5c3801d9324a116739","schema_version":"1.0","event_id":"sha256:09829a3747fa7c71f99c619e52bb017335d14043a2f80d5c3801d9324a116739"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XVMTLQSBTAMDSRYD5JHCSNDKEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Bayesian Computation by Modelling Summary Statistics in a Quasi-likelihood Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Erlis Ruli, Maria Eugenia Castellanos Nueda, Stefano Cabras","submitted_at":"2015-05-13T12:11:11Z","abstract_excerpt":"Approximate Bayesian Computation (ABC) is a useful class of methods for Bayesian inference when the likelihood function is computationally intractable. In practice, the basic ABC algorithm may be inefficient in the presence of discrepancy between prior and posterior. Therefore, more elaborate methods, such as ABC with the Markov chain Monte Carlo algorithm (ABC-MCMC), should be used. However, the elaboration of a proposal density for MCMC is a sensitive issue and very difficult in the ABC setting, where the likelihood is intractable. We discuss an automatic proposal distribution useful for ABC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03350","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:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRByM8nLV51pedSh/GpxnRowfr4AqVkuq1jvnY7L0zezOj0q6YEQq0mXXg+epXhlxdaZ9bO/AE26mtjctLqsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:19:09.588196Z"},"content_sha256":"607b289c85d97da9429fcd6e0391937c152d64f94b833549c1db3585735a9ebb","schema_version":"1.0","event_id":"sha256:607b289c85d97da9429fcd6e0391937c152d64f94b833549c1db3585735a9ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC/bundle.json","state_url":"https://pith.science/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC/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-24T19:19:09Z","links":{"resolver":"https://pith.science/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC","bundle":"https://pith.science/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC/bundle.json","state":"https://pith.science/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVMTLQSBTAMDSRYD5JHCSNDKEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XVMTLQSBTAMDSRYD5JHCSNDKEC","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":"5597556d32251bdb9bc8b2b3d1fd9ed4c95eb58ef46cef45835846a01c31a3f0","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-13T12:11:11Z","title_canon_sha256":"11990906ea9db3832b203996f096991c65a9fb096260bdbe98b4a14e80afd015"},"schema_version":"1.0","source":{"id":"1505.03350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03350","created_at":"2026-05-18T02:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03350v1","created_at":"2026-05-18T02:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03350","created_at":"2026-05-18T02:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"XVMTLQSBTAMD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XVMTLQSBTAMDSRYD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XVMTLQSB","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:607b289c85d97da9429fcd6e0391937c152d64f94b833549c1db3585735a9ebb","target":"graph","created_at":"2026-05-18T02:12:09Z","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) is a useful class of methods for Bayesian inference when the likelihood function is computationally intractable. In practice, the basic ABC algorithm may be inefficient in the presence of discrepancy between prior and posterior. Therefore, more elaborate methods, such as ABC with the Markov chain Monte Carlo algorithm (ABC-MCMC), should be used. However, the elaboration of a proposal density for MCMC is a sensitive issue and very difficult in the ABC setting, where the likelihood is intractable. We discuss an automatic proposal distribution useful for ABC","authors_text":"Erlis Ruli, Maria Eugenia Castellanos Nueda, Stefano Cabras","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-13T12:11:11Z","title":"Approximate Bayesian Computation by Modelling Summary Statistics in a Quasi-likelihood Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03350","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:09829a3747fa7c71f99c619e52bb017335d14043a2f80d5c3801d9324a116739","target":"record","created_at":"2026-05-18T02:12:09Z","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":"5597556d32251bdb9bc8b2b3d1fd9ed4c95eb58ef46cef45835846a01c31a3f0","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-13T12:11:11Z","title_canon_sha256":"11990906ea9db3832b203996f096991c65a9fb096260bdbe98b4a14e80afd015"},"schema_version":"1.0","source":{"id":"1505.03350","kind":"arxiv","version":1}},"canonical_sha256":"bd5935c2419818394703ea4e29346a20bd1f0f44bd2ee51a2c9ecfaf684fd7ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd5935c2419818394703ea4e29346a20bd1f0f44bd2ee51a2c9ecfaf684fd7ae","first_computed_at":"2026-05-18T02:12:09.472654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:09.472654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G4guJmBv57ho27Hls6gWmZCvP7aumNPsYi4l9yaq4CrR4Zh/s/39bTBJmMwQywQ1XamgDRp8CXxKZQtuPyPkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:09.473459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09829a3747fa7c71f99c619e52bb017335d14043a2f80d5c3801d9324a116739","sha256:607b289c85d97da9429fcd6e0391937c152d64f94b833549c1db3585735a9ebb"],"state_sha256":"dcf80cf3849f7202e79033c417f8ab656d3b8d3cdbe7764fe075ab307c6d39ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSM2xVzNKKXt2EAwdkiJ1GhumEYnqPIrpiKwgBnAiKpVvag10v5+XvO5abFKTuzceQzxEd9bsN0YvjPvWuEwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:19:09.590104Z","bundle_sha256":"c0a3a8924565d587773afd2b58a7e480b654a4cf96fc817378204d90de0565e6"}}