{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OGI7OC7TGXPAZ3AWYOYTMIQ32A","short_pith_number":"pith:OGI7OC7T","canonical_record":{"source":{"id":"1806.04310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T03:03:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"37353e18d1b4c25387a05f9d6c7882b3160dee60d9186e488eaa09a0586cd708","abstract_canon_sha256":"1e9029fc77ee7ca28a74c83ccc6113d3fc342c52d6c133ae7d0eb409f3359022"},"schema_version":"1.0"},"canonical_sha256":"7191f70bf335de0cec16c3b136221bd035de5dd167ebba8b730e6b995070fa84","source":{"kind":"arxiv","id":"1806.04310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04310","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04310v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04310","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"OGI7OC7TGXPA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGI7OC7TGXPAZ3AW","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGI7OC7T","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OGI7OC7TGXPAZ3AWYOYTMIQ32A","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T03:03:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"37353e18d1b4c25387a05f9d6c7882b3160dee60d9186e488eaa09a0586cd708","abstract_canon_sha256":"1e9029fc77ee7ca28a74c83ccc6113d3fc342c52d6c133ae7d0eb409f3359022"},"schema_version":"1.0"},"canonical_sha256":"7191f70bf335de0cec16c3b136221bd035de5dd167ebba8b730e6b995070fa84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.918458Z","signature_b64":"X3p9BdWmvRyJQVbxkm7M9tLserRl5j9WOL53mVCUMVYgMSBhRtOd/oQLgC1hA13dPMiunIIjXTDK8ZGOB0kXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7191f70bf335de0cec16c3b136221bd035de5dd167ebba8b730e6b995070fa84","last_reissued_at":"2026-05-18T00:13:35.917928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.917928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04310","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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOlKrpXWMp9bQwltmp4u2jl6Y920Okctd5EbMQb7HlqGN8YOJyhPI61+j9V326lrRxRrJ2KorGSdqSXPn/uADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:46:01.778411Z"},"content_sha256":"27f6f204efd08e6f80a03292c9bea8e537b4174c7c1d5d294b592e74b4420f3a","schema_version":"1.0","event_id":"sha256:27f6f204efd08e6f80a03292c9bea8e537b4174c7c1d5d294b592e74b4420f3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OGI7OC7TGXPAZ3AWYOYTMIQ32A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MISSION: Ultra Large-Scale Feature Selection using Count-Sketches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Amirali Aghazadeh, Anshumali Shrivastava, Daniel LeJeune, Gautam Dasarathy, Richard G. Baraniuk, Ryan Spring","submitted_at":"2018-06-12T03:03:13Z","abstract_excerpt":"Feature selection is an important challenge in machine learning. It plays a crucial role in the explainability of machine-driven decisions that are rapidly permeating throughout modern society. Unfortunately, the explosion in the size and dimensionality of real-world datasets poses a severe challenge to standard feature selection algorithms. Today, it is not uncommon for datasets to have billions of dimensions. At such scale, even storing the feature vector is impossible, causing most existing feature selection methods to fail. Workarounds like feature hashing, a standard approach to large-sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04310","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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYUAe3TJbCbvDIWgxdCAc2oLb4rHV4WOCGBeh6oCq80UVKkfxl+Evs3wUQ+GTN7rInRcrcpeIHgMQuSgSwFxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:46:01.779089Z"},"content_sha256":"7af146f007ff00d8ad3d3801ec0c798dbba934b9b5c04f00503f2910306aaf2c","schema_version":"1.0","event_id":"sha256:7af146f007ff00d8ad3d3801ec0c798dbba934b9b5c04f00503f2910306aaf2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A/bundle.json","state_url":"https://pith.science/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A/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-24T20:46:01Z","links":{"resolver":"https://pith.science/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A","bundle":"https://pith.science/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A/bundle.json","state":"https://pith.science/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGI7OC7TGXPAZ3AWYOYTMIQ32A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OGI7OC7TGXPAZ3AWYOYTMIQ32A","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":"1e9029fc77ee7ca28a74c83ccc6113d3fc342c52d6c133ae7d0eb409f3359022","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T03:03:13Z","title_canon_sha256":"37353e18d1b4c25387a05f9d6c7882b3160dee60d9186e488eaa09a0586cd708"},"schema_version":"1.0","source":{"id":"1806.04310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04310","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04310v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04310","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"OGI7OC7TGXPA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGI7OC7TGXPAZ3AW","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGI7OC7T","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:7af146f007ff00d8ad3d3801ec0c798dbba934b9b5c04f00503f2910306aaf2c","target":"graph","created_at":"2026-05-18T00:13:35Z","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":"Feature selection is an important challenge in machine learning. It plays a crucial role in the explainability of machine-driven decisions that are rapidly permeating throughout modern society. Unfortunately, the explosion in the size and dimensionality of real-world datasets poses a severe challenge to standard feature selection algorithms. Today, it is not uncommon for datasets to have billions of dimensions. At such scale, even storing the feature vector is impossible, causing most existing feature selection methods to fail. Workarounds like feature hashing, a standard approach to large-sca","authors_text":"Amirali Aghazadeh, Anshumali Shrivastava, Daniel LeJeune, Gautam Dasarathy, Richard G. Baraniuk, Ryan Spring","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T03:03:13Z","title":"MISSION: Ultra Large-Scale Feature Selection using Count-Sketches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04310","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:27f6f204efd08e6f80a03292c9bea8e537b4174c7c1d5d294b592e74b4420f3a","target":"record","created_at":"2026-05-18T00:13:35Z","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":"1e9029fc77ee7ca28a74c83ccc6113d3fc342c52d6c133ae7d0eb409f3359022","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T03:03:13Z","title_canon_sha256":"37353e18d1b4c25387a05f9d6c7882b3160dee60d9186e488eaa09a0586cd708"},"schema_version":"1.0","source":{"id":"1806.04310","kind":"arxiv","version":1}},"canonical_sha256":"7191f70bf335de0cec16c3b136221bd035de5dd167ebba8b730e6b995070fa84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7191f70bf335de0cec16c3b136221bd035de5dd167ebba8b730e6b995070fa84","first_computed_at":"2026-05-18T00:13:35.917928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.917928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X3p9BdWmvRyJQVbxkm7M9tLserRl5j9WOL53mVCUMVYgMSBhRtOd/oQLgC1hA13dPMiunIIjXTDK8ZGOB0kXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.918458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27f6f204efd08e6f80a03292c9bea8e537b4174c7c1d5d294b592e74b4420f3a","sha256:7af146f007ff00d8ad3d3801ec0c798dbba934b9b5c04f00503f2910306aaf2c"],"state_sha256":"830a83c3f618799931463e530271419146377152a060be2a8e1e8a34a7b4693b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aktVeA1CahoHHXdae8GizkSEvNxchNwVkpUbsAMGzu2jvOOOsbUkELuW4FjspCW+YnjwgsMjulnRsvge7VRMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:46:01.782477Z","bundle_sha256":"4ca2cf90d56ad2fbbd2ca1846cc016384a3e0f16e394afad765b267bb0c138fb"}}