{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FX4P2ROX3GKRATWEBRD65FJDL7","short_pith_number":"pith:FX4P2ROX","canonical_record":{"source":{"id":"1612.02542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:26:26Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"b436ef6695c8df01781f1ab26b798b5e9547afbb132b17e98fc6893e19773661","abstract_canon_sha256":"257f6b90805797bbeb9c37cf6be82dbd952fa8f1d59a88bec2dc3a286da4224a"},"schema_version":"1.0"},"canonical_sha256":"2df8fd45d7d995104ec40c47ee95235fe989234ee36cc7fb24be972b2b9bc203","source":{"kind":"arxiv","id":"1612.02542","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02542","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02542v2","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02542","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"FX4P2ROX3GKR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FX4P2ROX3GKRATWE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FX4P2ROX","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FX4P2ROX3GKRATWEBRD65FJDL7","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:26:26Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"b436ef6695c8df01781f1ab26b798b5e9547afbb132b17e98fc6893e19773661","abstract_canon_sha256":"257f6b90805797bbeb9c37cf6be82dbd952fa8f1d59a88bec2dc3a286da4224a"},"schema_version":"1.0"},"canonical_sha256":"2df8fd45d7d995104ec40c47ee95235fe989234ee36cc7fb24be972b2b9bc203","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:28.595847Z","signature_b64":"durGrwHp+370vBGvWoplt3RYxx0WOeu71H/7KYNXm9Nf5eY1Oy7mgjiVwJfUlAZe1ggT8w1RZRZjBpxccEW/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df8fd45d7d995104ec40c47ee95235fe989234ee36cc7fb24be972b2b9bc203","last_reissued_at":"2026-05-18T00:30:28.595198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:28.595198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02542","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:30:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xwqp3ae0fOc6MVciUx1gRsPRrJ+1zNQ6z9awx0NRGS3EM7xhgvWmBqa0Fk6T5CelE2wWiw2JF7jvvvLvwjklDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:47.398798Z"},"content_sha256":"9fa584c800b1b1a95f3b032e57e8d0f2e5faa431b1b78db91174cb4a9e0f16a1","schema_version":"1.0","event_id":"sha256:9fa584c800b1b1a95f3b032e57e8d0f2e5faa431b1b78db91174cb4a9e0f16a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FX4P2ROX3GKRATWEBRD65FJDL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Rates of Approximate Sufficient Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Vincent Y. F. Tan","submitted_at":"2016-12-08T06:26:26Z","abstract_excerpt":"Given a sufficient statistic for a parametric family of distributions, one can estimate the parameter without access to the data. However, the memory or code size for storing the sufficient statistic may nonetheless still be prohibitive. Indeed, for $n$ independent samples drawn from a $k$-nomial distribution with $d=k-1$ degrees of freedom, the length of the code scales as $d\\log n+O(1)$. In many applications, we may not have a useful notion of sufficient statistics (e.g., when the parametric family is not an exponential family) and we also may not need to reconstruct the generating distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02542","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:30:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ct/Bkbv9cLseYchP8jh7e4jG2QiZ/YSaS9fCm0zg+uvis6TO3dck7fj07KwIpxm+eX/9rb6CCuO26cPyZKTEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:47.399146Z"},"content_sha256":"1d8f612924be9bb4532a6785a80640bc8dfa05a4e5de35ae9d7148918801f885","schema_version":"1.0","event_id":"sha256:1d8f612924be9bb4532a6785a80640bc8dfa05a4e5de35ae9d7148918801f885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FX4P2ROX3GKRATWEBRD65FJDL7/bundle.json","state_url":"https://pith.science/pith/FX4P2ROX3GKRATWEBRD65FJDL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FX4P2ROX3GKRATWEBRD65FJDL7/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-02T18:38:47Z","links":{"resolver":"https://pith.science/pith/FX4P2ROX3GKRATWEBRD65FJDL7","bundle":"https://pith.science/pith/FX4P2ROX3GKRATWEBRD65FJDL7/bundle.json","state":"https://pith.science/pith/FX4P2ROX3GKRATWEBRD65FJDL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FX4P2ROX3GKRATWEBRD65FJDL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FX4P2ROX3GKRATWEBRD65FJDL7","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":"257f6b90805797bbeb9c37cf6be82dbd952fa8f1d59a88bec2dc3a286da4224a","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:26:26Z","title_canon_sha256":"b436ef6695c8df01781f1ab26b798b5e9547afbb132b17e98fc6893e19773661"},"schema_version":"1.0","source":{"id":"1612.02542","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02542","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02542v2","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02542","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"FX4P2ROX3GKR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FX4P2ROX3GKRATWE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FX4P2ROX","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1d8f612924be9bb4532a6785a80640bc8dfa05a4e5de35ae9d7148918801f885","target":"graph","created_at":"2026-05-18T00:30:28Z","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":"Given a sufficient statistic for a parametric family of distributions, one can estimate the parameter without access to the data. However, the memory or code size for storing the sufficient statistic may nonetheless still be prohibitive. Indeed, for $n$ independent samples drawn from a $k$-nomial distribution with $d=k-1$ degrees of freedom, the length of the code scales as $d\\log n+O(1)$. In many applications, we may not have a useful notion of sufficient statistics (e.g., when the parametric family is not an exponential family) and we also may not need to reconstruct the generating distribut","authors_text":"Masahito Hayashi, Vincent Y. F. Tan","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:26:26Z","title":"Minimum Rates of Approximate Sufficient Statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02542","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:9fa584c800b1b1a95f3b032e57e8d0f2e5faa431b1b78db91174cb4a9e0f16a1","target":"record","created_at":"2026-05-18T00:30:28Z","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":"257f6b90805797bbeb9c37cf6be82dbd952fa8f1d59a88bec2dc3a286da4224a","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:26:26Z","title_canon_sha256":"b436ef6695c8df01781f1ab26b798b5e9547afbb132b17e98fc6893e19773661"},"schema_version":"1.0","source":{"id":"1612.02542","kind":"arxiv","version":2}},"canonical_sha256":"2df8fd45d7d995104ec40c47ee95235fe989234ee36cc7fb24be972b2b9bc203","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2df8fd45d7d995104ec40c47ee95235fe989234ee36cc7fb24be972b2b9bc203","first_computed_at":"2026-05-18T00:30:28.595198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:28.595198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"durGrwHp+370vBGvWoplt3RYxx0WOeu71H/7KYNXm9Nf5eY1Oy7mgjiVwJfUlAZe1ggT8w1RZRZjBpxccEW/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:28.595847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02542","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fa584c800b1b1a95f3b032e57e8d0f2e5faa431b1b78db91174cb4a9e0f16a1","sha256:1d8f612924be9bb4532a6785a80640bc8dfa05a4e5de35ae9d7148918801f885"],"state_sha256":"c6ca21942b61cad03a0a37a83a4179f78cd501453604c73d8694d2370b0120fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWngPsgjUA8KaZrzjn9q4ogk/4to6PFjBVTnHadAJY3aeALkjfzyQ8nerk2v/w7vftc6LcU8zFX7KJpqA9fhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:38:47.401118Z","bundle_sha256":"08d70922593fe6a2653ae269da13693e5688c17c4f6150fcb3db8290161d246f"}}