{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CBNMNQR7S5L2BCQXVGWSMBDB3K","short_pith_number":"pith:CBNMNQR7","canonical_record":{"source":{"id":"1610.06702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T08:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"042747b550e9fef6a9380239250fa650328698ed28e18ad084cb5bdb49b3f451","abstract_canon_sha256":"1d6f592366af0f7a9d9a266319bdd395c21b0ef92c0d28c14397cd5df45fee55"},"schema_version":"1.0"},"canonical_sha256":"105ac6c23f9757a08a17a9ad260461daa719b3b2a98163edb62d346af57e7c82","source":{"kind":"arxiv","id":"1610.06702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06702","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06702v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06702","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"CBNMNQR7S5L2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CBNMNQR7S5L2BCQX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CBNMNQR7","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CBNMNQR7S5L2BCQXVGWSMBDB3K","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T08:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"042747b550e9fef6a9380239250fa650328698ed28e18ad084cb5bdb49b3f451","abstract_canon_sha256":"1d6f592366af0f7a9d9a266319bdd395c21b0ef92c0d28c14397cd5df45fee55"},"schema_version":"1.0"},"canonical_sha256":"105ac6c23f9757a08a17a9ad260461daa719b3b2a98163edb62d346af57e7c82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.529106Z","signature_b64":"h6GG2U4irTrtev8oB1zPwDRBOenep/Ff2vt2r6tDVDkyvpsuDBGh81+Y9TE0u2oqw6de+yIHLlRIBfej0WgTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"105ac6c23f9757a08a17a9ad260461daa719b3b2a98163edb62d346af57e7c82","last_reissued_at":"2026-05-18T00:56:37.528447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.528447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06702","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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBajFGph9ZN6Twbl85/Mr6JNO0jokf25DZlCquNo/0UTa6Vu/4R2uja1oZ5DXhRd0YYSgorGWA8KRctPIZCMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:59:13.800033Z"},"content_sha256":"9278f4870bde4038dca594344d12e1d0a577bd7e59f436faeaf607e09fd3a9c4","schema_version":"1.0","event_id":"sha256:9278f4870bde4038dca594344d12e1d0a577bd7e59f436faeaf607e09fd3a9c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CBNMNQR7S5L2BCQXVGWSMBDB3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random constraint sampling and duality for convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"William B. Haskell, Yu Pengqian","submitted_at":"2016-10-21T08:47:23Z","abstract_excerpt":"We are interested in solving convex optimization problems with large numbers of constraints. Randomized algorithms, such as random constraint sampling, have been very successful in giving nearly optimal solutions to such problems. In this paper, we combine random constraint sampling with the classical primal-dual algorithm for convex optimization problems with large numbers of constraints, and we give a convergence rate analysis. We then report numerical experiments that verify the effectiveness of this algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06702","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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBD3E8CA5EFJcY/aQZwZLtg260MTTEPdkTdA3WaehG+HqOc9y1l/Zo93PkUeAJ7/YQ8UKxgfvMrExG2p0zMfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:59:13.800726Z"},"content_sha256":"e2888834638c0f7d98f399d696854d67948123f032e8e1c60b775a621758f1d2","schema_version":"1.0","event_id":"sha256:e2888834638c0f7d98f399d696854d67948123f032e8e1c60b775a621758f1d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K/bundle.json","state_url":"https://pith.science/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K/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-28T15:59:13Z","links":{"resolver":"https://pith.science/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K","bundle":"https://pith.science/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K/bundle.json","state":"https://pith.science/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBNMNQR7S5L2BCQXVGWSMBDB3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CBNMNQR7S5L2BCQXVGWSMBDB3K","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":"1d6f592366af0f7a9d9a266319bdd395c21b0ef92c0d28c14397cd5df45fee55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T08:47:23Z","title_canon_sha256":"042747b550e9fef6a9380239250fa650328698ed28e18ad084cb5bdb49b3f451"},"schema_version":"1.0","source":{"id":"1610.06702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06702","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06702v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06702","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"CBNMNQR7S5L2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CBNMNQR7S5L2BCQX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CBNMNQR7","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:e2888834638c0f7d98f399d696854d67948123f032e8e1c60b775a621758f1d2","target":"graph","created_at":"2026-05-18T00:56:37Z","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 are interested in solving convex optimization problems with large numbers of constraints. Randomized algorithms, such as random constraint sampling, have been very successful in giving nearly optimal solutions to such problems. In this paper, we combine random constraint sampling with the classical primal-dual algorithm for convex optimization problems with large numbers of constraints, and we give a convergence rate analysis. We then report numerical experiments that verify the effectiveness of this algorithm.","authors_text":"William B. Haskell, Yu Pengqian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T08:47:23Z","title":"Random constraint sampling and duality for convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06702","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:9278f4870bde4038dca594344d12e1d0a577bd7e59f436faeaf607e09fd3a9c4","target":"record","created_at":"2026-05-18T00:56:37Z","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":"1d6f592366af0f7a9d9a266319bdd395c21b0ef92c0d28c14397cd5df45fee55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T08:47:23Z","title_canon_sha256":"042747b550e9fef6a9380239250fa650328698ed28e18ad084cb5bdb49b3f451"},"schema_version":"1.0","source":{"id":"1610.06702","kind":"arxiv","version":2}},"canonical_sha256":"105ac6c23f9757a08a17a9ad260461daa719b3b2a98163edb62d346af57e7c82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"105ac6c23f9757a08a17a9ad260461daa719b3b2a98163edb62d346af57e7c82","first_computed_at":"2026-05-18T00:56:37.528447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.528447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6GG2U4irTrtev8oB1zPwDRBOenep/Ff2vt2r6tDVDkyvpsuDBGh81+Y9TE0u2oqw6de+yIHLlRIBfej0WgTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.529106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9278f4870bde4038dca594344d12e1d0a577bd7e59f436faeaf607e09fd3a9c4","sha256:e2888834638c0f7d98f399d696854d67948123f032e8e1c60b775a621758f1d2"],"state_sha256":"3e674d505b8c3ed01b1a3943b5ab463fd68fd716e2fe413e9fcc67843415c9af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azlnswrtaJCNhcH06lh0/fWNzj/zH8YYEL240eWDDbN1kvGAsrsN5mQ4icnA9Jd6yt/a4oO1kDpOowdHPaOtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:59:13.804131Z","bundle_sha256":"ca5f6fbd41927d7d07c804f5af13561cae99a9eb799069304bd44864a26740d3"}}