{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FVZKCI36RHQ5Y3XQFRRVH7OT3F","short_pith_number":"pith:FVZKCI36","canonical_record":{"source":{"id":"1602.01506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T22:58:44Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fb67dc4ed6e114f5406084d3f628712d4ca869f5a2e7fde9d9d30b21c9c5238b","abstract_canon_sha256":"9e4b106ab882a8400149f7e9ece07472fd48d9f553375962552e2da1ae99ecbb"},"schema_version":"1.0"},"canonical_sha256":"2d72a1237e89e1dc6ef02c6353fdd3d97400cc7b34bd255ffcaf598dcf84e44f","source":{"kind":"arxiv","id":"1602.01506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01506","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01506v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01506","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"FVZKCI36RHQ5","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVZKCI36RHQ5Y3XQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVZKCI36","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FVZKCI36RHQ5Y3XQFRRVH7OT3F","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T22:58:44Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fb67dc4ed6e114f5406084d3f628712d4ca869f5a2e7fde9d9d30b21c9c5238b","abstract_canon_sha256":"9e4b106ab882a8400149f7e9ece07472fd48d9f553375962552e2da1ae99ecbb"},"schema_version":"1.0"},"canonical_sha256":"2d72a1237e89e1dc6ef02c6353fdd3d97400cc7b34bd255ffcaf598dcf84e44f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.813959Z","signature_b64":"xTB/XayI/BLKCWPmJYWXaFNSw7L/RFDQ3nqA0OVkJMkADXbJfT4tPebBIe820kVAoJl8tOVbEdhzjaAVNF1PBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d72a1237e89e1dc6ef02c6353fdd3d97400cc7b34bd255ffcaf598dcf84e44f","last_reissued_at":"2026-05-18T01:21:18.813381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.813381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01506","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYRikvOqgHIdzQXJ3Dyk90RotdpT53sVK4Ck8r+5DSziykzEx4jFFNZgugMDBzUSCgDsvKPGo1pph3xjsw8eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:42:49.623292Z"},"content_sha256":"335dd739182c8175deef2bab0d539e2f46e0cc1f1ea320f0c7a577091d9793fc","schema_version":"1.0","event_id":"sha256:335dd739182c8175deef2bab0d539e2f46e0cc1f1ea320f0c7a577091d9793fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FVZKCI36RHQ5Y3XQFRRVH7OT3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Level-set methods for convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Aleksandr Y. Aravkin, Dmitriy Drusvyatskiy, James V. Burke, Michael P. Friedlander, Scott Roy","submitted_at":"2016-02-03T22:58:44Z","abstract_excerpt":"Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the roles of the objective and constraint functions, and instead approximately solves a sequence of parametric level-set problems. A zero-finding procedure, based on inexact function evaluations and possibly inexact derivative information, leads to an efficient solution scheme for the original problem. We describe the theoretical and practical properties of this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01506","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VwCqpP1hRrktuY0AFDlvJgpf3T7QbNKz5hHvnaZmRMqblurh//JgLWMsYqL6ZQCawOLpRcJUupQX7HoR4YyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:42:49.623689Z"},"content_sha256":"7b22b67f2a15bae6b559feaee25fa56b7cd90d6fd2c981155cda51b7b9665ca6","schema_version":"1.0","event_id":"sha256:7b22b67f2a15bae6b559feaee25fa56b7cd90d6fd2c981155cda51b7b9665ca6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F/bundle.json","state_url":"https://pith.science/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F/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-02T01:42:49Z","links":{"resolver":"https://pith.science/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F","bundle":"https://pith.science/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F/bundle.json","state":"https://pith.science/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVZKCI36RHQ5Y3XQFRRVH7OT3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FVZKCI36RHQ5Y3XQFRRVH7OT3F","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":"9e4b106ab882a8400149f7e9ece07472fd48d9f553375962552e2da1ae99ecbb","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T22:58:44Z","title_canon_sha256":"fb67dc4ed6e114f5406084d3f628712d4ca869f5a2e7fde9d9d30b21c9c5238b"},"schema_version":"1.0","source":{"id":"1602.01506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01506","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01506v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01506","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"FVZKCI36RHQ5","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVZKCI36RHQ5Y3XQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVZKCI36","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:7b22b67f2a15bae6b559feaee25fa56b7cd90d6fd2c981155cda51b7b9665ca6","target":"graph","created_at":"2026-05-18T01:21:18Z","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":"Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the roles of the objective and constraint functions, and instead approximately solves a sequence of parametric level-set problems. A zero-finding procedure, based on inexact function evaluations and possibly inexact derivative information, leads to an efficient solution scheme for the original problem. We describe the theoretical and practical properties of this","authors_text":"Aleksandr Y. Aravkin, Dmitriy Drusvyatskiy, James V. Burke, Michael P. Friedlander, Scott Roy","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T22:58:44Z","title":"Level-set methods for convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01506","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:335dd739182c8175deef2bab0d539e2f46e0cc1f1ea320f0c7a577091d9793fc","target":"record","created_at":"2026-05-18T01:21:18Z","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":"9e4b106ab882a8400149f7e9ece07472fd48d9f553375962552e2da1ae99ecbb","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T22:58:44Z","title_canon_sha256":"fb67dc4ed6e114f5406084d3f628712d4ca869f5a2e7fde9d9d30b21c9c5238b"},"schema_version":"1.0","source":{"id":"1602.01506","kind":"arxiv","version":1}},"canonical_sha256":"2d72a1237e89e1dc6ef02c6353fdd3d97400cc7b34bd255ffcaf598dcf84e44f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d72a1237e89e1dc6ef02c6353fdd3d97400cc7b34bd255ffcaf598dcf84e44f","first_computed_at":"2026-05-18T01:21:18.813381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.813381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTB/XayI/BLKCWPmJYWXaFNSw7L/RFDQ3nqA0OVkJMkADXbJfT4tPebBIe820kVAoJl8tOVbEdhzjaAVNF1PBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.813959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:335dd739182c8175deef2bab0d539e2f46e0cc1f1ea320f0c7a577091d9793fc","sha256:7b22b67f2a15bae6b559feaee25fa56b7cd90d6fd2c981155cda51b7b9665ca6"],"state_sha256":"3dc47e100c429947e61f73a757da4bbf96f6008be650babceb73c2f993c4b688"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omikQh+7a0VOXNRGaGvhBTEmoCqAYTuWB9ywmu351jgQ0bsO7C7Ooja3YzSVTeSIaYaAh8A8RWxY/fqQ9rFZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:42:49.625640Z","bundle_sha256":"5ca5390871dd74aa972d16d682596726bec9b2ca195cc2caa34f26666467e04f"}}