{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PDD3BYRD4WVMAEDXZCFCBCKTMC","short_pith_number":"pith:PDD3BYRD","canonical_record":{"source":{"id":"1409.0606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-02T04:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"376ceeafc944a41061962b295aad1b207ad59c8579381fc5a34fc0c1ed08f303","abstract_canon_sha256":"e649360a03619721fc7d0256ee905a4aadb3380de514305700c9564709e6d07a"},"schema_version":"1.0"},"canonical_sha256":"78c7b0e223e5aac01077c88a20895360973bac4b971aced10f9f674fb9f1be03","source":{"kind":"arxiv","id":"1409.0606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0606","created_at":"2026-05-18T01:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0606v1","created_at":"2026-05-18T01:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0606","created_at":"2026-05-18T01:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"PDD3BYRD4WVM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDD3BYRD4WVMAEDX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDD3BYRD","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PDD3BYRD4WVMAEDXZCFCBCKTMC","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-02T04:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"376ceeafc944a41061962b295aad1b207ad59c8579381fc5a34fc0c1ed08f303","abstract_canon_sha256":"e649360a03619721fc7d0256ee905a4aadb3380de514305700c9564709e6d07a"},"schema_version":"1.0"},"canonical_sha256":"78c7b0e223e5aac01077c88a20895360973bac4b971aced10f9f674fb9f1be03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:10.968282Z","signature_b64":"CvenjEj6T7o6epwCWo/RhovohNoPU5fnUlsW3RXRGS1g8CwQMGoowY2LKq5Vr3Qkxg4HUM4M+qd7u97ab6k2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c7b0e223e5aac01077c88a20895360973bac4b971aced10f9f674fb9f1be03","last_reissued_at":"2026-05-18T01:42:10.967785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:10.967785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0606","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-18T01:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yW/8USaS5UYlW1M2KavUMWV7R3uh2XiP9txww6ZIQNSL/NntSpzO+ONEZZuMfonZhDgPiCnelWXlzb/0YwmkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:43:52.758635Z"},"content_sha256":"90302238a1a5b9333fdb4f6b8d3885d1f185049d61f2503cb51357a7b170a49f","schema_version":"1.0","event_id":"sha256:90302238a1a5b9333fdb4f6b8d3885d1f185049d61f2503cb51357a7b170a49f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PDD3BYRD4WVMAEDXZCFCBCKTMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Gaussian Sampling for Solving Large-Scale Inverse Problems using MCMC Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Cl\\'ement Gilavert, J\\'er\\^ome Idier, Sa\\\"id Moussaoui","submitted_at":"2014-09-02T04:23:20Z","abstract_excerpt":"The resolution of many large-scale inverse problems using MCMC methods requires a step of drawing samples from a high dimensional Gaussian distribution. While direct Gaussian sampling techniques, such as those based on Cholesky factorization, induce an excessive numerical complexity and memory requirement, sequential coordinate sampling methods present a low rate of convergence. Based on the reversible jump Markov chain framework, this paper proposes an efficient Gaussian sampling algorithm having a reduced computation cost and memory usage. The main feature of the algorithm is to perform an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0606","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-18T01:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4WdKSIlsgmoiIo7r4L2yQNap9fz1GWqQvy79yhHYik23Pjd0DjsBPEShZhVFVP5o1txb8b3w3ZA5bOuj4NjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:43:52.759288Z"},"content_sha256":"b18001e8ae064bbd72645848f5169464c166cf5a4ab531d33dd06bfd32e6cca6","schema_version":"1.0","event_id":"sha256:b18001e8ae064bbd72645848f5169464c166cf5a4ab531d33dd06bfd32e6cca6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC/bundle.json","state_url":"https://pith.science/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC/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-31T00:43:52Z","links":{"resolver":"https://pith.science/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC","bundle":"https://pith.science/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC/bundle.json","state":"https://pith.science/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDD3BYRD4WVMAEDXZCFCBCKTMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PDD3BYRD4WVMAEDXZCFCBCKTMC","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":"e649360a03619721fc7d0256ee905a4aadb3380de514305700c9564709e6d07a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-02T04:23:20Z","title_canon_sha256":"376ceeafc944a41061962b295aad1b207ad59c8579381fc5a34fc0c1ed08f303"},"schema_version":"1.0","source":{"id":"1409.0606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0606","created_at":"2026-05-18T01:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0606v1","created_at":"2026-05-18T01:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0606","created_at":"2026-05-18T01:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"PDD3BYRD4WVM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDD3BYRD4WVMAEDX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDD3BYRD","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b18001e8ae064bbd72645848f5169464c166cf5a4ab531d33dd06bfd32e6cca6","target":"graph","created_at":"2026-05-18T01:42:10Z","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":"The resolution of many large-scale inverse problems using MCMC methods requires a step of drawing samples from a high dimensional Gaussian distribution. While direct Gaussian sampling techniques, such as those based on Cholesky factorization, induce an excessive numerical complexity and memory requirement, sequential coordinate sampling methods present a low rate of convergence. Based on the reversible jump Markov chain framework, this paper proposes an efficient Gaussian sampling algorithm having a reduced computation cost and memory usage. The main feature of the algorithm is to perform an a","authors_text":"Cl\\'ement Gilavert, J\\'er\\^ome Idier, Sa\\\"id Moussaoui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-02T04:23:20Z","title":"Efficient Gaussian Sampling for Solving Large-Scale Inverse Problems using MCMC Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0606","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:90302238a1a5b9333fdb4f6b8d3885d1f185049d61f2503cb51357a7b170a49f","target":"record","created_at":"2026-05-18T01:42:10Z","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":"e649360a03619721fc7d0256ee905a4aadb3380de514305700c9564709e6d07a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-02T04:23:20Z","title_canon_sha256":"376ceeafc944a41061962b295aad1b207ad59c8579381fc5a34fc0c1ed08f303"},"schema_version":"1.0","source":{"id":"1409.0606","kind":"arxiv","version":1}},"canonical_sha256":"78c7b0e223e5aac01077c88a20895360973bac4b971aced10f9f674fb9f1be03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78c7b0e223e5aac01077c88a20895360973bac4b971aced10f9f674fb9f1be03","first_computed_at":"2026-05-18T01:42:10.967785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:10.967785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CvenjEj6T7o6epwCWo/RhovohNoPU5fnUlsW3RXRGS1g8CwQMGoowY2LKq5Vr3Qkxg4HUM4M+qd7u97ab6k2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:10.968282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90302238a1a5b9333fdb4f6b8d3885d1f185049d61f2503cb51357a7b170a49f","sha256:b18001e8ae064bbd72645848f5169464c166cf5a4ab531d33dd06bfd32e6cca6"],"state_sha256":"96d9ec08319e8821c8f6b7376634a2012edc94de06975aacdbd89207374b50fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWBSmBKlAYvETDIXHmog5htaRml08GdnM6Nybt2joVf9GJTLHBebQx4lBITffS8gZZScnMOifvezhMOvs2QNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:43:52.762591Z","bundle_sha256":"6b1d72509376baa5bece1b2d7f0ac5587bcd7e4940b747a59107c67991293641"}}