{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZJRCN2TAUBNKH73QOMHMOUMPL2","short_pith_number":"pith:ZJRCN2TA","canonical_record":{"source":{"id":"1704.05409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-18T16:21:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ceece546291872ebafa6d92a8e76a75d34b96b89109584482a4dadc8972b8aca","abstract_canon_sha256":"b00e84342dc9b84d342e69d59083a1a7c6846780c01ee9632d8de7ef8ba63b1a"},"schema_version":"1.0"},"canonical_sha256":"ca6226ea60a05aa3ff70730ec7518f5e89016551f17146c5269ca0c094c17aae","source":{"kind":"arxiv","id":"1704.05409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05409","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05409v1","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05409","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZJRCN2TAUBNK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJRCN2TAUBNKH73Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJRCN2TA","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZJRCN2TAUBNKH73QOMHMOUMPL2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-18T16:21:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ceece546291872ebafa6d92a8e76a75d34b96b89109584482a4dadc8972b8aca","abstract_canon_sha256":"b00e84342dc9b84d342e69d59083a1a7c6846780c01ee9632d8de7ef8ba63b1a"},"schema_version":"1.0"},"canonical_sha256":"ca6226ea60a05aa3ff70730ec7518f5e89016551f17146c5269ca0c094c17aae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:09.276573Z","signature_b64":"dSMe43j+EvB10//PU3uDkPGvc/aZYsnSTQ7igm/3r3PTAGAb9upJMnTnn6Js5+3zn1XM6yyYsosMgqX//A6/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca6226ea60a05aa3ff70730ec7518f5e89016551f17146c5269ca0c094c17aae","last_reissued_at":"2026-05-18T00:46:09.276186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:09.276186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05409","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:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NG/F8tD42MPv4IhsInU61s1ylJeJl2AAPnl6Q1zrVlnwKSQSPnGdgdXrnf31R/npw1sQk9TJI7Gfw5bhqKjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:30:32.211797Z"},"content_sha256":"8c26eef998da29a1d0235ea147608aac1eeef5f5b971b7a922c93254da92dfa3","schema_version":"1.0","event_id":"sha256:8c26eef998da29a1d0235ea147608aac1eeef5f5b971b7a922c93254da92dfa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZJRCN2TAUBNKH73QOMHMOUMPL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking to Learn: Feature Ranking and Selection via Eigenvector Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Giorgio Roffo, Simone Melzi","submitted_at":"2017-04-18T16:21:05Z","abstract_excerpt":"In an era where accumulating data is easy and storing it inexpensive, feature selection plays a central role in helping to reduce the high-dimensionality of huge amounts of otherwise meaningless data. In this paper, we propose a graph-based method for feature selection that ranks features by identifying the most important ones into arbitrary set of cues. Mapping the problem on an affinity graph-where features are the nodes-the solution is given by assessing the importance of nodes through some indicators of centrality, in particular, the Eigen-vector Centrality (EC). The gist of EC is to estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05409","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:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SMDWVkO+kE97d+zyX2Lx2O/yhD3XFP1YkkWPJ0m7HEgPzbXvRM/PkFyQ+8v0Sji5AbnjmU8c0CvZTxQ7w5pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:30:32.212153Z"},"content_sha256":"6b19a8a198f67b2ec8c46d653978c9f1bbf8e678d7334e0584c1474b8ebd3fd0","schema_version":"1.0","event_id":"sha256:6b19a8a198f67b2ec8c46d653978c9f1bbf8e678d7334e0584c1474b8ebd3fd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2/bundle.json","state_url":"https://pith.science/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2/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:30:32Z","links":{"resolver":"https://pith.science/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2","bundle":"https://pith.science/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2/bundle.json","state":"https://pith.science/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJRCN2TAUBNKH73QOMHMOUMPL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZJRCN2TAUBNKH73QOMHMOUMPL2","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":"b00e84342dc9b84d342e69d59083a1a7c6846780c01ee9632d8de7ef8ba63b1a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-18T16:21:05Z","title_canon_sha256":"ceece546291872ebafa6d92a8e76a75d34b96b89109584482a4dadc8972b8aca"},"schema_version":"1.0","source":{"id":"1704.05409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05409","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05409v1","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05409","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZJRCN2TAUBNK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJRCN2TAUBNKH73Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJRCN2TA","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:6b19a8a198f67b2ec8c46d653978c9f1bbf8e678d7334e0584c1474b8ebd3fd0","target":"graph","created_at":"2026-05-18T00:46: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":"In an era where accumulating data is easy and storing it inexpensive, feature selection plays a central role in helping to reduce the high-dimensionality of huge amounts of otherwise meaningless data. In this paper, we propose a graph-based method for feature selection that ranks features by identifying the most important ones into arbitrary set of cues. Mapping the problem on an affinity graph-where features are the nodes-the solution is given by assessing the importance of nodes through some indicators of centrality, in particular, the Eigen-vector Centrality (EC). The gist of EC is to estim","authors_text":"Giorgio Roffo, Simone Melzi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-18T16:21:05Z","title":"Ranking to Learn: Feature Ranking and Selection via Eigenvector Centrality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05409","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:8c26eef998da29a1d0235ea147608aac1eeef5f5b971b7a922c93254da92dfa3","target":"record","created_at":"2026-05-18T00:46: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":"b00e84342dc9b84d342e69d59083a1a7c6846780c01ee9632d8de7ef8ba63b1a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-18T16:21:05Z","title_canon_sha256":"ceece546291872ebafa6d92a8e76a75d34b96b89109584482a4dadc8972b8aca"},"schema_version":"1.0","source":{"id":"1704.05409","kind":"arxiv","version":1}},"canonical_sha256":"ca6226ea60a05aa3ff70730ec7518f5e89016551f17146c5269ca0c094c17aae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca6226ea60a05aa3ff70730ec7518f5e89016551f17146c5269ca0c094c17aae","first_computed_at":"2026-05-18T00:46:09.276186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:09.276186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dSMe43j+EvB10//PU3uDkPGvc/aZYsnSTQ7igm/3r3PTAGAb9upJMnTnn6Js5+3zn1XM6yyYsosMgqX//A6/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:09.276573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c26eef998da29a1d0235ea147608aac1eeef5f5b971b7a922c93254da92dfa3","sha256:6b19a8a198f67b2ec8c46d653978c9f1bbf8e678d7334e0584c1474b8ebd3fd0"],"state_sha256":"d039a1234de513b11a06c5e8cc2e1c04d5712f21f1f7d6b761b626cffef52ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dVBmp2EzXa9+uTI9J0ds7FF2W+TqpRB/wBQYC3P4+b5TK6cHU1HXhQBHUTmEbYcjqtoC4IepAG1CZ8ukYaoZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:30:32.214402Z","bundle_sha256":"421e9749f00be8dc2df18e89f2b1ccac0b0532cc38a1eafe92967505cbcef5d1"}}