{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IG2FH2Y3HH6RHHCDMGDX7O27G2","short_pith_number":"pith:IG2FH2Y3","canonical_record":{"source":{"id":"1901.02783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-09T15:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"923097bca3437f525d20ad1f60dad8b397152a4a24246c16c4c49e3dfefb48d5","abstract_canon_sha256":"79a972cf6a1ef8b22ca48978240f808c65599e765e351b6e30295d8d5398bcc1"},"schema_version":"1.0"},"canonical_sha256":"41b453eb1b39fd139c4361877fbb5f3695dee61fe7c2550140412550c4d4e723","source":{"kind":"arxiv","id":"1901.02783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02783","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02783v1","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02783","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"IG2FH2Y3HH6R","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IG2FH2Y3HH6RHHCD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IG2FH2Y3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IG2FH2Y3HH6RHHCDMGDX7O27G2","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-09T15:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"923097bca3437f525d20ad1f60dad8b397152a4a24246c16c4c49e3dfefb48d5","abstract_canon_sha256":"79a972cf6a1ef8b22ca48978240f808c65599e765e351b6e30295d8d5398bcc1"},"schema_version":"1.0"},"canonical_sha256":"41b453eb1b39fd139c4361877fbb5f3695dee61fe7c2550140412550c4d4e723","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:39.457778Z","signature_b64":"alU+iyL9LRbBuTa+f/Hum7rh1tKKH/Xi82Sy2fVKle86SmGd+IjV5D+Fm9BAGnHYcyE/Pt2u6iVE8Dd38CjnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41b453eb1b39fd139c4361877fbb5f3695dee61fe7c2550140412550c4d4e723","last_reissued_at":"2026-05-17T23:56:39.457242Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:39.457242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02783","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-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/XjrOhIooQH+CzJuwduoWBYiaejyyoy+YUvXBKQDd0YvVyD2ppJu6MH082NmAALAv7WCEyPFu8SReozwS4SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:20:38.666336Z"},"content_sha256":"3fe52c8910995160010f916979eb5e50e327bc955ed65afea881eff8a41a6e65","schema_version":"1.0","event_id":"sha256:3fe52c8910995160010f916979eb5e50e327bc955ed65afea881eff8a41a6e65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IG2FH2Y3HH6RHHCDMGDX7O27G2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Use of Mutual Coherence to Prove $\\ell^1/\\ell^0$-Equivalence in Classification Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chelsea Weaver, Naoki Saito","submitted_at":"2019-01-09T15:38:32Z","abstract_excerpt":"We consider the decomposition of a signal over an overcomplete set of vectors. Minimization of the $\\ell^1$-norm of the coefficient vector can often retrieve the sparsest solution (so-called \"$\\ell^1/\\ell^0$-equivalence\"), a generally NP-hard task, and this fact has powered the field of compressed sensing. Wright et al.'s sparse representation-based classification (SRC) applies this relationship to machine learning, wherein the signal to be decomposed represents the test sample and columns of the dictionary are training samples. We investigate the relationships between $\\ell^1$-minimization, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02783","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-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFZI7LzTmog8iw4xfoCLhD8C34tZVhOn9gLWTrPCnRyEA5Bfcr+ANVKcY1p9GPA9XEY6ua0pY/3xtQauPEkdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:20:38.666683Z"},"content_sha256":"405d8b980670f01ad92acc30b6997751be0cbe4d656c5a1263b3e15051a2128e","schema_version":"1.0","event_id":"sha256:405d8b980670f01ad92acc30b6997751be0cbe4d656c5a1263b3e15051a2128e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2/bundle.json","state_url":"https://pith.science/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2/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-26T22:20:38Z","links":{"resolver":"https://pith.science/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2","bundle":"https://pith.science/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2/bundle.json","state":"https://pith.science/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IG2FH2Y3HH6RHHCDMGDX7O27G2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IG2FH2Y3HH6RHHCDMGDX7O27G2","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":"79a972cf6a1ef8b22ca48978240f808c65599e765e351b6e30295d8d5398bcc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-09T15:38:32Z","title_canon_sha256":"923097bca3437f525d20ad1f60dad8b397152a4a24246c16c4c49e3dfefb48d5"},"schema_version":"1.0","source":{"id":"1901.02783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02783","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02783v1","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02783","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"IG2FH2Y3HH6R","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IG2FH2Y3HH6RHHCD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IG2FH2Y3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:405d8b980670f01ad92acc30b6997751be0cbe4d656c5a1263b3e15051a2128e","target":"graph","created_at":"2026-05-17T23:56:39Z","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":"We consider the decomposition of a signal over an overcomplete set of vectors. Minimization of the $\\ell^1$-norm of the coefficient vector can often retrieve the sparsest solution (so-called \"$\\ell^1/\\ell^0$-equivalence\"), a generally NP-hard task, and this fact has powered the field of compressed sensing. Wright et al.'s sparse representation-based classification (SRC) applies this relationship to machine learning, wherein the signal to be decomposed represents the test sample and columns of the dictionary are training samples. We investigate the relationships between $\\ell^1$-minimization, s","authors_text":"Chelsea Weaver, Naoki Saito","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-09T15:38:32Z","title":"The Use of Mutual Coherence to Prove $\\ell^1/\\ell^0$-Equivalence in Classification Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02783","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:3fe52c8910995160010f916979eb5e50e327bc955ed65afea881eff8a41a6e65","target":"record","created_at":"2026-05-17T23:56:39Z","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":"79a972cf6a1ef8b22ca48978240f808c65599e765e351b6e30295d8d5398bcc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-09T15:38:32Z","title_canon_sha256":"923097bca3437f525d20ad1f60dad8b397152a4a24246c16c4c49e3dfefb48d5"},"schema_version":"1.0","source":{"id":"1901.02783","kind":"arxiv","version":1}},"canonical_sha256":"41b453eb1b39fd139c4361877fbb5f3695dee61fe7c2550140412550c4d4e723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41b453eb1b39fd139c4361877fbb5f3695dee61fe7c2550140412550c4d4e723","first_computed_at":"2026-05-17T23:56:39.457242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:39.457242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"alU+iyL9LRbBuTa+f/Hum7rh1tKKH/Xi82Sy2fVKle86SmGd+IjV5D+Fm9BAGnHYcyE/Pt2u6iVE8Dd38CjnCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:39.457778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fe52c8910995160010f916979eb5e50e327bc955ed65afea881eff8a41a6e65","sha256:405d8b980670f01ad92acc30b6997751be0cbe4d656c5a1263b3e15051a2128e"],"state_sha256":"75026327c5224574e991165d3e6b532c03a9482d01c93c9ee37b2d5d5be8f4e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgDRgByYYL2utxw46aoyZjKF8qxf2wdZ4l9T/lTJ/LnocDcdDlr+1v3HUy3ChWRwucQ9p5akLckqQWkNWuJhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T22:20:38.668557Z","bundle_sha256":"78d61bfb9ffa574006f9b8e86ffcc4fb025924568601cb95e779da46004d6fbf"}}