{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OIKMCZSOKVAWHVRPU566VEJFPK","short_pith_number":"pith:OIKMCZSO","canonical_record":{"source":{"id":"1401.0086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T04:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"d8e38d62e0146f418da9db282cf54cdc0f220d1a2859a14143adf13ccb4d28b2","abstract_canon_sha256":"5b633f4d548cd9f1fe1750d1531caf27c490e8cc655abefb0be5c460bc3e5c01"},"schema_version":"1.0"},"canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","source":{"kind":"arxiv","id":"1401.0086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0086","created_at":"2026-05-18T03:03:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0086v2","created_at":"2026-05-18T03:03:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0086","created_at":"2026-05-18T03:03:09Z"},{"alias_kind":"pith_short_12","alias_value":"OIKMCZSOKVAW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OIKMCZSOKVAWHVRP","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OIKMCZSO","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OIKMCZSOKVAWHVRPU566VEJFPK","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T04:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"d8e38d62e0146f418da9db282cf54cdc0f220d1a2859a14143adf13ccb4d28b2","abstract_canon_sha256":"5b633f4d548cd9f1fe1750d1531caf27c490e8cc655abefb0be5c460bc3e5c01"},"schema_version":"1.0"},"canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:09.459245Z","signature_b64":"JmQjv71nA5IUCajGuST9uTFlO0QIFXs4a6rYnTcvLUIftSvHw9de/XbjQqK/5V4h7XxgnnEbvRIyInFi2Lq4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","last_reissued_at":"2026-05-18T03:03:09.458338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:09.458338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0086","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:03:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XY9FniS3LThgBPNAZWZCfvQkhIkVWKKARms0ZAhj+1mw2m6z436Hyu2OLasbrVuv8fgDh/eXNpxnLSrkF7NYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:23:39.908678Z"},"content_sha256":"80d4edd7a9baff553bfaa7f8017a09a1589aebcfa1c1d57bf5fd2a16887ac56a","schema_version":"1.0","event_id":"sha256:80d4edd7a9baff553bfaa7f8017a09a1589aebcfa1c1d57bf5fd2a16887ac56a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OIKMCZSOKVAWHVRPU566VEJFPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jieping Ye, Ji Liu, Ryohei Fujimaki","submitted_at":"2013-12-31T04:00:31Z","abstract_excerpt":"We consider forward-backward greedy algorithms for solving sparse feature selection problems with general convex smooth functions. A state-of-the-art greedy method, the Forward-Backward greedy algorithm (FoBa-obj) requires to solve a large number of optimization problems, thus it is not scalable for large-size problems. The FoBa-gdt algorithm, which uses the gradient information for feature selection at each forward iteration, significantly improves the efficiency of FoBa-obj. In this paper, we systematically analyze the theoretical properties of both forward-backward greedy algorithms. Our ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0086","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:03:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9v56eCyjsQ7I6FjCp0bc78g9TG7i2Efq4zEIyTX9edmuMj9WJ/5YJdW/kt6eY1jyjHgw3FNcrOKA9i5tvfhfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:23:39.909358Z"},"content_sha256":"126680e4b6a2b4f8f82099a2c3371eab5521253d52fb226471620be70c0ba819","schema_version":"1.0","event_id":"sha256:126680e4b6a2b4f8f82099a2c3371eab5521253d52fb226471620be70c0ba819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/bundle.json","state_url":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIKMCZSOKVAWHVRPU566VEJFPK/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-12T05:23:39Z","links":{"resolver":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK","bundle":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/bundle.json","state":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIKMCZSOKVAWHVRPU566VEJFPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OIKMCZSOKVAWHVRPU566VEJFPK","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":"5b633f4d548cd9f1fe1750d1531caf27c490e8cc655abefb0be5c460bc3e5c01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T04:00:31Z","title_canon_sha256":"d8e38d62e0146f418da9db282cf54cdc0f220d1a2859a14143adf13ccb4d28b2"},"schema_version":"1.0","source":{"id":"1401.0086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0086","created_at":"2026-05-18T03:03:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0086v2","created_at":"2026-05-18T03:03:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0086","created_at":"2026-05-18T03:03:09Z"},{"alias_kind":"pith_short_12","alias_value":"OIKMCZSOKVAW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OIKMCZSOKVAWHVRP","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OIKMCZSO","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:126680e4b6a2b4f8f82099a2c3371eab5521253d52fb226471620be70c0ba819","target":"graph","created_at":"2026-05-18T03:03:09Z","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":"We consider forward-backward greedy algorithms for solving sparse feature selection problems with general convex smooth functions. A state-of-the-art greedy method, the Forward-Backward greedy algorithm (FoBa-obj) requires to solve a large number of optimization problems, thus it is not scalable for large-size problems. The FoBa-gdt algorithm, which uses the gradient information for feature selection at each forward iteration, significantly improves the efficiency of FoBa-obj. In this paper, we systematically analyze the theoretical properties of both forward-backward greedy algorithms. Our ma","authors_text":"Jieping Ye, Ji Liu, Ryohei Fujimaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T04:00:31Z","title":"Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0086","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:80d4edd7a9baff553bfaa7f8017a09a1589aebcfa1c1d57bf5fd2a16887ac56a","target":"record","created_at":"2026-05-18T03:03:09Z","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":"5b633f4d548cd9f1fe1750d1531caf27c490e8cc655abefb0be5c460bc3e5c01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T04:00:31Z","title_canon_sha256":"d8e38d62e0146f418da9db282cf54cdc0f220d1a2859a14143adf13ccb4d28b2"},"schema_version":"1.0","source":{"id":"1401.0086","kind":"arxiv","version":2}},"canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","first_computed_at":"2026-05-18T03:03:09.458338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:09.458338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JmQjv71nA5IUCajGuST9uTFlO0QIFXs4a6rYnTcvLUIftSvHw9de/XbjQqK/5V4h7XxgnnEbvRIyInFi2Lq4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:09.459245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80d4edd7a9baff553bfaa7f8017a09a1589aebcfa1c1d57bf5fd2a16887ac56a","sha256:126680e4b6a2b4f8f82099a2c3371eab5521253d52fb226471620be70c0ba819"],"state_sha256":"994909c61febcb3bec2552dee1b03b216933f2523e652e9af0e90f87ede91b1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8/cKZghAwylF06S0mbHbPk1Sdaj9H81h8RDlBF1PKB8R5xXluULX7Nz3yYL+3+dC80GCfe0LagE0BRIDJWm4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:23:39.912825Z","bundle_sha256":"bf2eb2032f93257f5667b1bfe183f912dad9ff90c70dda62a98dd0b4520bf3bc"}}