{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E2QHWZ6IYCPCDZMHWPDISCO66S","short_pith_number":"pith:E2QHWZ6I","canonical_record":{"source":{"id":"1801.02251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T21:14:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"86e8ae8bad2653aea90e2d11e0076893f3853c4eb0c69fc48a3117f82734271d","abstract_canon_sha256":"19ba517a1525939073089460a0f454bde0046797563dfbb51a320e87c58412aa"},"schema_version":"1.0"},"canonical_sha256":"26a07b67c8c09e21e587b3c68909def4a81d937eeba788b32b3f7f1c8a7b1113","source":{"kind":"arxiv","id":"1801.02251","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02251","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02251v2","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02251","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"E2QHWZ6IYCPC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2QHWZ6IYCPCDZMH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2QHWZ6I","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E2QHWZ6IYCPCDZMHWPDISCO66S","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T21:14:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"86e8ae8bad2653aea90e2d11e0076893f3853c4eb0c69fc48a3117f82734271d","abstract_canon_sha256":"19ba517a1525939073089460a0f454bde0046797563dfbb51a320e87c58412aa"},"schema_version":"1.0"},"canonical_sha256":"26a07b67c8c09e21e587b3c68909def4a81d937eeba788b32b3f7f1c8a7b1113","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:53.695027Z","signature_b64":"ik9Y4ilVHWYtoM6pO0DkKgxDGbijVR7d1Lz218EN1Wep1qhb4c/iH22kkcCbcKOJKhiTgFdoq3ye4dof1o/ZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26a07b67c8c09e21e587b3c68909def4a81d937eeba788b32b3f7f1c8a7b1113","last_reissued_at":"2026-05-18T00:17:53.694095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:53.694095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02251","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-18T00:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lg+GgzhJ9Ne3clokZeDRtReFX3hji+BvNnxItXLnZDwE5iIzhKHRbt730RhVz+ES7mqPTIA3e66nRyJNZCybAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:25:26.159642Z"},"content_sha256":"2af8bcd7eba536e709175a50dd41decffe78216b3ae1d20576aefdab999cabb4","schema_version":"1.0","event_id":"sha256:2af8bcd7eba536e709175a50dd41decffe78216b3ae1d20576aefdab999cabb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E2QHWZ6IYCPCDZMHWPDISCO66S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Autoencoder-Based Unsupervised Feature Selection with Broad and Local Data Structure Preservation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Marco F.Duarte, Siwei Feng","submitted_at":"2018-01-07T21:14:01Z","abstract_excerpt":"Feature selection is a dimensionality reduction technique that selects a subset of representative features from high dimensional data by eliminating irrelevant and redundant features. Recently, feature selection combined with sparse learning has attracted significant attention due to its outstanding performance compared with traditional feature selection methods that ignores correlation between features. These works first map data onto a low-dimensional subspace and then select features by posing a sparsity constraint on the transformation matrix. However, they are restricted by design to line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02251","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-18T00:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mG+U+Zq17ORKrD6Hf3QZcqvcGWBSHSe/TS/BMM07z1ed9y1TGMnlEZYGB4d6d5GOOZyNTSlYzhIWRE70+IG2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:25:26.160420Z"},"content_sha256":"e869abcd3792a9d0cef7f3c9cae6a54ce63c724f079bf2e11bfcb8848c7fa4c3","schema_version":"1.0","event_id":"sha256:e869abcd3792a9d0cef7f3c9cae6a54ce63c724f079bf2e11bfcb8848c7fa4c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2QHWZ6IYCPCDZMHWPDISCO66S/bundle.json","state_url":"https://pith.science/pith/E2QHWZ6IYCPCDZMHWPDISCO66S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2QHWZ6IYCPCDZMHWPDISCO66S/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-05-31T23:25:26Z","links":{"resolver":"https://pith.science/pith/E2QHWZ6IYCPCDZMHWPDISCO66S","bundle":"https://pith.science/pith/E2QHWZ6IYCPCDZMHWPDISCO66S/bundle.json","state":"https://pith.science/pith/E2QHWZ6IYCPCDZMHWPDISCO66S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2QHWZ6IYCPCDZMHWPDISCO66S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E2QHWZ6IYCPCDZMHWPDISCO66S","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":"19ba517a1525939073089460a0f454bde0046797563dfbb51a320e87c58412aa","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T21:14:01Z","title_canon_sha256":"86e8ae8bad2653aea90e2d11e0076893f3853c4eb0c69fc48a3117f82734271d"},"schema_version":"1.0","source":{"id":"1801.02251","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02251","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02251v2","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02251","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"E2QHWZ6IYCPC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2QHWZ6IYCPCDZMH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2QHWZ6I","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:e869abcd3792a9d0cef7f3c9cae6a54ce63c724f079bf2e11bfcb8848c7fa4c3","target":"graph","created_at":"2026-05-18T00:17:53Z","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 a dimensionality reduction technique that selects a subset of representative features from high dimensional data by eliminating irrelevant and redundant features. Recently, feature selection combined with sparse learning has attracted significant attention due to its outstanding performance compared with traditional feature selection methods that ignores correlation between features. These works first map data onto a low-dimensional subspace and then select features by posing a sparsity constraint on the transformation matrix. However, they are restricted by design to line","authors_text":"Marco F.Duarte, Siwei Feng","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T21:14:01Z","title":"Graph Autoencoder-Based Unsupervised Feature Selection with Broad and Local Data Structure Preservation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02251","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:2af8bcd7eba536e709175a50dd41decffe78216b3ae1d20576aefdab999cabb4","target":"record","created_at":"2026-05-18T00:17:53Z","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":"19ba517a1525939073089460a0f454bde0046797563dfbb51a320e87c58412aa","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-07T21:14:01Z","title_canon_sha256":"86e8ae8bad2653aea90e2d11e0076893f3853c4eb0c69fc48a3117f82734271d"},"schema_version":"1.0","source":{"id":"1801.02251","kind":"arxiv","version":2}},"canonical_sha256":"26a07b67c8c09e21e587b3c68909def4a81d937eeba788b32b3f7f1c8a7b1113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26a07b67c8c09e21e587b3c68909def4a81d937eeba788b32b3f7f1c8a7b1113","first_computed_at":"2026-05-18T00:17:53.694095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:53.694095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ik9Y4ilVHWYtoM6pO0DkKgxDGbijVR7d1Lz218EN1Wep1qhb4c/iH22kkcCbcKOJKhiTgFdoq3ye4dof1o/ZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:53.695027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02251","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af8bcd7eba536e709175a50dd41decffe78216b3ae1d20576aefdab999cabb4","sha256:e869abcd3792a9d0cef7f3c9cae6a54ce63c724f079bf2e11bfcb8848c7fa4c3"],"state_sha256":"989a92054cf7814817e16f4a9b0b62a49447818d4b4a2c782634ef0baf12453f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+Kg1ud8z9ijdSSeknTINqWXj/nR4ykjpgucrS+z82ACfUmGvwAu5b+KSHjXplh21X6xIkxHRm4DzDejebv1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:25:26.164324Z","bundle_sha256":"73832ca096d6468c8b7d175ffb58d147ae9b4dd150979e321c0c3e89f46fff44"}}