{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZPJ4ITUSOXHWUHWOVTZEXAOQEJ","short_pith_number":"pith:ZPJ4ITUS","canonical_record":{"source":{"id":"1807.10602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-22T07:44:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b0394a97087ff04d1146140d74d5669b3c12bf9575fa6ff198e5dd10eb544de6","abstract_canon_sha256":"7032b14db5954786ac1ea347663273e432674de0d6a6ed952e808a564c2d50f2"},"schema_version":"1.0"},"canonical_sha256":"cbd3c44e9275cf6a1eceacf24b81d02243d2c905e2bd43651003cfb5dd4382d8","source":{"kind":"arxiv","id":"1807.10602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10602","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10602v1","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10602","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZPJ4ITUSOXHW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZPJ4ITUSOXHWUHWO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZPJ4ITUS","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZPJ4ITUSOXHWUHWOVTZEXAOQEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-22T07:44:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b0394a97087ff04d1146140d74d5669b3c12bf9575fa6ff198e5dd10eb544de6","abstract_canon_sha256":"7032b14db5954786ac1ea347663273e432674de0d6a6ed952e808a564c2d50f2"},"schema_version":"1.0"},"canonical_sha256":"cbd3c44e9275cf6a1eceacf24b81d02243d2c905e2bd43651003cfb5dd4382d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:40.040876Z","signature_b64":"L5WyLGqyLuFNrl28l5aZKmhpt2rUHmRnnlGsbOmoGYUHwGaoEenL4GBVJ+HHmr7b4DVTnvgLULeZ/n1WQXvABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbd3c44e9275cf6a1eceacf24b81d02243d2c905e2bd43651003cfb5dd4382d8","last_reissued_at":"2026-05-18T00:09:40.040217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:40.040217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10602","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:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4VIjxEtzUsQH6LrutS49oUfNRL8H+VtaCJCpUd9rY9hE58dJKou3v9R5t7atCLCYMqYM2bngpQqxJJCgtfTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:07.941578Z"},"content_sha256":"3467ff5167951a7db30862f56d17d2dfc0ea5aec2b427181f0ca6e1708f9a0b1","schema_version":"1.0","event_id":"sha256:3467ff5167951a7db30862f56d17d2dfc0ea5aec2b427181f0ca6e1708f9a0b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZPJ4ITUSOXHWUHWOVTZEXAOQEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Trace Lasso Regularized L1-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Aurobinda Routray, Nilesh Suthar, Ramanarayan Mohanty, S L Happy","submitted_at":"2018-07-22T07:44:56Z","abstract_excerpt":"This work proposes an adaptive trace lasso regularized L1-norm based graph cut method for dimensionality reduction of Hyperspectral images, called as `Trace Lasso-L1 Graph Cut' (TL-L1GC). The underlying idea of this method is to generate the optimal projection matrix by considering both the sparsity as well as the correlation of the data samples. The conventional L2-norm used in the objective function is sensitive to noise and outliers. Therefore, in this work L1-norm is utilized as a robust alternative to L2-norm. Besides, for further improvement of the results, we use a penalty function of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10602","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:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIr4zIKSdz9ylMfrdJ82FSCvaLhmBzs7jWChGM+9IhN+r4emsftuHRPKaB08cfe6N1+gAe/9x86gmg8pdF5ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:07.942210Z"},"content_sha256":"5f129ab17d2a7051a0309ce5255a4f4fa1c21330b1c07df0f6d096019dd6a238","schema_version":"1.0","event_id":"sha256:5f129ab17d2a7051a0309ce5255a4f4fa1c21330b1c07df0f6d096019dd6a238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ/bundle.json","state_url":"https://pith.science/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ/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-30T04:15:07Z","links":{"resolver":"https://pith.science/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ","bundle":"https://pith.science/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ/bundle.json","state":"https://pith.science/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPJ4ITUSOXHWUHWOVTZEXAOQEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZPJ4ITUSOXHWUHWOVTZEXAOQEJ","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":"7032b14db5954786ac1ea347663273e432674de0d6a6ed952e808a564c2d50f2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-22T07:44:56Z","title_canon_sha256":"b0394a97087ff04d1146140d74d5669b3c12bf9575fa6ff198e5dd10eb544de6"},"schema_version":"1.0","source":{"id":"1807.10602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10602","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10602v1","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10602","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZPJ4ITUSOXHW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZPJ4ITUSOXHWUHWO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZPJ4ITUS","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:5f129ab17d2a7051a0309ce5255a4f4fa1c21330b1c07df0f6d096019dd6a238","target":"graph","created_at":"2026-05-18T00:09:40Z","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":"This work proposes an adaptive trace lasso regularized L1-norm based graph cut method for dimensionality reduction of Hyperspectral images, called as `Trace Lasso-L1 Graph Cut' (TL-L1GC). The underlying idea of this method is to generate the optimal projection matrix by considering both the sparsity as well as the correlation of the data samples. The conventional L2-norm used in the objective function is sensitive to noise and outliers. Therefore, in this work L1-norm is utilized as a robust alternative to L2-norm. Besides, for further improvement of the results, we use a penalty function of t","authors_text":"Aurobinda Routray, Nilesh Suthar, Ramanarayan Mohanty, S L Happy","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-22T07:44:56Z","title":"A Trace Lasso Regularized L1-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10602","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:3467ff5167951a7db30862f56d17d2dfc0ea5aec2b427181f0ca6e1708f9a0b1","target":"record","created_at":"2026-05-18T00:09:40Z","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":"7032b14db5954786ac1ea347663273e432674de0d6a6ed952e808a564c2d50f2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-22T07:44:56Z","title_canon_sha256":"b0394a97087ff04d1146140d74d5669b3c12bf9575fa6ff198e5dd10eb544de6"},"schema_version":"1.0","source":{"id":"1807.10602","kind":"arxiv","version":1}},"canonical_sha256":"cbd3c44e9275cf6a1eceacf24b81d02243d2c905e2bd43651003cfb5dd4382d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbd3c44e9275cf6a1eceacf24b81d02243d2c905e2bd43651003cfb5dd4382d8","first_computed_at":"2026-05-18T00:09:40.040217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:40.040217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L5WyLGqyLuFNrl28l5aZKmhpt2rUHmRnnlGsbOmoGYUHwGaoEenL4GBVJ+HHmr7b4DVTnvgLULeZ/n1WQXvABw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:40.040876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3467ff5167951a7db30862f56d17d2dfc0ea5aec2b427181f0ca6e1708f9a0b1","sha256:5f129ab17d2a7051a0309ce5255a4f4fa1c21330b1c07df0f6d096019dd6a238"],"state_sha256":"013367ef05d2839fd97fc2c121531d4a83aa2855fb837b8fad8ec7fa8f1969bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUPbkX0wVe1hkpWrFxD2WsPF4WhxlBJKyTcDLEWw6ta1rpCeNkjVjGHG0Z7YF64JAERWMyTJYtXUZp1JVxwABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:15:07.945466Z","bundle_sha256":"9c9d21364908d08b5936ebcee8fea311f3aa419236d966ccec15e29aa2a08246"}}