{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LTMBDZANCERTLN36I2YELDCJVY","short_pith_number":"pith:LTMBDZAN","canonical_record":{"source":{"id":"1602.02191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-05T23:23:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7dc58601053d2ea15774c36f01404bb57265d6715f047ac6d1bdd2c7b456acd4","abstract_canon_sha256":"7548454db0dc348311018032127ea51b345ba8dd344ce92c8f953d38006918ea"},"schema_version":"1.0"},"canonical_sha256":"5cd811e40d112335b77e46b0458c49ae16c3491f7d2fe8453068105dcd3dfb80","source":{"kind":"arxiv","id":"1602.02191","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02191","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02191v3","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02191","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"LTMBDZANCERT","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTMBDZANCERTLN36","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTMBDZAN","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LTMBDZANCERTLN36I2YELDCJVY","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-05T23:23:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7dc58601053d2ea15774c36f01404bb57265d6715f047ac6d1bdd2c7b456acd4","abstract_canon_sha256":"7548454db0dc348311018032127ea51b345ba8dd344ce92c8f953d38006918ea"},"schema_version":"1.0"},"canonical_sha256":"5cd811e40d112335b77e46b0458c49ae16c3491f7d2fe8453068105dcd3dfb80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:00.353868Z","signature_b64":"VoflGzNcxJh6REfTFYF8+xx7yrIqROwmBhXpK+t1lEJA6nOth6BWWus4qPX0mCrxdKzyhH3LNuHCKfalzUT5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cd811e40d112335b77e46b0458c49ae16c3491f7d2fe8453068105dcd3dfb80","last_reissued_at":"2026-05-18T01:01:00.353255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:00.353255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02191","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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUoZdjzuKEIkPDtHP7+/cDfNzSrkKDomSjmW8bXABf4ZRJA1d7DuVvoiZ8lzNOwrPEwwiqY5afquWIXuEAE/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:58:25.013099Z"},"content_sha256":"f7aa50db044cc74e94d18420fca59e836b96d1543e6be367edb615509022acd1","schema_version":"1.0","event_id":"sha256:f7aa50db044cc74e94d18420fca59e836b96d1543e6be367edb615509022acd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LTMBDZANCERTLN36I2YELDCJVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Relaxation Regression: Black-Box Optimization of Smooth Functions by Learning Their Convex Envelopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Eva Dyer, Konrad Kording, Mohammad Gheshlaghi Azar","submitted_at":"2016-02-05T23:23:32Z","abstract_excerpt":"Finding efficient and provable methods to solve non-convex optimization problems is an outstanding challenge in machine learning and optimization theory. A popular approach used to tackle non-convex problems is to use convex relaxation techniques to find a convex surrogate for the problem. Unfortunately, convex relaxations typically must be found on a problem-by-problem basis. Thus, providing a general-purpose strategy to estimate a convex relaxation would have a wide reaching impact. Here, we introduce Convex Relaxation Regression (CoRR), an approach for learning convex relaxations for a clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02191","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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXmAgjeVlWEyrJyQhYMw0ju8o9bcAtc8z4O6JHjolr3xY3C/mGz8uP2HONq42QlaiiWQ2OCxEMqdleDNZTWPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:58:25.013451Z"},"content_sha256":"2f5ff9e118fe0db8111c4312ee856e27a446db8fff163682aa2d12620efb7380","schema_version":"1.0","event_id":"sha256:2f5ff9e118fe0db8111c4312ee856e27a446db8fff163682aa2d12620efb7380"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTMBDZANCERTLN36I2YELDCJVY/bundle.json","state_url":"https://pith.science/pith/LTMBDZANCERTLN36I2YELDCJVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTMBDZANCERTLN36I2YELDCJVY/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-01T16:58:25Z","links":{"resolver":"https://pith.science/pith/LTMBDZANCERTLN36I2YELDCJVY","bundle":"https://pith.science/pith/LTMBDZANCERTLN36I2YELDCJVY/bundle.json","state":"https://pith.science/pith/LTMBDZANCERTLN36I2YELDCJVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTMBDZANCERTLN36I2YELDCJVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LTMBDZANCERTLN36I2YELDCJVY","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":"7548454db0dc348311018032127ea51b345ba8dd344ce92c8f953d38006918ea","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-05T23:23:32Z","title_canon_sha256":"7dc58601053d2ea15774c36f01404bb57265d6715f047ac6d1bdd2c7b456acd4"},"schema_version":"1.0","source":{"id":"1602.02191","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02191","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02191v3","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02191","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"LTMBDZANCERT","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTMBDZANCERTLN36","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTMBDZAN","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:2f5ff9e118fe0db8111c4312ee856e27a446db8fff163682aa2d12620efb7380","target":"graph","created_at":"2026-05-18T01:01:00Z","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":"Finding efficient and provable methods to solve non-convex optimization problems is an outstanding challenge in machine learning and optimization theory. A popular approach used to tackle non-convex problems is to use convex relaxation techniques to find a convex surrogate for the problem. Unfortunately, convex relaxations typically must be found on a problem-by-problem basis. Thus, providing a general-purpose strategy to estimate a convex relaxation would have a wide reaching impact. Here, we introduce Convex Relaxation Regression (CoRR), an approach for learning convex relaxations for a clas","authors_text":"Eva Dyer, Konrad Kording, Mohammad Gheshlaghi Azar","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-05T23:23:32Z","title":"Convex Relaxation Regression: Black-Box Optimization of Smooth Functions by Learning Their Convex Envelopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02191","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:f7aa50db044cc74e94d18420fca59e836b96d1543e6be367edb615509022acd1","target":"record","created_at":"2026-05-18T01:01:00Z","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":"7548454db0dc348311018032127ea51b345ba8dd344ce92c8f953d38006918ea","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-05T23:23:32Z","title_canon_sha256":"7dc58601053d2ea15774c36f01404bb57265d6715f047ac6d1bdd2c7b456acd4"},"schema_version":"1.0","source":{"id":"1602.02191","kind":"arxiv","version":3}},"canonical_sha256":"5cd811e40d112335b77e46b0458c49ae16c3491f7d2fe8453068105dcd3dfb80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cd811e40d112335b77e46b0458c49ae16c3491f7d2fe8453068105dcd3dfb80","first_computed_at":"2026-05-18T01:01:00.353255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:00.353255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VoflGzNcxJh6REfTFYF8+xx7yrIqROwmBhXpK+t1lEJA6nOth6BWWus4qPX0mCrxdKzyhH3LNuHCKfalzUT5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:00.353868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02191","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7aa50db044cc74e94d18420fca59e836b96d1543e6be367edb615509022acd1","sha256:2f5ff9e118fe0db8111c4312ee856e27a446db8fff163682aa2d12620efb7380"],"state_sha256":"6448ac222b867e917e7af38e9e615841bfa561358a80a578483f2cc06440f3b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EibVnQ9BCzOdNZ7MKIvFftgyFERORwDJwV9qcImpohKpa2YGs90Bs3fW6QFRTy9VbZ68vPH0qWjmLd96cNkEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:58:25.015391Z","bundle_sha256":"e3776bc7cd88599144b955a35af124bd6b0d6e9df50444b27ac9916a6fe7efee"}}