{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4YUMV2WKOANQ2AOBKTYM3WMKTV","short_pith_number":"pith:4YUMV2WK","canonical_record":{"source":{"id":"1511.05864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-18T16:29:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b7e77de5ed4029f48b16bc1b90f5510ebd5b2de112ea50f52260736365e6e07f","abstract_canon_sha256":"f12c9c2758fc33f20c720b7d35d6268193d602f86a99465ecc09427d83e89be8"},"schema_version":"1.0"},"canonical_sha256":"e628caeaca701b0d01c154f0cdd98a9d6db908737d681a2f4ba5f5bbbe1ee480","source":{"kind":"arxiv","id":"1511.05864","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05864","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05864v3","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05864","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"4YUMV2WKOANQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4YUMV2WKOANQ2AOB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4YUMV2WK","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4YUMV2WKOANQ2AOBKTYM3WMKTV","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-18T16:29:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b7e77de5ed4029f48b16bc1b90f5510ebd5b2de112ea50f52260736365e6e07f","abstract_canon_sha256":"f12c9c2758fc33f20c720b7d35d6268193d602f86a99465ecc09427d83e89be8"},"schema_version":"1.0"},"canonical_sha256":"e628caeaca701b0d01c154f0cdd98a9d6db908737d681a2f4ba5f5bbbe1ee480","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.842654Z","signature_b64":"aC8+WFjTA6/cq2JY7Id8AX3VOHQZLEw2Cnxwdjm7fHumfDQ7Fnakt/Fx/nu0Xj6HLdUCoOc0TN+H6o6h7VntAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e628caeaca701b0d01c154f0cdd98a9d6db908737d681a2f4ba5f5bbbe1ee480","last_reissued_at":"2026-05-18T01:13:04.842329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.842329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05864","source_version":3,"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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xCBszDVQLqWipNbezVtmogsLBl3l62FHY6CKpghnLtZ3WInwCjGKqKoUfJQjBpAGKSmGolJknB/DEJMxhFWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:41:15.516967Z"},"content_sha256":"875ece5f7681fd8fd4ed645a8737ef5323798939a323e703d34703cafac781a9","schema_version":"1.0","event_id":"sha256:875ece5f7681fd8fd4ed645a8737ef5323798939a323e703d34703cafac781a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4YUMV2WKOANQ2AOBKTYM3WMKTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with the Ordered l1-Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Damian Brzyski, Malgorzata Bogdan, Sangkyun Lee","submitted_at":"2015-11-18T16:29:51Z","abstract_excerpt":"In this paper we propose a primal-dual proximal extragradient algorithm to solve the generalized Dantzig selector (GDS) estimation problem, based on a new convex-concave saddle-point (SP) reformulation. Our new formulation makes it possible to adopt recent developments in saddle-point optimization, to achieve the optimal $O(1/k)$ rate of convergence. Compared to the optimal non-SP algorithms, ours do not require specification of sensitive parameters that affect algorithm performance or solution quality. We also provide a new analysis showing a possibility of local acceleration to achieve the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05864","kind":"arxiv","version":3},"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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41SJsLq7sS2zNP//D5ubmw2ot8Q5VgihfAYfxqVTp/rAsI/QpsNYEVn55Q5A4uENeepxvlf78iWyi3CUOOITDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:41:15.517306Z"},"content_sha256":"6a8be2c7848a167b97603503fe1fa08980c8fd7d672eeeea5a2cc98404cced4b","schema_version":"1.0","event_id":"sha256:6a8be2c7848a167b97603503fe1fa08980c8fd7d672eeeea5a2cc98404cced4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV/bundle.json","state_url":"https://pith.science/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV/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-08T12:41:15Z","links":{"resolver":"https://pith.science/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV","bundle":"https://pith.science/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV/bundle.json","state":"https://pith.science/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YUMV2WKOANQ2AOBKTYM3WMKTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4YUMV2WKOANQ2AOBKTYM3WMKTV","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":"f12c9c2758fc33f20c720b7d35d6268193d602f86a99465ecc09427d83e89be8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-18T16:29:51Z","title_canon_sha256":"b7e77de5ed4029f48b16bc1b90f5510ebd5b2de112ea50f52260736365e6e07f"},"schema_version":"1.0","source":{"id":"1511.05864","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05864","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05864v3","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05864","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"4YUMV2WKOANQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4YUMV2WKOANQ2AOB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4YUMV2WK","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:6a8be2c7848a167b97603503fe1fa08980c8fd7d672eeeea5a2cc98404cced4b","target":"graph","created_at":"2026-05-18T01:13:04Z","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 this paper we propose a primal-dual proximal extragradient algorithm to solve the generalized Dantzig selector (GDS) estimation problem, based on a new convex-concave saddle-point (SP) reformulation. Our new formulation makes it possible to adopt recent developments in saddle-point optimization, to achieve the optimal $O(1/k)$ rate of convergence. Compared to the optimal non-SP algorithms, ours do not require specification of sensitive parameters that affect algorithm performance or solution quality. We also provide a new analysis showing a possibility of local acceleration to achieve the r","authors_text":"Damian Brzyski, Malgorzata Bogdan, Sangkyun Lee","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-18T16:29:51Z","title":"Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with the Ordered l1-Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05864","kind":"arxiv","version":3},"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:875ece5f7681fd8fd4ed645a8737ef5323798939a323e703d34703cafac781a9","target":"record","created_at":"2026-05-18T01:13:04Z","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":"f12c9c2758fc33f20c720b7d35d6268193d602f86a99465ecc09427d83e89be8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-18T16:29:51Z","title_canon_sha256":"b7e77de5ed4029f48b16bc1b90f5510ebd5b2de112ea50f52260736365e6e07f"},"schema_version":"1.0","source":{"id":"1511.05864","kind":"arxiv","version":3}},"canonical_sha256":"e628caeaca701b0d01c154f0cdd98a9d6db908737d681a2f4ba5f5bbbe1ee480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e628caeaca701b0d01c154f0cdd98a9d6db908737d681a2f4ba5f5bbbe1ee480","first_computed_at":"2026-05-18T01:13:04.842329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:04.842329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aC8+WFjTA6/cq2JY7Id8AX3VOHQZLEw2Cnxwdjm7fHumfDQ7Fnakt/Fx/nu0Xj6HLdUCoOc0TN+H6o6h7VntAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:04.842654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05864","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:875ece5f7681fd8fd4ed645a8737ef5323798939a323e703d34703cafac781a9","sha256:6a8be2c7848a167b97603503fe1fa08980c8fd7d672eeeea5a2cc98404cced4b"],"state_sha256":"443a8d02db57dda99ce8fd2a1bfb4d0b871a6433237a01bb7b73546931968c2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkczpKEdUAn05FkKPeMYiGcllRn/UUWuHouF4/K0NY+6Zz9oUXU2dQbE8ZB2ntoPy4wJ4OVOgullQ8iJRT17Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:41:15.519135Z","bundle_sha256":"fc4d6d7510a0809498ffdc6c822f9ceb9f24144ad7cf77d6fe6873e2f57b23c4"}}