{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DBBSYNDMTAD2JA3J6ZCOWFE7I4","short_pith_number":"pith:DBBSYNDM","schema_version":"1.0","canonical_sha256":"18432c346c9807a48369f644eb149f4710ed374c271785f156a851a70735f874","source":{"kind":"arxiv","id":"1509.05457","version":1},"attestation_state":"computed","paper":{"title":"Distributed Estimation and Inference with Statistical Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Han Liu, Heather Battey, Jianqing Fan, Junwei Lu, Ziwei Zhu","submitted_at":"2015-09-17T22:08:41Z","abstract_excerpt":"This paper studies hypothesis testing and parameter estimation in the context of the divide and conquer algorithm. In a unified likelihood based framework, we propose new test statistics and point estimators obtained by aggregating various statistics from $k$ subsamples of size $n/k$, where $n$ is the sample size. In both low dimensional and high dimensional settings, we address the important question of how to choose $k$ as $n$ grows large, providing a theoretical upper bound on $k$ such that the information loss due to the divide and conquer algorithm is negligible. In other words, the resul"},"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":"1509.05457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-17T22:08:41Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"d73e45adec677281883ec3f4b8360554d21cd8492cb0ce260955a3073832b44f","abstract_canon_sha256":"a114c5116cb6d3b38a77079b0d49ab6ee1b10b50832e26ac7b3647380d8c6a1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.153549Z","signature_b64":"YT2bdbPNBbjZ0oGkTbaqIkmjfcbwyYx5j0LHYhoksO1VegLJdNkZcFA24jIAvdFaOrBzN2BOpA4fx/VXLGv0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18432c346c9807a48369f644eb149f4710ed374c271785f156a851a70735f874","last_reissued_at":"2026-05-18T01:32:43.153122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.153122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Estimation and Inference with Statistical Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Han Liu, Heather Battey, Jianqing Fan, Junwei Lu, Ziwei Zhu","submitted_at":"2015-09-17T22:08:41Z","abstract_excerpt":"This paper studies hypothesis testing and parameter estimation in the context of the divide and conquer algorithm. In a unified likelihood based framework, we propose new test statistics and point estimators obtained by aggregating various statistics from $k$ subsamples of size $n/k$, where $n$ is the sample size. In both low dimensional and high dimensional settings, we address the important question of how to choose $k$ as $n$ grows large, providing a theoretical upper bound on $k$ such that the information loss due to the divide and conquer algorithm is negligible. In other words, the resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05457","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":"1509.05457","created_at":"2026-05-18T01:32:43.153192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05457v1","created_at":"2026-05-18T01:32:43.153192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05457","created_at":"2026-05-18T01:32:43.153192+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBBSYNDMTAD2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBBSYNDMTAD2JA3J","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBBSYNDM","created_at":"2026-05-18T12:29:17.054201+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/DBBSYNDMTAD2JA3J6ZCOWFE7I4","json":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4.json","graph_json":"https://pith.science/api/pith-number/DBBSYNDMTAD2JA3J6ZCOWFE7I4/graph.json","events_json":"https://pith.science/api/pith-number/DBBSYNDMTAD2JA3J6ZCOWFE7I4/events.json","paper":"https://pith.science/paper/DBBSYNDM"},"agent_actions":{"view_html":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4","download_json":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4.json","view_paper":"https://pith.science/paper/DBBSYNDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05457&json=true","fetch_graph":"https://pith.science/api/pith-number/DBBSYNDMTAD2JA3J6ZCOWFE7I4/graph.json","fetch_events":"https://pith.science/api/pith-number/DBBSYNDMTAD2JA3J6ZCOWFE7I4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/action/storage_attestation","attest_author":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/action/author_attestation","sign_citation":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/action/citation_signature","submit_replication":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/action/replication_record"}},"created_at":"2026-05-18T01:32:43.153192+00:00","updated_at":"2026-05-18T01:32:43.153192+00:00"}