{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6UF7P2A2VYMUNDZLIC5ZWCL4HM","short_pith_number":"pith:6UF7P2A2","schema_version":"1.0","canonical_sha256":"f50bf7e81aae19468f2b40bb9b097c3b3cae4227a5aec30a77b0fd04848e5dff","source":{"kind":"arxiv","id":"1912.02382","version":2},"attestation_state":"computed","paper":{"title":"PICAR: An Efficient Extendable Approach for Fitting Hierarchical Spatial Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ben Seiyon Lee, Murali Haran","submitted_at":"2019-12-05T04:59:30Z","abstract_excerpt":"Hierarchical spatial models are very flexible and popular for a vast array of applications in areas such as ecology, social science, public health, and atmospheric science. It is common to carry out Bayesian inference for these models via Markov chain Monte Carlo (MCMC). Each iteration of the MCMC algorithm is computationally expensive due to costly matrix operations. In addition, the MCMC algorithm needs to be run for more iterations because the strong cross-correlations among the spatial latent variables result in slow mixing Markov chains. To address these computational challenges, we propo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1912.02382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-12-05T04:59:30Z","cross_cats_sorted":[],"title_canon_sha256":"40a7bc41ad66c97108a0137bdea4a8252dcf67ee6b623fdcf090857b228a38ed","abstract_canon_sha256":"e97b990fb35ec69481a8dc07985fca6621ae970e646e3f80dd4143f160c14c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:08.448532Z","signature_b64":"/+Os5yxyNtu4F1szn82AxYBbvZa2sLj/OMgq5/eoQs+6+pBielhNYJr7/dFrywi2d/AUjlxr3XzPghfC6IRWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f50bf7e81aae19468f2b40bb9b097c3b3cae4227a5aec30a77b0fd04848e5dff","last_reissued_at":"2026-07-05T02:40:08.448104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:08.448104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PICAR: An Efficient Extendable Approach for Fitting Hierarchical Spatial Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ben Seiyon Lee, Murali Haran","submitted_at":"2019-12-05T04:59:30Z","abstract_excerpt":"Hierarchical spatial models are very flexible and popular for a vast array of applications in areas such as ecology, social science, public health, and atmospheric science. It is common to carry out Bayesian inference for these models via Markov chain Monte Carlo (MCMC). Each iteration of the MCMC algorithm is computationally expensive due to costly matrix operations. In addition, the MCMC algorithm needs to be run for more iterations because the strong cross-correlations among the spatial latent variables result in slow mixing Markov chains. To address these computational challenges, we propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02382","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.02382/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1912.02382","created_at":"2026-07-05T02:40:08.448166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.02382v2","created_at":"2026-07-05T02:40:08.448166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02382","created_at":"2026-07-05T02:40:08.448166+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UF7P2A2VYMU","created_at":"2026-07-05T02:40:08.448166+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UF7P2A2VYMUNDZL","created_at":"2026-07-05T02:40:08.448166+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UF7P2A2","created_at":"2026-07-05T02:40:08.448166+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06437","citing_title":"Fast Bayesian inference of Block Nearest Neighbor Gaussian process for large data","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM","json":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM.json","graph_json":"https://pith.science/api/pith-number/6UF7P2A2VYMUNDZLIC5ZWCL4HM/graph.json","events_json":"https://pith.science/api/pith-number/6UF7P2A2VYMUNDZLIC5ZWCL4HM/events.json","paper":"https://pith.science/paper/6UF7P2A2"},"agent_actions":{"view_html":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM","download_json":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM.json","view_paper":"https://pith.science/paper/6UF7P2A2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.02382&json=true","fetch_graph":"https://pith.science/api/pith-number/6UF7P2A2VYMUNDZLIC5ZWCL4HM/graph.json","fetch_events":"https://pith.science/api/pith-number/6UF7P2A2VYMUNDZLIC5ZWCL4HM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM/action/storage_attestation","attest_author":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM/action/author_attestation","sign_citation":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM/action/citation_signature","submit_replication":"https://pith.science/pith/6UF7P2A2VYMUNDZLIC5ZWCL4HM/action/replication_record"}},"created_at":"2026-07-05T02:40:08.448166+00:00","updated_at":"2026-07-05T02:40:08.448166+00:00"}