{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CB2ZOMRX64OIXLHV2MROCR6VCY","short_pith_number":"pith:CB2ZOMRX","canonical_record":{"source":{"id":"1312.2687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-12-10T06:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"16c8850fd0444f481e0313005ccba43c4d8ccb95ba02a7b36cc04f4e75426eb6","abstract_canon_sha256":"16f6502c7c4f8bd229b1ebfa6fcd39e05dd0f69d41702d0bd9b0149d13f8c37e"},"schema_version":"1.0"},"canonical_sha256":"1075973237f71c8bacf5d322e147d5160e8399940e1dcbf2bb029582fdbe3d83","source":{"kind":"arxiv","id":"1312.2687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2687","created_at":"2026-05-18T03:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2687v1","created_at":"2026-05-18T03:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2687","created_at":"2026-05-18T03:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"CB2ZOMRX64OI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CB2ZOMRX64OIXLHV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CB2ZOMRX","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CB2ZOMRX64OIXLHV2MROCR6VCY","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-12-10T06:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"16c8850fd0444f481e0313005ccba43c4d8ccb95ba02a7b36cc04f4e75426eb6","abstract_canon_sha256":"16f6502c7c4f8bd229b1ebfa6fcd39e05dd0f69d41702d0bd9b0149d13f8c37e"},"schema_version":"1.0"},"canonical_sha256":"1075973237f71c8bacf5d322e147d5160e8399940e1dcbf2bb029582fdbe3d83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:09.149393Z","signature_b64":"EN1RFygpe4fgJIx1J7g1CEyxBJHK7ZCAZwI5JrZyYI4xclHXzB9uuBRvWQcHsM1Te7JXKzNGVMq0oXczowM/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1075973237f71c8bacf5d322e147d5160e8399940e1dcbf2bb029582fdbe3d83","last_reissued_at":"2026-05-18T03:05:09.148878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:09.148878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2687","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:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXunRrRQCIIAW9HYQ5cLzxedoTdgTdgkl910glJ7dkgQ96ZQ6WA681dOBAUu6jKl+Y8s//9msg35h2VBiln+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:02:05.257685Z"},"content_sha256":"78379d996b1bfd7e34dba81af1f73530d18ce98079859dc31b2740cf0b4e9261","schema_version":"1.0","event_id":"sha256:78379d996b1bfd7e34dba81af1f73530d18ce98079859dc31b2740cf0b4e9261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CB2ZOMRX64OIXLHV2MROCR6VCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic approximation of score functions for Gaussian processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Jie Chen, Michael L. Stein, Mihai Anitescu","submitted_at":"2013-12-10T06:56:33Z","abstract_excerpt":"We discuss the statistical properties of a recently introduced unbiased stochastic approximation to the score equations for maximum likelihood calculation for Gaussian processes. Under certain conditions, including bounded condition number of the covariance matrix, the approach achieves $O(n)$ storage and nearly $O(n)$ computational effort per optimization step, where $n$ is the number of data sites. Here, we prove that if the condition number of the covariance matrix is bounded, then the approximate score equations are nearly optimal in a well-defined sense. Therefore, not only is the approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2687","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:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1Ts8kUD7/B8dsddeG7oyCK1bVYJVLwJSaCy4nzCFl9s1cJYIxkaoB8jrWxaLCci3GIUYExrGQo2EP/VTYIGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:02:05.258023Z"},"content_sha256":"dd9994791b653f79376b516d3709990562d3b3535d0ca5fc6e02d20e7d5a6020","schema_version":"1.0","event_id":"sha256:dd9994791b653f79376b516d3709990562d3b3535d0ca5fc6e02d20e7d5a6020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/bundle.json","state_url":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/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-02T02:02:05Z","links":{"resolver":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY","bundle":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/bundle.json","state":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CB2ZOMRX64OIXLHV2MROCR6VCY","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":"16f6502c7c4f8bd229b1ebfa6fcd39e05dd0f69d41702d0bd9b0149d13f8c37e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-12-10T06:56:33Z","title_canon_sha256":"16c8850fd0444f481e0313005ccba43c4d8ccb95ba02a7b36cc04f4e75426eb6"},"schema_version":"1.0","source":{"id":"1312.2687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2687","created_at":"2026-05-18T03:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2687v1","created_at":"2026-05-18T03:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2687","created_at":"2026-05-18T03:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"CB2ZOMRX64OI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CB2ZOMRX64OIXLHV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CB2ZOMRX","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:dd9994791b653f79376b516d3709990562d3b3535d0ca5fc6e02d20e7d5a6020","target":"graph","created_at":"2026-05-18T03:05: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":"We discuss the statistical properties of a recently introduced unbiased stochastic approximation to the score equations for maximum likelihood calculation for Gaussian processes. Under certain conditions, including bounded condition number of the covariance matrix, the approach achieves $O(n)$ storage and nearly $O(n)$ computational effort per optimization step, where $n$ is the number of data sites. Here, we prove that if the condition number of the covariance matrix is bounded, then the approximate score equations are nearly optimal in a well-defined sense. Therefore, not only is the approxi","authors_text":"Jie Chen, Michael L. Stein, Mihai Anitescu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-12-10T06:56:33Z","title":"Stochastic approximation of score functions for Gaussian processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2687","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:78379d996b1bfd7e34dba81af1f73530d18ce98079859dc31b2740cf0b4e9261","target":"record","created_at":"2026-05-18T03:05: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":"16f6502c7c4f8bd229b1ebfa6fcd39e05dd0f69d41702d0bd9b0149d13f8c37e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-12-10T06:56:33Z","title_canon_sha256":"16c8850fd0444f481e0313005ccba43c4d8ccb95ba02a7b36cc04f4e75426eb6"},"schema_version":"1.0","source":{"id":"1312.2687","kind":"arxiv","version":1}},"canonical_sha256":"1075973237f71c8bacf5d322e147d5160e8399940e1dcbf2bb029582fdbe3d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1075973237f71c8bacf5d322e147d5160e8399940e1dcbf2bb029582fdbe3d83","first_computed_at":"2026-05-18T03:05:09.148878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:09.148878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EN1RFygpe4fgJIx1J7g1CEyxBJHK7ZCAZwI5JrZyYI4xclHXzB9uuBRvWQcHsM1Te7JXKzNGVMq0oXczowM/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:09.149393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78379d996b1bfd7e34dba81af1f73530d18ce98079859dc31b2740cf0b4e9261","sha256:dd9994791b653f79376b516d3709990562d3b3535d0ca5fc6e02d20e7d5a6020"],"state_sha256":"12b21eb7a348d86642d5681f20bef5efb35aa5bc8805e2739e9915eb2dd36983"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKk1uHC0ecYYzuJ0eAocU7riSdr0dQbz0dirrhsepmEqkBZnzQX84X6Qve3HbHaNXDQLeexp/RjI2GfD8tY8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:02:05.259912Z","bundle_sha256":"70833b803496ee643240cf9c7c6b6708b0bc6f6e5d0123a6d8b8ec752717d9e5"}}