{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WJ3OBQHLLPPPAUBVSIPXRFHVLR","short_pith_number":"pith:WJ3OBQHL","canonical_record":{"source":{"id":"1809.01931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T11:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"515096b67208422e02f902186d4d9207c94054830d0a88826fb03552da213830","abstract_canon_sha256":"c92e7b350e9c9fa742669ddb460e943cbc502300ade444e524ae923e5ee09629"},"schema_version":"1.0"},"canonical_sha256":"b276e0c0eb5bdef05035921f7894f55c44c11890ba7ab6f12d77312380249abf","source":{"kind":"arxiv","id":"1809.01931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01931","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01931v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01931","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"WJ3OBQHLLPPP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WJ3OBQHLLPPPAUBV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WJ3OBQHL","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WJ3OBQHLLPPPAUBVSIPXRFHVLR","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T11:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"515096b67208422e02f902186d4d9207c94054830d0a88826fb03552da213830","abstract_canon_sha256":"c92e7b350e9c9fa742669ddb460e943cbc502300ade444e524ae923e5ee09629"},"schema_version":"1.0"},"canonical_sha256":"b276e0c0eb5bdef05035921f7894f55c44c11890ba7ab6f12d77312380249abf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.666993Z","signature_b64":"SBKX4p9Ot0LFuyKK1W0UVQBUrtFGwqi1s00hUC/FJ8H1lbdxpcjuFIWm/v3uUc4KcNoB4TakGXxCHfx4PmD0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b276e0c0eb5bdef05035921f7894f55c44c11890ba7ab6f12d77312380249abf","last_reissued_at":"2026-05-18T00:06:21.666266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.666266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01931","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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qzzMxk8w7SNrxlyUZW2slrhkDuCyFMsTfRttlC/fHueT2orOcE+YxTfZDABUtEd7F6ipQF56IYyhcp/x5/8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:37.433734Z"},"content_sha256":"6a7bf321fc4fd54401b049e1772915e5dbcc79b3635e8e0b20dc94fbf30a411b","schema_version":"1.0","event_id":"sha256:6a7bf321fc4fd54401b049e1772915e5dbcc79b3635e8e0b20dc94fbf30a411b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WJ3OBQHLLPPPAUBVSIPXRFHVLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An unexpected connection between Bayes $A-$optimal designs and the Group Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Edouard Pauwels, Guillaume Sagnol","submitted_at":"2018-09-06T11:56:29Z","abstract_excerpt":"We show that the $A$-optimal design optimization problem over $m$ design points in $\\mathbb{R}^n$ is equivalent to minimizing a quadratic function plus a group lasso sparsity inducing term over $n\\times m$ real matrices. This observation allows to describe several new algorithms for $A$-optimal design based on splitting and block coordinate decomposition. These techniques are well known and proved powerful to treat large scale problems in machine learning and signal processing communities. The proposed algorithms come with rigorous convergence guaranties and convergence rate estimate stemming "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01931","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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7oeN46vXosqEf160GW6ehSPVs2fxoe+8lhEqIduGH+ps4Bbj/28MJITyAtGbDox6zjW07xwScivoac5XKnjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:37.434253Z"},"content_sha256":"30771f02031425a2a77d9362e6b46499254a3eeb1984ed903ee484f4893de019","schema_version":"1.0","event_id":"sha256:30771f02031425a2a77d9362e6b46499254a3eeb1984ed903ee484f4893de019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR/bundle.json","state_url":"https://pith.science/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR/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-26T03:22:37Z","links":{"resolver":"https://pith.science/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR","bundle":"https://pith.science/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR/bundle.json","state":"https://pith.science/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJ3OBQHLLPPPAUBVSIPXRFHVLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WJ3OBQHLLPPPAUBVSIPXRFHVLR","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":"c92e7b350e9c9fa742669ddb460e943cbc502300ade444e524ae923e5ee09629","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T11:56:29Z","title_canon_sha256":"515096b67208422e02f902186d4d9207c94054830d0a88826fb03552da213830"},"schema_version":"1.0","source":{"id":"1809.01931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01931","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01931v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01931","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"WJ3OBQHLLPPP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WJ3OBQHLLPPPAUBV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WJ3OBQHL","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:30771f02031425a2a77d9362e6b46499254a3eeb1984ed903ee484f4893de019","target":"graph","created_at":"2026-05-18T00:06:21Z","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 show that the $A$-optimal design optimization problem over $m$ design points in $\\mathbb{R}^n$ is equivalent to minimizing a quadratic function plus a group lasso sparsity inducing term over $n\\times m$ real matrices. This observation allows to describe several new algorithms for $A$-optimal design based on splitting and block coordinate decomposition. These techniques are well known and proved powerful to treat large scale problems in machine learning and signal processing communities. The proposed algorithms come with rigorous convergence guaranties and convergence rate estimate stemming ","authors_text":"Edouard Pauwels, Guillaume Sagnol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T11:56:29Z","title":"An unexpected connection between Bayes $A-$optimal designs and the Group Lasso"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01931","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:6a7bf321fc4fd54401b049e1772915e5dbcc79b3635e8e0b20dc94fbf30a411b","target":"record","created_at":"2026-05-18T00:06:21Z","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":"c92e7b350e9c9fa742669ddb460e943cbc502300ade444e524ae923e5ee09629","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T11:56:29Z","title_canon_sha256":"515096b67208422e02f902186d4d9207c94054830d0a88826fb03552da213830"},"schema_version":"1.0","source":{"id":"1809.01931","kind":"arxiv","version":1}},"canonical_sha256":"b276e0c0eb5bdef05035921f7894f55c44c11890ba7ab6f12d77312380249abf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b276e0c0eb5bdef05035921f7894f55c44c11890ba7ab6f12d77312380249abf","first_computed_at":"2026-05-18T00:06:21.666266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.666266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SBKX4p9Ot0LFuyKK1W0UVQBUrtFGwqi1s00hUC/FJ8H1lbdxpcjuFIWm/v3uUc4KcNoB4TakGXxCHfx4PmD0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.666993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a7bf321fc4fd54401b049e1772915e5dbcc79b3635e8e0b20dc94fbf30a411b","sha256:30771f02031425a2a77d9362e6b46499254a3eeb1984ed903ee484f4893de019"],"state_sha256":"6313deccaddf9403a806d78e0d9c87015569445cd7a4a7f71152b18ee9eeae8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUn37VhEKxSlDnn4Q0rw97Ql9PRpvyvBSL7+VJemEHOCU0qynJ7UxUvwHMSOsoCISwqA/ClWImWA8ktTDNQNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:22:37.437790Z","bundle_sha256":"04c37cd82677e7691fcb29a735013d9e8e3098ba09b7ca9f850ce8d925e53618"}}