{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SP2KOXEEGGKJKFZR5DQOYOGWDF","short_pith_number":"pith:SP2KOXEE","canonical_record":{"source":{"id":"1603.06313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T02:34:26Z","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"title_canon_sha256":"dc7cec80fa21fd829eae357175bf8a4fd59b51b2556a9746d1db43c032b8d82e","abstract_canon_sha256":"0ea4a933047122d795a3b233fb0d98ab0ad70047c8d913c07f5ccc9504408e9c"},"schema_version":"1.0"},"canonical_sha256":"93f4a75c843194951731e8e0ec38d6195ed7e516c35a0dcb8ea30e874ac1cc3f","source":{"kind":"arxiv","id":"1603.06313","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06313","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06313v2","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06313","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"SP2KOXEEGGKJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SP2KOXEEGGKJKFZR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SP2KOXEE","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SP2KOXEEGGKJKFZR5DQOYOGWDF","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T02:34:26Z","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"title_canon_sha256":"dc7cec80fa21fd829eae357175bf8a4fd59b51b2556a9746d1db43c032b8d82e","abstract_canon_sha256":"0ea4a933047122d795a3b233fb0d98ab0ad70047c8d913c07f5ccc9504408e9c"},"schema_version":"1.0"},"canonical_sha256":"93f4a75c843194951731e8e0ec38d6195ed7e516c35a0dcb8ea30e874ac1cc3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:49.923578Z","signature_b64":"rkeelwazsSrT8vZktdXCBTLLn04+XRuf7LB4sMxOnBGuyzf7Ls7JaojE+8qXt6BS+1JAcWh03Wky/fZhHQbLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f4a75c843194951731e8e0ec38d6195ed7e516c35a0dcb8ea30e874ac1cc3f","last_reissued_at":"2026-05-18T01:17:49.922852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:49.922852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06313","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:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TS8fFXyhZteaCt3+HvaXAkm+fPGZisovjwFxbR6BObHlZ1Sg5NGYT0G2H0iBZEFWoezpsPErgDNpJtp0TkXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:49.697589Z"},"content_sha256":"f3387b39a0ed023041d9fc172ab537ae3f7df6914d782c66b1a77633025de828","schema_version":"1.0","event_id":"sha256:f3387b39a0ed023041d9fc172ab537ae3f7df6914d782c66b1a77633025de828"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SP2KOXEEGGKJKFZR5DQOYOGWDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex block-sparse linear regression with expanders -- provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Anastasios Kyrillidis, Bubacarr Bah, Luca Baldassarre, Quoc Tran-Dinh, Rouzbeh Hasheminezhad, Volkan Cevher","submitted_at":"2016-03-21T02:34:26Z","abstract_excerpt":"Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-time. Prompted by this observation, we study a convex optimization scheme for block-sparse recovery from linear measurements. To obtain linear sketches, we use expander matrices, i.e., sparse matrices containing only few non-zeros per column. Hitherto, to the best of our knowledge, such algorithmic solutions have been only studied from a non-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06313","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:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWvX0gcGOVciKqAINVfZGs9+XPqfR50cCF0eH4G9vruUrRzHPour8Po1O8sqCAicK5z1/j/hbNmK5MJu21L+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:49.697942Z"},"content_sha256":"94c7d412c578285253b67c52c4197527906e5fb56ec91f0fafbe1b27027668b4","schema_version":"1.0","event_id":"sha256:94c7d412c578285253b67c52c4197527906e5fb56ec91f0fafbe1b27027668b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF/bundle.json","state_url":"https://pith.science/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF/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-31T05:38:49Z","links":{"resolver":"https://pith.science/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF","bundle":"https://pith.science/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF/bundle.json","state":"https://pith.science/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SP2KOXEEGGKJKFZR5DQOYOGWDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SP2KOXEEGGKJKFZR5DQOYOGWDF","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":"0ea4a933047122d795a3b233fb0d98ab0ad70047c8d913c07f5ccc9504408e9c","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T02:34:26Z","title_canon_sha256":"dc7cec80fa21fd829eae357175bf8a4fd59b51b2556a9746d1db43c032b8d82e"},"schema_version":"1.0","source":{"id":"1603.06313","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06313","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06313v2","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06313","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"SP2KOXEEGGKJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SP2KOXEEGGKJKFZR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SP2KOXEE","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:94c7d412c578285253b67c52c4197527906e5fb56ec91f0fafbe1b27027668b4","target":"graph","created_at":"2026-05-18T01:17:49Z","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":"Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-time. Prompted by this observation, we study a convex optimization scheme for block-sparse recovery from linear measurements. To obtain linear sketches, we use expander matrices, i.e., sparse matrices containing only few non-zeros per column. Hitherto, to the best of our knowledge, such algorithmic solutions have been only studied from a non-co","authors_text":"Anastasios Kyrillidis, Bubacarr Bah, Luca Baldassarre, Quoc Tran-Dinh, Rouzbeh Hasheminezhad, Volkan Cevher","cross_cats":["math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T02:34:26Z","title":"Convex block-sparse linear regression with expanders -- provably"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06313","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:f3387b39a0ed023041d9fc172ab537ae3f7df6914d782c66b1a77633025de828","target":"record","created_at":"2026-05-18T01:17:49Z","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":"0ea4a933047122d795a3b233fb0d98ab0ad70047c8d913c07f5ccc9504408e9c","cross_cats_sorted":["math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T02:34:26Z","title_canon_sha256":"dc7cec80fa21fd829eae357175bf8a4fd59b51b2556a9746d1db43c032b8d82e"},"schema_version":"1.0","source":{"id":"1603.06313","kind":"arxiv","version":2}},"canonical_sha256":"93f4a75c843194951731e8e0ec38d6195ed7e516c35a0dcb8ea30e874ac1cc3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93f4a75c843194951731e8e0ec38d6195ed7e516c35a0dcb8ea30e874ac1cc3f","first_computed_at":"2026-05-18T01:17:49.922852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:49.922852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rkeelwazsSrT8vZktdXCBTLLn04+XRuf7LB4sMxOnBGuyzf7Ls7JaojE+8qXt6BS+1JAcWh03Wky/fZhHQbLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:49.923578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06313","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3387b39a0ed023041d9fc172ab537ae3f7df6914d782c66b1a77633025de828","sha256:94c7d412c578285253b67c52c4197527906e5fb56ec91f0fafbe1b27027668b4"],"state_sha256":"1b1bee081672e4aa2349c11d142279a2406782b198a6120af27a0cf6812a08f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nxCSCsAWveH1oWdeQCWfDfgb7c7BCDksaoS4pisuY2cBXbgODmAwFQeddFKtaf+bxbna/p+/nRKkGOrHeAABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:38:49.700057Z","bundle_sha256":"ccd76f79189e9ea687ebfa1d8d018a818f5a8d9a693f2dedf58d271e2f9ec20f"}}