{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IWS3MCJZHE2I54RIZE4QPCYXOG","short_pith_number":"pith:IWS3MCJZ","canonical_record":{"source":{"id":"1703.02723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T06:21:46Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"17d55d5830530b72e45810f6e82ae9906a9e1d86824d4e8a004e05b515429f16","abstract_canon_sha256":"efa9af6ef3e3971d35d4f3beaf7fff82b45e9a5002d23f7c6b5f5fd13a03d7eb"},"schema_version":"1.0"},"canonical_sha256":"45a5b6093939348ef228c939078b177189ce4346da60b5ed10b8ac1646bb03fa","source":{"kind":"arxiv","id":"1703.02723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02723","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02723v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02723","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"IWS3MCJZHE2I","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWS3MCJZHE2I54RI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWS3MCJZ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IWS3MCJZHE2I54RIZE4QPCYXOG","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T06:21:46Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"17d55d5830530b72e45810f6e82ae9906a9e1d86824d4e8a004e05b515429f16","abstract_canon_sha256":"efa9af6ef3e3971d35d4f3beaf7fff82b45e9a5002d23f7c6b5f5fd13a03d7eb"},"schema_version":"1.0"},"canonical_sha256":"45a5b6093939348ef228c939078b177189ce4346da60b5ed10b8ac1646bb03fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.776080Z","signature_b64":"hl2dV390YMt3OTRcIkP7cBm+aV1LfXdPH9Eb4e2QCYZJQRH5Qfu7W9PclY8H7old7ocliXF/eTOc8gQAdJ2WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a5b6093939348ef228c939078b177189ce4346da60b5ed10b8ac1646bb03fa","last_reissued_at":"2026-05-18T00:49:05.775527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.775527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02723","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:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbXtaUx86cho/4e38Ic9OG4Q7EkAB1InFEh7Q2pKmoqGN/TboJHBPwr+alKOZeqIB8O9Uy6GvTmrWDBYtNiXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:37:22.685038Z"},"content_sha256":"01dd9365e34768edbb5e4df2f511eda8dcdffffa0e946721239f6eec2697c509","schema_version":"1.0","event_id":"sha256:01dd9365e34768edbb5e4df2f511eda8dcdffffa0e946721239f6eec2697c509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IWS3MCJZHE2I54RIZE4QPCYXOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Greedy Feature Selection via Weak Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Ethan Elenberg, Joydeep Ghosh, Rajiv Khanna, Sahand Negahban","submitted_at":"2017-03-08T06:21:46Z","abstract_excerpt":"Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for each greedy step we need to refit a model or calculate a function using the previously selected choices and the new candidate.\n  Two algorithms that are faster approximations to the greedy forward selection were introduced recently ([Mirzasoleiman et al. 2013, 2015]). They achieve better performance by exploiting distributed computation and stochastic evalu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02723","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:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LNhw/dav4CG5Lf2ZUjrPSe1TKxAC70lLC2lR8+9j7TqyzhD21zVSAehEnF8m17L/McI+ab1DmZwsUZjgVrVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:37:22.685390Z"},"content_sha256":"dcddee245286c24ced0037cf37d693cfc1044c44ff32cff8d7749924409a8559","schema_version":"1.0","event_id":"sha256:dcddee245286c24ced0037cf37d693cfc1044c44ff32cff8d7749924409a8559"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWS3MCJZHE2I54RIZE4QPCYXOG/bundle.json","state_url":"https://pith.science/pith/IWS3MCJZHE2I54RIZE4QPCYXOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWS3MCJZHE2I54RIZE4QPCYXOG/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-01T23:37:22Z","links":{"resolver":"https://pith.science/pith/IWS3MCJZHE2I54RIZE4QPCYXOG","bundle":"https://pith.science/pith/IWS3MCJZHE2I54RIZE4QPCYXOG/bundle.json","state":"https://pith.science/pith/IWS3MCJZHE2I54RIZE4QPCYXOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWS3MCJZHE2I54RIZE4QPCYXOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IWS3MCJZHE2I54RIZE4QPCYXOG","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":"efa9af6ef3e3971d35d4f3beaf7fff82b45e9a5002d23f7c6b5f5fd13a03d7eb","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T06:21:46Z","title_canon_sha256":"17d55d5830530b72e45810f6e82ae9906a9e1d86824d4e8a004e05b515429f16"},"schema_version":"1.0","source":{"id":"1703.02723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02723","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02723v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02723","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"IWS3MCJZHE2I","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWS3MCJZHE2I54RI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWS3MCJZ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:dcddee245286c24ced0037cf37d693cfc1044c44ff32cff8d7749924409a8559","target":"graph","created_at":"2026-05-18T00:49:05Z","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":"Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for each greedy step we need to refit a model or calculate a function using the previously selected choices and the new candidate.\n  Two algorithms that are faster approximations to the greedy forward selection were introduced recently ([Mirzasoleiman et al. 2013, 2015]). They achieve better performance by exploiting distributed computation and stochastic evalu","authors_text":"Alexandros G. Dimakis, Ethan Elenberg, Joydeep Ghosh, Rajiv Khanna, Sahand Negahban","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T06:21:46Z","title":"Scalable Greedy Feature Selection via Weak Submodularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02723","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:01dd9365e34768edbb5e4df2f511eda8dcdffffa0e946721239f6eec2697c509","target":"record","created_at":"2026-05-18T00:49:05Z","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":"efa9af6ef3e3971d35d4f3beaf7fff82b45e9a5002d23f7c6b5f5fd13a03d7eb","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-08T06:21:46Z","title_canon_sha256":"17d55d5830530b72e45810f6e82ae9906a9e1d86824d4e8a004e05b515429f16"},"schema_version":"1.0","source":{"id":"1703.02723","kind":"arxiv","version":1}},"canonical_sha256":"45a5b6093939348ef228c939078b177189ce4346da60b5ed10b8ac1646bb03fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a5b6093939348ef228c939078b177189ce4346da60b5ed10b8ac1646bb03fa","first_computed_at":"2026-05-18T00:49:05.775527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:05.775527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hl2dV390YMt3OTRcIkP7cBm+aV1LfXdPH9Eb4e2QCYZJQRH5Qfu7W9PclY8H7old7ocliXF/eTOc8gQAdJ2WBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:05.776080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01dd9365e34768edbb5e4df2f511eda8dcdffffa0e946721239f6eec2697c509","sha256:dcddee245286c24ced0037cf37d693cfc1044c44ff32cff8d7749924409a8559"],"state_sha256":"140a413505dd34fa18403c4a7af9f23ed9c85e2195f19cd103d52627f6af4e87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmDXKIaet7ngfIbSD5uuuEGtDyQOVe65FtHoaz04voRDKgFdUC7fQB1+J0bz8wLlyFwM5ublyZ8XKzRSV7f3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:37:22.687274Z","bundle_sha256":"d53b1ef014bb688b1712ca394a407202cd0a4c413a804c910b201b7092775b71"}}