{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:747ZUAA2AUHAWA2VNDVXZRU2AU","short_pith_number":"pith:747ZUAA2","canonical_record":{"source":{"id":"1112.1450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-07T00:30:17Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"d6051068986af030eb7c05abc3cd970794599f79dac735df138b4dd8a35db969","abstract_canon_sha256":"125cf2687f5e38461462002329bb613ff0651d1d819d64cd89e2292118fc6a3a"},"schema_version":"1.0"},"canonical_sha256":"ff3f9a001a050e0b035568eb7cc69a0535ee301e87f6b0b47ca8437683d96461","source":{"kind":"arxiv","id":"1112.1450","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1450","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1450v2","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1450","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"747ZUAA2AUHA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"747ZUAA2AUHAWA2V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"747ZUAA2","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:747ZUAA2AUHAWA2VNDVXZRU2AU","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-07T00:30:17Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"d6051068986af030eb7c05abc3cd970794599f79dac735df138b4dd8a35db969","abstract_canon_sha256":"125cf2687f5e38461462002329bb613ff0651d1d819d64cd89e2292118fc6a3a"},"schema_version":"1.0"},"canonical_sha256":"ff3f9a001a050e0b035568eb7cc69a0535ee301e87f6b0b47ca8437683d96461","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:41.864393Z","signature_b64":"bBOxvq50mneZR3n7mR83hAq0Qn/0uPe7wFMFGrFdMU98SiMMIdsMbSLIzzx4DBVZ3Pni38PtrVhr5ONV1Jj0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff3f9a001a050e0b035568eb7cc69a0535ee301e87f6b0b47ca8437683d96461","last_reissued_at":"2026-05-18T03:39:41.863585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:41.863585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1450","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-18T03:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MaxN9rGSB+pqWN9e4yjcY8gXm01UkwXC7p7vSJaLHfY7svR3T7vdJmfkS8+xe9snA/KNyBuVRCcUHnexUKfWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:28:16.329201Z"},"content_sha256":"4b24017ec8fd7064863a4247b4800245738b1a5d49b6f865e1df3f347a7ed55e","schema_version":"1.0","event_id":"sha256:4b24017ec8fd7064863a4247b4800245738b1a5d49b6f865e1df3f347a7ed55e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:747ZUAA2AUHAWA2VNDVXZRU2AU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A recursive procedure for density estimation on the binary hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jorge Silva, Maxim Raginsky, Rebecca Willett, Svetlana Lazebnik","submitted_at":"2011-12-07T00:30:17Z","abstract_excerpt":"This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For $d$ covariates, there are $2^d$ basis coefficients to estimate, which renders conventional approaches computationally prohibitive when $d$ is large. However, for a wide class of densities that satisfy a certain sparsity condition, our estimator runs in probabilistic polynomial time and adapts to the unknown sparsity of the underlying density in two key ways: (1) it attains near-minimax mean-squared error fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1450","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-18T03:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zaItdQiShtalY03AiacnYkRegTjPMyA5Na/4hXaujV2i1cVPENHV61Hj0T54FLkeZ+CaIGw4P2a2OdWs8mIGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:28:16.329571Z"},"content_sha256":"d57347a4b6f09bf07b2e94918643f8bc2294e3b8f559f8ae02ec595065eb5f77","schema_version":"1.0","event_id":"sha256:d57347a4b6f09bf07b2e94918643f8bc2294e3b8f559f8ae02ec595065eb5f77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/747ZUAA2AUHAWA2VNDVXZRU2AU/bundle.json","state_url":"https://pith.science/pith/747ZUAA2AUHAWA2VNDVXZRU2AU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/747ZUAA2AUHAWA2VNDVXZRU2AU/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-20T21:28:16Z","links":{"resolver":"https://pith.science/pith/747ZUAA2AUHAWA2VNDVXZRU2AU","bundle":"https://pith.science/pith/747ZUAA2AUHAWA2VNDVXZRU2AU/bundle.json","state":"https://pith.science/pith/747ZUAA2AUHAWA2VNDVXZRU2AU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/747ZUAA2AUHAWA2VNDVXZRU2AU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:747ZUAA2AUHAWA2VNDVXZRU2AU","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":"125cf2687f5e38461462002329bb613ff0651d1d819d64cd89e2292118fc6a3a","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-07T00:30:17Z","title_canon_sha256":"d6051068986af030eb7c05abc3cd970794599f79dac735df138b4dd8a35db969"},"schema_version":"1.0","source":{"id":"1112.1450","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1450","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1450v2","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1450","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"747ZUAA2AUHA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"747ZUAA2AUHAWA2V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"747ZUAA2","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:d57347a4b6f09bf07b2e94918643f8bc2294e3b8f559f8ae02ec595065eb5f77","target":"graph","created_at":"2026-05-18T03:39:41Z","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 describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For $d$ covariates, there are $2^d$ basis coefficients to estimate, which renders conventional approaches computationally prohibitive when $d$ is large. However, for a wide class of densities that satisfy a certain sparsity condition, our estimator runs in probabilistic polynomial time and adapts to the unknown sparsity of the underlying density in two key ways: (1) it attains near-minimax mean-squared error fo","authors_text":"Jorge Silva, Maxim Raginsky, Rebecca Willett, Svetlana Lazebnik","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-07T00:30:17Z","title":"A recursive procedure for density estimation on the binary hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1450","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:4b24017ec8fd7064863a4247b4800245738b1a5d49b6f865e1df3f347a7ed55e","target":"record","created_at":"2026-05-18T03:39:41Z","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":"125cf2687f5e38461462002329bb613ff0651d1d819d64cd89e2292118fc6a3a","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-07T00:30:17Z","title_canon_sha256":"d6051068986af030eb7c05abc3cd970794599f79dac735df138b4dd8a35db969"},"schema_version":"1.0","source":{"id":"1112.1450","kind":"arxiv","version":2}},"canonical_sha256":"ff3f9a001a050e0b035568eb7cc69a0535ee301e87f6b0b47ca8437683d96461","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff3f9a001a050e0b035568eb7cc69a0535ee301e87f6b0b47ca8437683d96461","first_computed_at":"2026-05-18T03:39:41.863585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:41.863585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBOxvq50mneZR3n7mR83hAq0Qn/0uPe7wFMFGrFdMU98SiMMIdsMbSLIzzx4DBVZ3Pni38PtrVhr5ONV1Jj0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:41.864393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1450","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b24017ec8fd7064863a4247b4800245738b1a5d49b6f865e1df3f347a7ed55e","sha256:d57347a4b6f09bf07b2e94918643f8bc2294e3b8f559f8ae02ec595065eb5f77"],"state_sha256":"caad2f450bf232566471592747b2a7b2f1baa2138429cd3b7c5e02ed7a3a1adc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENjIUt8Ve/s3RFVcfzrGBTHp9VkRu4V8CxQH/ilVlCS4ynVgQhoGKHaTuu6ApIF9f+B+ZNhg0KAs2xmMsi9hCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:28:16.331490Z","bundle_sha256":"b84bc46fae2004fb4413a2545b675f7172501bb08cab3a035c56822cf84f3259"}}