{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PHJBL7W3VNXXSMWDPQTZFG6XCA","short_pith_number":"pith:PHJBL7W3","canonical_record":{"source":{"id":"1504.01515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-07T08:23:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"aab12209d600b66fe0513354f6c7108df23e708829c27de1310d18e988fdaac5","abstract_canon_sha256":"64e920dfcdbb2c499f0ac4fa233fb797a5a408c65be89973ba78b0509037db80"},"schema_version":"1.0"},"canonical_sha256":"79d215fedbab6f7932c37c27929bd71038593cd0d9e899e22e69c6d98ec54df0","source":{"kind":"arxiv","id":"1504.01515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01515","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01515v2","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01515","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"PHJBL7W3VNXX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PHJBL7W3VNXXSMWD","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PHJBL7W3","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PHJBL7W3VNXXSMWDPQTZFG6XCA","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-07T08:23:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"aab12209d600b66fe0513354f6c7108df23e708829c27de1310d18e988fdaac5","abstract_canon_sha256":"64e920dfcdbb2c499f0ac4fa233fb797a5a408c65be89973ba78b0509037db80"},"schema_version":"1.0"},"canonical_sha256":"79d215fedbab6f7932c37c27929bd71038593cd0d9e899e22e69c6d98ec54df0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:13.416844Z","signature_b64":"X6ypxWRaUxa8eJSFv3MbpEvXhlKHQUfz2ndp1lR/AV5R7YRm0fE3A8tOd/x5AVMi1gN8sTJdk36j7lycBrGFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79d215fedbab6f7932c37c27929bd71038593cd0d9e899e22e69c6d98ec54df0","last_reissued_at":"2026-05-18T01:08:13.416298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:13.416298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01515","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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSq6STVHNgfQ1PnJxnuZzK6Mw3kJXiMRPUo3JynQDWrVwrP8FVjD4XjcI9/yfehqhR3Te0TCBZwaKi2Pn9zcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:36:47.646741Z"},"content_sha256":"fca0f0a54f8846fe391c377cfe3f68db02442ba3389788eeb8fbb40d08856d39","schema_version":"1.0","event_id":"sha256:fca0f0a54f8846fe391c377cfe3f68db02442ba3389788eeb8fbb40d08856d39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PHJBL7W3VNXXSMWDPQTZFG6XCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.CV","authors_text":"Athanasios Rontogiannis, Konstantinos Koutroumbas, Konstantinos Themelis, Paris Giampouras","submitted_at":"2015-04-07T08:23:45Z","abstract_excerpt":"In a plethora of applications dealing with inverse problems, e.g. in image processing, social networks, compressive sensing, biological data processing etc., the signal of interest is known to be structured in several ways at the same time. This premise has recently guided the research to the innovative and meaningful idea of imposing multiple constraints on the parameters involved in the problem under study. For instance, when dealing with problems whose parameters form sparse and low-rank matrices, the adoption of suitably combined constraints imposing sparsity and low-rankness, is expected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01515","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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22SmYzpOZuMNM0K5WPtQYFhvYASsoP2c/o7AGXGtNn7CqPWJ4Q9J/lPgU2Q25WT+OahHv6/YugmmCZMd2TUdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:36:47.647089Z"},"content_sha256":"f9c754365c066753852653b6a57cdd49b73ecd94ff45d237bbd8c0b03369da8c","schema_version":"1.0","event_id":"sha256:f9c754365c066753852653b6a57cdd49b73ecd94ff45d237bbd8c0b03369da8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA/bundle.json","state_url":"https://pith.science/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA/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-03T06:36:47Z","links":{"resolver":"https://pith.science/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA","bundle":"https://pith.science/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA/bundle.json","state":"https://pith.science/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHJBL7W3VNXXSMWDPQTZFG6XCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PHJBL7W3VNXXSMWDPQTZFG6XCA","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":"64e920dfcdbb2c499f0ac4fa233fb797a5a408c65be89973ba78b0509037db80","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-07T08:23:45Z","title_canon_sha256":"aab12209d600b66fe0513354f6c7108df23e708829c27de1310d18e988fdaac5"},"schema_version":"1.0","source":{"id":"1504.01515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01515","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01515v2","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01515","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"PHJBL7W3VNXX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PHJBL7W3VNXXSMWD","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PHJBL7W3","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:f9c754365c066753852653b6a57cdd49b73ecd94ff45d237bbd8c0b03369da8c","target":"graph","created_at":"2026-05-18T01:08:13Z","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 a plethora of applications dealing with inverse problems, e.g. in image processing, social networks, compressive sensing, biological data processing etc., the signal of interest is known to be structured in several ways at the same time. This premise has recently guided the research to the innovative and meaningful idea of imposing multiple constraints on the parameters involved in the problem under study. For instance, when dealing with problems whose parameters form sparse and low-rank matrices, the adoption of suitably combined constraints imposing sparsity and low-rankness, is expected ","authors_text":"Athanasios Rontogiannis, Konstantinos Koutroumbas, Konstantinos Themelis, Paris Giampouras","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-07T08:23:45Z","title":"Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01515","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:fca0f0a54f8846fe391c377cfe3f68db02442ba3389788eeb8fbb40d08856d39","target":"record","created_at":"2026-05-18T01:08:13Z","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":"64e920dfcdbb2c499f0ac4fa233fb797a5a408c65be89973ba78b0509037db80","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-07T08:23:45Z","title_canon_sha256":"aab12209d600b66fe0513354f6c7108df23e708829c27de1310d18e988fdaac5"},"schema_version":"1.0","source":{"id":"1504.01515","kind":"arxiv","version":2}},"canonical_sha256":"79d215fedbab6f7932c37c27929bd71038593cd0d9e899e22e69c6d98ec54df0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79d215fedbab6f7932c37c27929bd71038593cd0d9e899e22e69c6d98ec54df0","first_computed_at":"2026-05-18T01:08:13.416298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.416298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X6ypxWRaUxa8eJSFv3MbpEvXhlKHQUfz2ndp1lR/AV5R7YRm0fE3A8tOd/x5AVMi1gN8sTJdk36j7lycBrGFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.416844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fca0f0a54f8846fe391c377cfe3f68db02442ba3389788eeb8fbb40d08856d39","sha256:f9c754365c066753852653b6a57cdd49b73ecd94ff45d237bbd8c0b03369da8c"],"state_sha256":"ed7081d02abdc5df34537cc8d29801b51fa91e86868386ce71d7018da81a8abe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhiXqinVN6LYY2GBJvI6o18Yye1QAb+u5cYwqtJiLdlV5kXqSsxHOVhU1+dfdVt45DEOB7pLhRD48KlvJHgWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:36:47.649018Z","bundle_sha256":"61019e44a40489efad3b3a41962e7c647eb53abd8b51b9a43ac1e58b44368a17"}}