{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Y6GAW2LNHH64MVMI7HLLPSIXDY","short_pith_number":"pith:Y6GAW2LN","canonical_record":{"source":{"id":"1308.1269","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-06T13:42:24Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"f3b28ea57223b2eed19ea4d3f370d13be520c44e28701eb1791c3289f3613149","abstract_canon_sha256":"03afa62e37f0593b3b75862d8a1c5f5fc1b97c15ff23ca3fe60653978876fa8a"},"schema_version":"1.0"},"canonical_sha256":"c78c0b696d39fdc65588f9d6b7c9171e1b3db8e544ef82beff5093dfbb90d17b","source":{"kind":"arxiv","id":"1308.1269","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1269","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1269v4","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1269","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GAW2LNHH64","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GAW2LNHH64MVMI","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GAW2LN","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Y6GAW2LNHH64MVMI7HLLPSIXDY","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1269","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-06T13:42:24Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"f3b28ea57223b2eed19ea4d3f370d13be520c44e28701eb1791c3289f3613149","abstract_canon_sha256":"03afa62e37f0593b3b75862d8a1c5f5fc1b97c15ff23ca3fe60653978876fa8a"},"schema_version":"1.0"},"canonical_sha256":"c78c0b696d39fdc65588f9d6b7c9171e1b3db8e544ef82beff5093dfbb90d17b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:40.726802Z","signature_b64":"XySIsNpc1g+l971YO4moJ9R1nGyzP0eQ0dbkSb5R12lJ9+VFqGIiEtcJYjgAdaXqwX6D29M332EOsp6LwHO0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78c0b696d39fdc65588f9d6b7c9171e1b3db8e544ef82beff5093dfbb90d17b","last_reissued_at":"2026-05-18T00:22:40.726212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:40.726212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1269","source_version":4,"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:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8vg2cWCly8USVClDRwk03rK2UTVNN8Sec4hkGMGQE9kHGIjFksWwy1bUX/NF1CZu+Va2600Pdd0taffd90JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:56:40.122972Z"},"content_sha256":"4c8ad53b53a0099f62910e750b9959cca96ed13ad1dd41b4bd06386a314d3b6c","schema_version":"1.0","event_id":"sha256:4c8ad53b53a0099f62910e750b9959cca96ed13ad1dd41b4bd06386a314d3b6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Y6GAW2LNHH64MVMI7HLLPSIXDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On b-bit min-wise hashing for large-scale regression and classification with sparse data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Nicolai Meinshausen, Rajen D. Shah","submitted_at":"2013-08-06T13:42:24Z","abstract_excerpt":"Large-scale regression problems where both the number of variables, $p$, and the number of observations, $n$, may be large and in the order of millions or more, are becoming increasingly more common. Typically the data are sparse: only a fraction of a percent of the entries in the design matrix are non-zero. Nevertheless, often the only computationally feasible approach is to perform dimension reduction to obtain a new design matrix with far fewer columns and then work with this compressed data.\n  $b$-bit min-wise hashing (Li and Konig, 2011) is a promising dimension reduction scheme for spars"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1269","kind":"arxiv","version":4},"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:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWaH6XuC/d2Uc85C5T0q9hoMsmllVcWp+Avv+UbPjxioeVEdELobRamjfiDrtYMuk8GPsngxrQZT5fe2WHhRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:56:40.123632Z"},"content_sha256":"ef0cf6c215bcda9786a3d79bf98253273e59b7a446c8c9a6bbb173491dbcbed4","schema_version":"1.0","event_id":"sha256:ef0cf6c215bcda9786a3d79bf98253273e59b7a446c8c9a6bbb173491dbcbed4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY/bundle.json","state_url":"https://pith.science/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY/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-28T22:56:40Z","links":{"resolver":"https://pith.science/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY","bundle":"https://pith.science/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY/bundle.json","state":"https://pith.science/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6GAW2LNHH64MVMI7HLLPSIXDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Y6GAW2LNHH64MVMI7HLLPSIXDY","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":"03afa62e37f0593b3b75862d8a1c5f5fc1b97c15ff23ca3fe60653978876fa8a","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-06T13:42:24Z","title_canon_sha256":"f3b28ea57223b2eed19ea4d3f370d13be520c44e28701eb1791c3289f3613149"},"schema_version":"1.0","source":{"id":"1308.1269","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1269","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1269v4","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1269","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GAW2LNHH64","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GAW2LNHH64MVMI","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GAW2LN","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:ef0cf6c215bcda9786a3d79bf98253273e59b7a446c8c9a6bbb173491dbcbed4","target":"graph","created_at":"2026-05-18T00:22:40Z","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":"Large-scale regression problems where both the number of variables, $p$, and the number of observations, $n$, may be large and in the order of millions or more, are becoming increasingly more common. Typically the data are sparse: only a fraction of a percent of the entries in the design matrix are non-zero. Nevertheless, often the only computationally feasible approach is to perform dimension reduction to obtain a new design matrix with far fewer columns and then work with this compressed data.\n  $b$-bit min-wise hashing (Li and Konig, 2011) is a promising dimension reduction scheme for spars","authors_text":"Nicolai Meinshausen, Rajen D. Shah","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-06T13:42:24Z","title":"On b-bit min-wise hashing for large-scale regression and classification with sparse data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1269","kind":"arxiv","version":4},"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:4c8ad53b53a0099f62910e750b9959cca96ed13ad1dd41b4bd06386a314d3b6c","target":"record","created_at":"2026-05-18T00:22:40Z","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":"03afa62e37f0593b3b75862d8a1c5f5fc1b97c15ff23ca3fe60653978876fa8a","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-06T13:42:24Z","title_canon_sha256":"f3b28ea57223b2eed19ea4d3f370d13be520c44e28701eb1791c3289f3613149"},"schema_version":"1.0","source":{"id":"1308.1269","kind":"arxiv","version":4}},"canonical_sha256":"c78c0b696d39fdc65588f9d6b7c9171e1b3db8e544ef82beff5093dfbb90d17b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c78c0b696d39fdc65588f9d6b7c9171e1b3db8e544ef82beff5093dfbb90d17b","first_computed_at":"2026-05-18T00:22:40.726212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:40.726212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XySIsNpc1g+l971YO4moJ9R1nGyzP0eQ0dbkSb5R12lJ9+VFqGIiEtcJYjgAdaXqwX6D29M332EOsp6LwHO0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:40.726802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1269","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c8ad53b53a0099f62910e750b9959cca96ed13ad1dd41b4bd06386a314d3b6c","sha256:ef0cf6c215bcda9786a3d79bf98253273e59b7a446c8c9a6bbb173491dbcbed4"],"state_sha256":"5ddbcc814eaadbe61bd46122db041f0322d10257ba3c5578795ed02a84ee0e1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLdOCLeT5MgtX2MwBLeGTAtRpekzoYo3gKpkrHkQho53oas8xFmhSNWtcuzw2qXloZtHa1gHDxRDjwmCqMoqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:56:40.126909Z","bundle_sha256":"5ebbf4463e13c4d47770911cfc53a862f000b1e573bf6b135ce93be0ca96f18c"}}