{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PPV5IMWSLS6NFG5CLTU3M4EXOK","short_pith_number":"pith:PPV5IMWS","canonical_record":{"source":{"id":"1506.02585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T16:51:40Z","cross_cats_sorted":[],"title_canon_sha256":"6e5788066b4c36b583fbed8ad54039a0e6c5c36774a0981012d7955a5484d952","abstract_canon_sha256":"85b6b7e6464b05dfd2ab3ed8c3434b30a8bc15b1607a10c6804f35b9cf4f3693"},"schema_version":"1.0"},"canonical_sha256":"7bebd432d25cbcd29ba25ce9b67097729bc6874f139520505d955c671f43f1c7","source":{"kind":"arxiv","id":"1506.02585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02585","created_at":"2026-05-18T01:55:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02585v1","created_at":"2026-05-18T01:55:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02585","created_at":"2026-05-18T01:55:50Z"},{"alias_kind":"pith_short_12","alias_value":"PPV5IMWSLS6N","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPV5IMWSLS6NFG5C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPV5IMWS","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PPV5IMWSLS6NFG5CLTU3M4EXOK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T16:51:40Z","cross_cats_sorted":[],"title_canon_sha256":"6e5788066b4c36b583fbed8ad54039a0e6c5c36774a0981012d7955a5484d952","abstract_canon_sha256":"85b6b7e6464b05dfd2ab3ed8c3434b30a8bc15b1607a10c6804f35b9cf4f3693"},"schema_version":"1.0"},"canonical_sha256":"7bebd432d25cbcd29ba25ce9b67097729bc6874f139520505d955c671f43f1c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:50.613593Z","signature_b64":"+8YRaqtSs7F/pAj1y+gWmh2qko4fYTjuykrQWlBDCMgBu//rezqQOp9aH8jdFhWAaMwQEL0Lr9KU5tJyMNPRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bebd432d25cbcd29ba25ce9b67097729bc6874f139520505d955c671f43f1c7","last_reissued_at":"2026-05-18T01:55:50.612832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:50.612832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02585","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-18T01:55:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEH4hJRXxjQmF9xXlW2wIn77UAj3v2i6dm77accWDF4NdVKFXZ4GoaV/B+LJJ/RkL/vFY2PUwCG96ROf2kdrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:40:00.548712Z"},"content_sha256":"df3c24293c0cd2690bfba085c1e24c171d5e168ae520db662d318c1bb4859170","schema_version":"1.0","event_id":"sha256:df3c24293c0cd2690bfba085c1e24c171d5e168ae520db662d318c1bb4859170"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PPV5IMWSLS6NFG5CLTU3M4EXOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Sparse Kernel Learning for Hyperspectral Anomaly Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Heesung Kwon, Prudhvi Gurram, Wotao Yin, Zhimin Peng","submitted_at":"2015-06-08T16:51:40Z","abstract_excerpt":"In this paper, a novel framework of sparse kernel learning for Support Vector Data Description (SVDD) based anomaly detection is presented. In this work, optimal sparse feature selection for anomaly detection is first modeled as a Mixed Integer Programming (MIP) problem. Due to the prohibitively high computational complexity of the MIP, it is relaxed into a Quadratically Constrained Linear Programming (QCLP) problem. The QCLP problem can then be practically solved by using an iterative optimization method, in which multiple subsets of features are iteratively found as opposed to a single subse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02585","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-18T01:55:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFH9B9R+kKxFjaODysZMqcUXAx150/jnbxrYEBtmAcliUBweBmqsyiAoD+ydz2KSzWNbVXpinDCmBu6tpvl+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:40:00.549415Z"},"content_sha256":"0168967cbc4f934e000c30daa89ee15a659e5140dddba8ee682dd91eae5b706e","schema_version":"1.0","event_id":"sha256:0168967cbc4f934e000c30daa89ee15a659e5140dddba8ee682dd91eae5b706e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK/bundle.json","state_url":"https://pith.science/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK/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-25T18:40:00Z","links":{"resolver":"https://pith.science/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK","bundle":"https://pith.science/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK/bundle.json","state":"https://pith.science/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPV5IMWSLS6NFG5CLTU3M4EXOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PPV5IMWSLS6NFG5CLTU3M4EXOK","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":"85b6b7e6464b05dfd2ab3ed8c3434b30a8bc15b1607a10c6804f35b9cf4f3693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T16:51:40Z","title_canon_sha256":"6e5788066b4c36b583fbed8ad54039a0e6c5c36774a0981012d7955a5484d952"},"schema_version":"1.0","source":{"id":"1506.02585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02585","created_at":"2026-05-18T01:55:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02585v1","created_at":"2026-05-18T01:55:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02585","created_at":"2026-05-18T01:55:50Z"},{"alias_kind":"pith_short_12","alias_value":"PPV5IMWSLS6N","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPV5IMWSLS6NFG5C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPV5IMWS","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:0168967cbc4f934e000c30daa89ee15a659e5140dddba8ee682dd91eae5b706e","target":"graph","created_at":"2026-05-18T01:55:50Z","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 this paper, a novel framework of sparse kernel learning for Support Vector Data Description (SVDD) based anomaly detection is presented. In this work, optimal sparse feature selection for anomaly detection is first modeled as a Mixed Integer Programming (MIP) problem. Due to the prohibitively high computational complexity of the MIP, it is relaxed into a Quadratically Constrained Linear Programming (QCLP) problem. The QCLP problem can then be practically solved by using an iterative optimization method, in which multiple subsets of features are iteratively found as opposed to a single subse","authors_text":"Heesung Kwon, Prudhvi Gurram, Wotao Yin, Zhimin Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T16:51:40Z","title":"Optimal Sparse Kernel Learning for Hyperspectral Anomaly Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02585","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:df3c24293c0cd2690bfba085c1e24c171d5e168ae520db662d318c1bb4859170","target":"record","created_at":"2026-05-18T01:55:50Z","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":"85b6b7e6464b05dfd2ab3ed8c3434b30a8bc15b1607a10c6804f35b9cf4f3693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T16:51:40Z","title_canon_sha256":"6e5788066b4c36b583fbed8ad54039a0e6c5c36774a0981012d7955a5484d952"},"schema_version":"1.0","source":{"id":"1506.02585","kind":"arxiv","version":1}},"canonical_sha256":"7bebd432d25cbcd29ba25ce9b67097729bc6874f139520505d955c671f43f1c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bebd432d25cbcd29ba25ce9b67097729bc6874f139520505d955c671f43f1c7","first_computed_at":"2026-05-18T01:55:50.612832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:50.612832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+8YRaqtSs7F/pAj1y+gWmh2qko4fYTjuykrQWlBDCMgBu//rezqQOp9aH8jdFhWAaMwQEL0Lr9KU5tJyMNPRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:50.613593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df3c24293c0cd2690bfba085c1e24c171d5e168ae520db662d318c1bb4859170","sha256:0168967cbc4f934e000c30daa89ee15a659e5140dddba8ee682dd91eae5b706e"],"state_sha256":"42be80778ae916d11906577e3042bd19412cdb2e12d4cffc822abb036233cf0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubzSAulwzk0nKmqEyAC2tj6+TfezMuBVJdrfMwHywxXc91NLPrHs0wdP36XJ80cTKGaFflgFTSDFVwwH09pDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:40:00.553014Z","bundle_sha256":"ffea5d68d0702da21affcadc092c2e14a7fbd63978b5cfad99a9afbc05973df8"}}