{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CB2ZOMRX64OIXLHV2MROCR6VCY","short_pith_number":"pith:CB2ZOMRX","schema_version":"1.0","canonical_sha256":"1075973237f71c8bacf5d322e147d5160e8399940e1dcbf2bb029582fdbe3d83","source":{"kind":"arxiv","id":"1312.2687","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.2687","created_at":"2026-05-18T03:05:09.148959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2687v1","created_at":"2026-05-18T03:05:09.148959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2687","created_at":"2026-05-18T03:05:09.148959+00:00"},{"alias_kind":"pith_short_12","alias_value":"CB2ZOMRX64OI","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CB2ZOMRX64OIXLHV","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CB2ZOMRX","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY","json":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY.json","graph_json":"https://pith.science/api/pith-number/CB2ZOMRX64OIXLHV2MROCR6VCY/graph.json","events_json":"https://pith.science/api/pith-number/CB2ZOMRX64OIXLHV2MROCR6VCY/events.json","paper":"https://pith.science/paper/CB2ZOMRX"},"agent_actions":{"view_html":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY","download_json":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY.json","view_paper":"https://pith.science/paper/CB2ZOMRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2687&json=true","fetch_graph":"https://pith.science/api/pith-number/CB2ZOMRX64OIXLHV2MROCR6VCY/graph.json","fetch_events":"https://pith.science/api/pith-number/CB2ZOMRX64OIXLHV2MROCR6VCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/action/storage_attestation","attest_author":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/action/author_attestation","sign_citation":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/action/citation_signature","submit_replication":"https://pith.science/pith/CB2ZOMRX64OIXLHV2MROCR6VCY/action/replication_record"}},"created_at":"2026-05-18T03:05:09.148959+00:00","updated_at":"2026-05-18T03:05:09.148959+00:00"}