{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IU2I4ZKASBTFQDTFJHWY2KEKPT","short_pith_number":"pith:IU2I4ZKA","canonical_record":{"source":{"id":"1512.09226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T06:32:55Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"efcb303cba98c8e208dc2da5165ab02fd27ddf3ce71132b3ba4a596897abc503","abstract_canon_sha256":"fe06cc044e760ab0af2490d51c05e0cc49cd94eddea5f508cf10b0c629694e86"},"schema_version":"1.0"},"canonical_sha256":"45348e65409066580e6549ed8d288a7cf0c17aa1cf79a7c51746a1bcdee257a8","source":{"kind":"arxiv","id":"1512.09226","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09226","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09226v2","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09226","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"IU2I4ZKASBTF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IU2I4ZKASBTFQDTF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IU2I4ZKA","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IU2I4ZKASBTFQDTFJHWY2KEKPT","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T06:32:55Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"efcb303cba98c8e208dc2da5165ab02fd27ddf3ce71132b3ba4a596897abc503","abstract_canon_sha256":"fe06cc044e760ab0af2490d51c05e0cc49cd94eddea5f508cf10b0c629694e86"},"schema_version":"1.0"},"canonical_sha256":"45348e65409066580e6549ed8d288a7cf0c17aa1cf79a7c51746a1bcdee257a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:48.014927Z","signature_b64":"X/e8/hP68YqrebuSM9kcKu+BOeiPAHc2YUpTiGnNoBYyakzfXJ0YL8chW0dCJGWF/kM95yMtZvRUQ3c2PBz0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45348e65409066580e6549ed8d288a7cf0c17aa1cf79a7c51746a1bcdee257a8","last_reissued_at":"2026-05-18T00:39:48.014228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:48.014228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09226","source_version":2,"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-18T00:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gJibbc18Y5nOghmoT0coS4YJan7BnX6Y8gk+3dK8aW2RwYNLMvrCkCcANGbhBqIeuC2MYxglQTo2rQI0c6yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:30:54.584502Z"},"content_sha256":"349d90767182a3ebb6a9201c0cfa632b8678bf0352f635c0c8689f3179a0cf12","schema_version":"1.0","event_id":"sha256:349d90767182a3ebb6a9201c0cfa632b8678bf0352f635c0c8689f3179a0cf12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IU2I4ZKASBTFQDTFJHWY2KEKPT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Limits of A Distributed Algorithm For Smoothing Spline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guang Cheng, Zuofeng Shang","submitted_at":"2015-12-31T06:32:55Z","abstract_excerpt":"In this paper, we explore statistical versus computational trade-off to address a basic question in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing spline setup, we observe a phase transition phenomenon for the number of deployed machines that ends up being a simple proxy for computing cost. Specifically, a sharp upper bound for the number of machines is established: when the number is below this bound, statistical optimality (in terms of nonparametric estimation or testing) is achievable; otherwise, statistic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09226","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":""},"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-18T00:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neGng8TIF0TagMHPPZjBOK6Uel6KZ5HaWsJyMdGT+QTcAE54gS6dsHxudGxY1QUpnN6693hn+5o8PpKju086CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:30:54.585203Z"},"content_sha256":"fefbcce34d868140914b7ddbcbf22132e1fa0778e38f3d6fb09f55841d3fcff9","schema_version":"1.0","event_id":"sha256:fefbcce34d868140914b7ddbcbf22132e1fa0778e38f3d6fb09f55841d3fcff9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT/bundle.json","state_url":"https://pith.science/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT/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-25T20:30:54Z","links":{"resolver":"https://pith.science/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT","bundle":"https://pith.science/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT/bundle.json","state":"https://pith.science/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU2I4ZKASBTFQDTFJHWY2KEKPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IU2I4ZKASBTFQDTFJHWY2KEKPT","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":"fe06cc044e760ab0af2490d51c05e0cc49cd94eddea5f508cf10b0c629694e86","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T06:32:55Z","title_canon_sha256":"efcb303cba98c8e208dc2da5165ab02fd27ddf3ce71132b3ba4a596897abc503"},"schema_version":"1.0","source":{"id":"1512.09226","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09226","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09226v2","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09226","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"IU2I4ZKASBTF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IU2I4ZKASBTFQDTF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IU2I4ZKA","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:fefbcce34d868140914b7ddbcbf22132e1fa0778e38f3d6fb09f55841d3fcff9","target":"graph","created_at":"2026-05-18T00:39:48Z","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":"In this paper, we explore statistical versus computational trade-off to address a basic question in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing spline setup, we observe a phase transition phenomenon for the number of deployed machines that ends up being a simple proxy for computing cost. Specifically, a sharp upper bound for the number of machines is established: when the number is below this bound, statistical optimality (in terms of nonparametric estimation or testing) is achievable; otherwise, statistic","authors_text":"Guang Cheng, Zuofeng Shang","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T06:32:55Z","title":"Computational Limits of A Distributed Algorithm For Smoothing Spline"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09226","kind":"arxiv","version":2},"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:349d90767182a3ebb6a9201c0cfa632b8678bf0352f635c0c8689f3179a0cf12","target":"record","created_at":"2026-05-18T00:39:48Z","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":"fe06cc044e760ab0af2490d51c05e0cc49cd94eddea5f508cf10b0c629694e86","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T06:32:55Z","title_canon_sha256":"efcb303cba98c8e208dc2da5165ab02fd27ddf3ce71132b3ba4a596897abc503"},"schema_version":"1.0","source":{"id":"1512.09226","kind":"arxiv","version":2}},"canonical_sha256":"45348e65409066580e6549ed8d288a7cf0c17aa1cf79a7c51746a1bcdee257a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45348e65409066580e6549ed8d288a7cf0c17aa1cf79a7c51746a1bcdee257a8","first_computed_at":"2026-05-18T00:39:48.014228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:48.014228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/e8/hP68YqrebuSM9kcKu+BOeiPAHc2YUpTiGnNoBYyakzfXJ0YL8chW0dCJGWF/kM95yMtZvRUQ3c2PBz0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:48.014927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09226","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349d90767182a3ebb6a9201c0cfa632b8678bf0352f635c0c8689f3179a0cf12","sha256:fefbcce34d868140914b7ddbcbf22132e1fa0778e38f3d6fb09f55841d3fcff9"],"state_sha256":"36ed5855f20a5066074c80949401b96c51db07c307901f8dbc9473f1fe2b656e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PDyjRIyIukrZXynGYmJa5jPo9PGNwOTIZaUsdlKO4dUjOdqyQauTs855okPj/Z0rJ4Iw+Rpki+B9m6txbmqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:30:54.588611Z","bundle_sha256":"f2665e2553942180f5d2ea5ec5068c5fe7e60f767dac0ee7d33241b31b11c1c3"}}