{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B2G44H266ACGE5OGPWFS66XVYX","short_pith_number":"pith:B2G44H26","canonical_record":{"source":{"id":"1804.08444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T07:25:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94d5f8b247d506c1ed12f5a6dcd2de2eae9c59ae1708bef4e4744c79dcd41c08","abstract_canon_sha256":"a195b51ce6add652e7f596350a6c3c078b37a9a22a7ca9b6d513e00b27880170"},"schema_version":"1.0"},"canonical_sha256":"0e8dce1f5ef0046275c67d8b2f7af5c5f1e53f5a712a20f11d2b31e40099683f","source":{"kind":"arxiv","id":"1804.08444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08444","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08444v2","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08444","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"B2G44H266ACG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2G44H266ACGE5OG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2G44H26","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B2G44H266ACGE5OGPWFS66XVYX","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T07:25:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94d5f8b247d506c1ed12f5a6dcd2de2eae9c59ae1708bef4e4744c79dcd41c08","abstract_canon_sha256":"a195b51ce6add652e7f596350a6c3c078b37a9a22a7ca9b6d513e00b27880170"},"schema_version":"1.0"},"canonical_sha256":"0e8dce1f5ef0046275c67d8b2f7af5c5f1e53f5a712a20f11d2b31e40099683f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:27.505541Z","signature_b64":"cM8DMIgAVzrTVtGOMfS3B3xsjscDXHv9sN49F/UHJQoitsAsFrqM0NoZH0hAyPLfeXI6TYfVXEe33Ns3jPZOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e8dce1f5ef0046275c67d8b2f7af5c5f1e53f5a712a20f11d2b31e40099683f","last_reissued_at":"2026-05-17T23:39:27.504072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:27.504072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08444","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-17T23:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPwKZQVgkwzl9DfNrkLAbl5CpUxBT2dz0ZP6wA5/q/31wXRzSM/u7Qhb32ACFV9uXz+rSqBng5kbKzUsEeRtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T06:13:23.536589Z"},"content_sha256":"8a52cb694f73c9b9cb6de7d246f4b0b6574371430b05b94fb10d03792657e8be","schema_version":"1.0","event_id":"sha256:8a52cb694f73c9b9cb6de7d246f4b0b6574371430b05b94fb10d03792657e8be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B2G44H266ACGE5OGPWFS66XVYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Prior Information in Block Sparse Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Amini, Farzan Haddadi, Sajad Daei","submitted_at":"2018-04-20T07:25:23Z","abstract_excerpt":"We study the problem of recovering a block-sparse signal from under-sampled observations. The non-zero values of such signals appear in few blocks, and their recovery is often accomplished using a $\\ell_{1,2}$ optimization problem. In applications such as DNA micro-arrays, some prior information about the block support, i.e., blocks containing non-zero elements, is available. A typical way to consider the extra information in recovery procedures is to solve a weighted $\\ell_{1,2}$ problem. In this paper, we consider a block sparse model, where the block support has intersection with some given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08444","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-17T23:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06h/AnL/aAOcVj6aWMD+7jJEwQfFLJwSoOyZTwYT1/RCLjykgukqLHM8QE15Tv2QR2ZOE1uFqD22/Eu68TRTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T06:13:23.537128Z"},"content_sha256":"8155f4893b3dd37164b72ec41d49a796bb87f809c9bde7d43abb516bd19ba58f","schema_version":"1.0","event_id":"sha256:8155f4893b3dd37164b72ec41d49a796bb87f809c9bde7d43abb516bd19ba58f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2G44H266ACGE5OGPWFS66XVYX/bundle.json","state_url":"https://pith.science/pith/B2G44H266ACGE5OGPWFS66XVYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2G44H266ACGE5OGPWFS66XVYX/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-19T06:13:23Z","links":{"resolver":"https://pith.science/pith/B2G44H266ACGE5OGPWFS66XVYX","bundle":"https://pith.science/pith/B2G44H266ACGE5OGPWFS66XVYX/bundle.json","state":"https://pith.science/pith/B2G44H266ACGE5OGPWFS66XVYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2G44H266ACGE5OGPWFS66XVYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B2G44H266ACGE5OGPWFS66XVYX","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":"a195b51ce6add652e7f596350a6c3c078b37a9a22a7ca9b6d513e00b27880170","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T07:25:23Z","title_canon_sha256":"94d5f8b247d506c1ed12f5a6dcd2de2eae9c59ae1708bef4e4744c79dcd41c08"},"schema_version":"1.0","source":{"id":"1804.08444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08444","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08444v2","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08444","created_at":"2026-05-17T23:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"B2G44H266ACG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2G44H266ACGE5OG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2G44H26","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:8155f4893b3dd37164b72ec41d49a796bb87f809c9bde7d43abb516bd19ba58f","target":"graph","created_at":"2026-05-17T23:39:27Z","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 study the problem of recovering a block-sparse signal from under-sampled observations. The non-zero values of such signals appear in few blocks, and their recovery is often accomplished using a $\\ell_{1,2}$ optimization problem. In applications such as DNA micro-arrays, some prior information about the block support, i.e., blocks containing non-zero elements, is available. A typical way to consider the extra information in recovery procedures is to solve a weighted $\\ell_{1,2}$ problem. In this paper, we consider a block sparse model, where the block support has intersection with some given","authors_text":"Arash Amini, Farzan Haddadi, Sajad Daei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T07:25:23Z","title":"Exploiting Prior Information in Block Sparse Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08444","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:8a52cb694f73c9b9cb6de7d246f4b0b6574371430b05b94fb10d03792657e8be","target":"record","created_at":"2026-05-17T23:39:27Z","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":"a195b51ce6add652e7f596350a6c3c078b37a9a22a7ca9b6d513e00b27880170","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T07:25:23Z","title_canon_sha256":"94d5f8b247d506c1ed12f5a6dcd2de2eae9c59ae1708bef4e4744c79dcd41c08"},"schema_version":"1.0","source":{"id":"1804.08444","kind":"arxiv","version":2}},"canonical_sha256":"0e8dce1f5ef0046275c67d8b2f7af5c5f1e53f5a712a20f11d2b31e40099683f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e8dce1f5ef0046275c67d8b2f7af5c5f1e53f5a712a20f11d2b31e40099683f","first_computed_at":"2026-05-17T23:39:27.504072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:27.504072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cM8DMIgAVzrTVtGOMfS3B3xsjscDXHv9sN49F/UHJQoitsAsFrqM0NoZH0hAyPLfeXI6TYfVXEe33Ns3jPZOAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:27.505541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a52cb694f73c9b9cb6de7d246f4b0b6574371430b05b94fb10d03792657e8be","sha256:8155f4893b3dd37164b72ec41d49a796bb87f809c9bde7d43abb516bd19ba58f"],"state_sha256":"6d92bccc6c92e8db833ec1197dcb83451b5829b24547deda3348594546d3f17e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3noITOGHSupiKEoPofSGKZqH30SXhmxOBclyTEDUVybJBvSjBrprajA9rKSTGu/ebp6GVWaWzHU3sc5nTjLjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T06:13:23.539578Z","bundle_sha256":"270dfc8b7395f1a8c9b1da39ce92632126d658a5a3d1360026f6d32fdc8cf0a2"}}