{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DBBSYNDMTAD2JA3J6ZCOWFE7I4","short_pith_number":"pith:DBBSYNDM","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"},"canonical_sha256":"18432c346c9807a48369f644eb149f4710ed374c271785f156a851a70735f874","source":{"kind":"arxiv","id":"1509.05457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05457","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05457v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05457","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"DBBSYNDMTAD2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DBBSYNDMTAD2JA3J","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DBBSYNDM","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DBBSYNDMTAD2JA3J6ZCOWFE7I4","target":"record","payload":{"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"},"canonical_sha256":"18432c346c9807a48369f644eb149f4710ed374c271785f156a851a70735f874","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"},"source_kind":"arxiv","source_id":"1509.05457","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:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2fKu8bL6u9JnesuVEaDsqI2cYnyvNJ1x6Zy+hIDh04kXEr4H6lVCgYa45nIohWyT0aOhJ3NRsTI0lI6MvjMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:54.335162Z"},"content_sha256":"b9eba2e44445d0666f43db4dfc9b18adbec8f2aada3ecb0376d2b28df6606b4f","schema_version":"1.0","event_id":"sha256:b9eba2e44445d0666f43db4dfc9b18adbec8f2aada3ecb0376d2b28df6606b4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DBBSYNDMTAD2JA3J6ZCOWFE7I4","target":"graph","payload":{"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"},"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:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIHugvs4x2O1Hmb2IZPlXoObsWZ1yexn2gWxOMC2DyGFGaXFUTd4Z/tjYH7d0u9RE+O5HZ+P4cUFqmg2Q9jzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:54.335599Z"},"content_sha256":"7506bbe1dc28df8ed0591e852a523f57e11e1ec7e12bc6ad59dfb07a3abd4b57","schema_version":"1.0","event_id":"sha256:7506bbe1dc28df8ed0591e852a523f57e11e1ec7e12bc6ad59dfb07a3abd4b57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/bundle.json","state_url":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/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-31T09:21:54Z","links":{"resolver":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4","bundle":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/bundle.json","state":"https://pith.science/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBBSYNDMTAD2JA3J6ZCOWFE7I4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DBBSYNDMTAD2JA3J6ZCOWFE7I4","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":"a114c5116cb6d3b38a77079b0d49ab6ee1b10b50832e26ac7b3647380d8c6a1e","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-17T22:08:41Z","title_canon_sha256":"d73e45adec677281883ec3f4b8360554d21cd8492cb0ce260955a3073832b44f"},"schema_version":"1.0","source":{"id":"1509.05457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05457","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05457v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05457","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"DBBSYNDMTAD2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DBBSYNDMTAD2JA3J","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DBBSYNDM","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:7506bbe1dc28df8ed0591e852a523f57e11e1ec7e12bc6ad59dfb07a3abd4b57","target":"graph","created_at":"2026-05-18T01:32:43Z","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":"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","authors_text":"Han Liu, Heather Battey, Jianqing Fan, Junwei Lu, Ziwei Zhu","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-17T22:08:41Z","title":"Distributed Estimation and Inference with Statistical Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05457","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:b9eba2e44445d0666f43db4dfc9b18adbec8f2aada3ecb0376d2b28df6606b4f","target":"record","created_at":"2026-05-18T01:32:43Z","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":"a114c5116cb6d3b38a77079b0d49ab6ee1b10b50832e26ac7b3647380d8c6a1e","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-17T22:08:41Z","title_canon_sha256":"d73e45adec677281883ec3f4b8360554d21cd8492cb0ce260955a3073832b44f"},"schema_version":"1.0","source":{"id":"1509.05457","kind":"arxiv","version":1}},"canonical_sha256":"18432c346c9807a48369f644eb149f4710ed374c271785f156a851a70735f874","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18432c346c9807a48369f644eb149f4710ed374c271785f156a851a70735f874","first_computed_at":"2026-05-18T01:32:43.153122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:43.153122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YT2bdbPNBbjZ0oGkTbaqIkmjfcbwyYx5j0LHYhoksO1VegLJdNkZcFA24jIAvdFaOrBzN2BOpA4fx/VXLGv0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:43.153549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9eba2e44445d0666f43db4dfc9b18adbec8f2aada3ecb0376d2b28df6606b4f","sha256:7506bbe1dc28df8ed0591e852a523f57e11e1ec7e12bc6ad59dfb07a3abd4b57"],"state_sha256":"2e902c59329d1b5124c9bdb94bc1d793c0775c1faeca617ba1775a13cbf73c4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGXUjhnhaFJpZWjbze56T+g+wZErzjQ4YvMJAWTPILArFOp9j96ih+czKHigJ1CmFZTKQvugIfK3wGWcfnEEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:21:54.338342Z","bundle_sha256":"3c47ea9be8f02d1e5ff268e264c4435e330d74ec91cf1973b579c562bf30f0e3"}}