{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H76XBCJ2BJQB7HQRJY57VPC5YO","short_pith_number":"pith:H76XBCJ2","canonical_record":{"source":{"id":"1310.2880","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T16:47:22Z","cross_cats_sorted":["cs.CV","cs.LG","math.ST","stat.TH"],"title_canon_sha256":"cb2751c0681d3d0db3afd9b9423c2fdfad54a07f7984b2fd32ff97d271101c80","abstract_canon_sha256":"27b5cd1c19f9f51ad4c1d85600e0104270773ee12c191c5387333e09c31d8f1d"},"schema_version":"1.0"},"canonical_sha256":"3ffd70893a0a601f9e114e3bfabc5dc38c3ae6b61c74bcfb0a0456d8f2fdf356","source":{"kind":"arxiv","id":"1310.2880","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2880","created_at":"2026-05-18T00:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2880v7","created_at":"2026-05-18T00:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2880","created_at":"2026-05-18T00:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"H76XBCJ2BJQB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H76XBCJ2BJQB7HQR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H76XBCJ2","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H76XBCJ2BJQB7HQRJY57VPC5YO","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2880","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T16:47:22Z","cross_cats_sorted":["cs.CV","cs.LG","math.ST","stat.TH"],"title_canon_sha256":"cb2751c0681d3d0db3afd9b9423c2fdfad54a07f7984b2fd32ff97d271101c80","abstract_canon_sha256":"27b5cd1c19f9f51ad4c1d85600e0104270773ee12c191c5387333e09c31d8f1d"},"schema_version":"1.0"},"canonical_sha256":"3ffd70893a0a601f9e114e3bfabc5dc38c3ae6b61c74bcfb0a0456d8f2fdf356","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:28.843047Z","signature_b64":"rYbB+fqhneZFhs+ZCjWCmibkDFq8xaIWGhsLT1ySGPiPcVz1I1hU11JELzhKQfZ3wSRe3rNwhGoDrst6KL2VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ffd70893a0a601f9e114e3bfabc5dc38c3ae6b61c74bcfb0a0456d8f2fdf356","last_reissued_at":"2026-05-18T00:51:28.842409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:28.842409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2880","source_version":7,"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:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12lQ4/SWcFdXm+HSCyGeiO0knINKI7s21ZtMRx9BnpgGcE2HkZbTu04seSQ6Xy3z2ojsEi0h02A9NzCbev8UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:07:36.808964Z"},"content_sha256":"f1815abec9a6d50209f99644b5b7244676388d19c8fb2732b8059d3c50dbf78d","schema_version":"1.0","event_id":"sha256:f1815abec9a6d50209f99644b5b7244676388d19c8fb2732b8059d3c50dbf78d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H76XBCJ2BJQB7HQRJY57VPC5YO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Selection with Annealing for Computer Vision and Big Data Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Adrian Barbu, Gary Gramajo, Liangjing Ding, Yiyuan She","submitted_at":"2013-10-10T16:47:22Z","abstract_excerpt":"Many computer vision and medical imaging problems are faced with learning from large-scale datasets, with millions of observations and features. In this paper we propose a novel efficient learning scheme that tightens a sparsity constraint by gradually removing variables based on a criterion and a schedule. The attractive fact that the problem size keeps dropping throughout the iterations makes it particularly suitable for big data learning. Our approach applies generically to the optimization of any differentiable loss function, and finds applications in regression, classification and ranking"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2880","kind":"arxiv","version":7},"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:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCWLVuUumoRfZH0wjYVjnfCFJ9Zi80z6ozFywVLDIVuHK55cV2x25OiNl2Pu0aW134qGCEkTRyWNTkjgmZG7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:07:36.809324Z"},"content_sha256":"0007e51ad55232dea9382ea5e613dea2987e765ad817faef48bfae5f50ac2abf","schema_version":"1.0","event_id":"sha256:0007e51ad55232dea9382ea5e613dea2987e765ad817faef48bfae5f50ac2abf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H76XBCJ2BJQB7HQRJY57VPC5YO/bundle.json","state_url":"https://pith.science/pith/H76XBCJ2BJQB7HQRJY57VPC5YO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H76XBCJ2BJQB7HQRJY57VPC5YO/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-03T00:07:36Z","links":{"resolver":"https://pith.science/pith/H76XBCJ2BJQB7HQRJY57VPC5YO","bundle":"https://pith.science/pith/H76XBCJ2BJQB7HQRJY57VPC5YO/bundle.json","state":"https://pith.science/pith/H76XBCJ2BJQB7HQRJY57VPC5YO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H76XBCJ2BJQB7HQRJY57VPC5YO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H76XBCJ2BJQB7HQRJY57VPC5YO","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":"27b5cd1c19f9f51ad4c1d85600e0104270773ee12c191c5387333e09c31d8f1d","cross_cats_sorted":["cs.CV","cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T16:47:22Z","title_canon_sha256":"cb2751c0681d3d0db3afd9b9423c2fdfad54a07f7984b2fd32ff97d271101c80"},"schema_version":"1.0","source":{"id":"1310.2880","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2880","created_at":"2026-05-18T00:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2880v7","created_at":"2026-05-18T00:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2880","created_at":"2026-05-18T00:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"H76XBCJ2BJQB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H76XBCJ2BJQB7HQR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H76XBCJ2","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:0007e51ad55232dea9382ea5e613dea2987e765ad817faef48bfae5f50ac2abf","target":"graph","created_at":"2026-05-18T00:51:28Z","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":"Many computer vision and medical imaging problems are faced with learning from large-scale datasets, with millions of observations and features. In this paper we propose a novel efficient learning scheme that tightens a sparsity constraint by gradually removing variables based on a criterion and a schedule. The attractive fact that the problem size keeps dropping throughout the iterations makes it particularly suitable for big data learning. Our approach applies generically to the optimization of any differentiable loss function, and finds applications in regression, classification and ranking","authors_text":"Adrian Barbu, Gary Gramajo, Liangjing Ding, Yiyuan She","cross_cats":["cs.CV","cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T16:47:22Z","title":"Feature Selection with Annealing for Computer Vision and Big Data Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2880","kind":"arxiv","version":7},"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:f1815abec9a6d50209f99644b5b7244676388d19c8fb2732b8059d3c50dbf78d","target":"record","created_at":"2026-05-18T00:51:28Z","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":"27b5cd1c19f9f51ad4c1d85600e0104270773ee12c191c5387333e09c31d8f1d","cross_cats_sorted":["cs.CV","cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T16:47:22Z","title_canon_sha256":"cb2751c0681d3d0db3afd9b9423c2fdfad54a07f7984b2fd32ff97d271101c80"},"schema_version":"1.0","source":{"id":"1310.2880","kind":"arxiv","version":7}},"canonical_sha256":"3ffd70893a0a601f9e114e3bfabc5dc38c3ae6b61c74bcfb0a0456d8f2fdf356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ffd70893a0a601f9e114e3bfabc5dc38c3ae6b61c74bcfb0a0456d8f2fdf356","first_computed_at":"2026-05-18T00:51:28.842409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:28.842409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rYbB+fqhneZFhs+ZCjWCmibkDFq8xaIWGhsLT1ySGPiPcVz1I1hU11JELzhKQfZ3wSRe3rNwhGoDrst6KL2VDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:28.843047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2880","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1815abec9a6d50209f99644b5b7244676388d19c8fb2732b8059d3c50dbf78d","sha256:0007e51ad55232dea9382ea5e613dea2987e765ad817faef48bfae5f50ac2abf"],"state_sha256":"5b58ccb7693057c20564d8eae1b17ff3e90a34a36ae5294d161f9920615daccc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svKgINEUj63r1Tck2P0MPpAHEdmZkvY0gTl7n+PalN+d5gXD8glKCbvpd4bkfvdvRCAhcTmaTITHqjQgr+aCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:07:36.811331Z","bundle_sha256":"dce39e53294a8f108a938f9be6c7d7a8492cd8259e8d0353894c812cfa52d0e3"}}