{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UAPGFE6EJMZOKOUWWWTIQR2WN2","short_pith_number":"pith:UAPGFE6E","canonical_record":{"source":{"id":"1707.07538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-24T13:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"ae2241f8536e08adec1622934f118503bfb83546d93aac359100e7156c5ef42c","abstract_canon_sha256":"7936f40aaed3166448b30912c76b98c36c972a3886a34ca2e951d2ef23472f25"},"schema_version":"1.0"},"canonical_sha256":"a01e6293c44b32e53a96b5a68847566eb76cce3e0e92684b2f5be7103c062462","source":{"kind":"arxiv","id":"1707.07538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07538","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07538v1","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07538","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"UAPGFE6EJMZO","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAPGFE6EJMZOKOUW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAPGFE6E","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UAPGFE6EJMZOKOUWWWTIQR2WN2","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-24T13:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"ae2241f8536e08adec1622934f118503bfb83546d93aac359100e7156c5ef42c","abstract_canon_sha256":"7936f40aaed3166448b30912c76b98c36c972a3886a34ca2e951d2ef23472f25"},"schema_version":"1.0"},"canonical_sha256":"a01e6293c44b32e53a96b5a68847566eb76cce3e0e92684b2f5be7103c062462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:41.941617Z","signature_b64":"qNCXwyfpUwAdvlC5ds3WZA0EoF2KHhfLs9VZyRLO7UwtdpM4mkcoYa6CPOmGYEnYOcl+mUCKOhOLlvwZvKeEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a01e6293c44b32e53a96b5a68847566eb76cce3e0e92684b2f5be7103c062462","last_reissued_at":"2026-05-18T00:39:41.940933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:41.940933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07538","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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Im9ZH2FBkaZ+yZspkZut9ipIMKNQxIj/t1VCAQ5n/Vuj4ZWsQwXmb3SgTbVJUJBOHK6rS8u02ntaYF62gvHQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:31.511345Z"},"content_sha256":"fa6fc49ca76c28e8dae9d00942d3be1179e2b469969624b418e5cce3b4519e32","schema_version":"1.0","event_id":"sha256:fa6fc49ca76c28e8dae9d00942d3be1179e2b469969624b418e5cce3b4519e32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UAPGFE6EJMZOKOUWWWTIQR2WN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alessandro Vinciarelli, Giorgio Roffo, Simone Melzi, Umberto Castellani","submitted_at":"2017-07-24T13:21:25Z","abstract_excerpt":"Feature selection is playing an increasingly significant role with respect to many computer vision applications spanning from object recognition to visual object tracking. However, most of the recent solutions in feature selection are not robust across different and heterogeneous set of data. In this paper, we address this issue proposing a robust probabilistic latent graph-based feature selection algorithm that performs the ranking step while considering all the possible subsets of features, as paths on a graph, bypassing the combinatorial problem analytically. An appealing characteristic of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07538","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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebtNRpE97HYIkfH2IyP3VVCiINJeHAvdrZF/4be2TJ2uQDP1NGI85X3bEQq4Mav3ETVC13cRqFJqF7AWTEyGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:31.511697Z"},"content_sha256":"e71ab32dde02b3a2920b8c8ff0b6ca151d88312e41f7b08c2b3a2e4f2c0b01c6","schema_version":"1.0","event_id":"sha256:e71ab32dde02b3a2920b8c8ff0b6ca151d88312e41f7b08c2b3a2e4f2c0b01c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2/bundle.json","state_url":"https://pith.science/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2/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-01T21:06:31Z","links":{"resolver":"https://pith.science/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2","bundle":"https://pith.science/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2/bundle.json","state":"https://pith.science/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAPGFE6EJMZOKOUWWWTIQR2WN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UAPGFE6EJMZOKOUWWWTIQR2WN2","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":"7936f40aaed3166448b30912c76b98c36c972a3886a34ca2e951d2ef23472f25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-24T13:21:25Z","title_canon_sha256":"ae2241f8536e08adec1622934f118503bfb83546d93aac359100e7156c5ef42c"},"schema_version":"1.0","source":{"id":"1707.07538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07538","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07538v1","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07538","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"UAPGFE6EJMZO","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAPGFE6EJMZOKOUW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAPGFE6E","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e71ab32dde02b3a2920b8c8ff0b6ca151d88312e41f7b08c2b3a2e4f2c0b01c6","target":"graph","created_at":"2026-05-18T00:39:41Z","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 playing an increasingly significant role with respect to many computer vision applications spanning from object recognition to visual object tracking. However, most of the recent solutions in feature selection are not robust across different and heterogeneous set of data. In this paper, we address this issue proposing a robust probabilistic latent graph-based feature selection algorithm that performs the ranking step while considering all the possible subsets of features, as paths on a graph, bypassing the combinatorial problem analytically. An appealing characteristic of ","authors_text":"Alessandro Vinciarelli, Giorgio Roffo, Simone Melzi, Umberto Castellani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-24T13:21:25Z","title":"Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07538","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:fa6fc49ca76c28e8dae9d00942d3be1179e2b469969624b418e5cce3b4519e32","target":"record","created_at":"2026-05-18T00:39:41Z","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":"7936f40aaed3166448b30912c76b98c36c972a3886a34ca2e951d2ef23472f25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-24T13:21:25Z","title_canon_sha256":"ae2241f8536e08adec1622934f118503bfb83546d93aac359100e7156c5ef42c"},"schema_version":"1.0","source":{"id":"1707.07538","kind":"arxiv","version":1}},"canonical_sha256":"a01e6293c44b32e53a96b5a68847566eb76cce3e0e92684b2f5be7103c062462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a01e6293c44b32e53a96b5a68847566eb76cce3e0e92684b2f5be7103c062462","first_computed_at":"2026-05-18T00:39:41.940933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:41.940933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qNCXwyfpUwAdvlC5ds3WZA0EoF2KHhfLs9VZyRLO7UwtdpM4mkcoYa6CPOmGYEnYOcl+mUCKOhOLlvwZvKeEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:41.941617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa6fc49ca76c28e8dae9d00942d3be1179e2b469969624b418e5cce3b4519e32","sha256:e71ab32dde02b3a2920b8c8ff0b6ca151d88312e41f7b08c2b3a2e4f2c0b01c6"],"state_sha256":"afd72889ec06c6bc3c357a475d6d6575051a4852567ad77f2a7e3f495394a830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgLpEl+TtDxGFCntALZG8o0Jd1nphwEfWXLLtXjx95Gn25s2NkjgpQTr/Pg8Zl9bmQHm9xZzXs0bHqoIXDF/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:06:31.513558Z","bundle_sha256":"7b9a542778b9afeacc4588e635add00fb5544d415ed3f32093ebfb3661303813"}}