{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W533O5VJQPUMC66HSFW5MJOJQS","short_pith_number":"pith:W533O5VJ","canonical_record":{"source":{"id":"1406.4008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-16T13:23:01Z","cross_cats_sorted":[],"title_canon_sha256":"a35b71f4eb8dfe5d96e91377fa6c80f30529288e8e5596089dc25556bfc64797","abstract_canon_sha256":"70f18f3a9d3f69d3fd29b03643560cd2d2b4f5485c594d7ee12aedcae30acef8"},"schema_version":"1.0"},"canonical_sha256":"b777b776a983e8c17bc7916dd625c98490e329e24f97ed3673cf931c4cc63875","source":{"kind":"arxiv","id":"1406.4008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4008","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4008v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4008","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"W533O5VJQPUM","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W533O5VJQPUMC66H","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W533O5VJ","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W533O5VJQPUMC66HSFW5MJOJQS","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-16T13:23:01Z","cross_cats_sorted":[],"title_canon_sha256":"a35b71f4eb8dfe5d96e91377fa6c80f30529288e8e5596089dc25556bfc64797","abstract_canon_sha256":"70f18f3a9d3f69d3fd29b03643560cd2d2b4f5485c594d7ee12aedcae30acef8"},"schema_version":"1.0"},"canonical_sha256":"b777b776a983e8c17bc7916dd625c98490e329e24f97ed3673cf931c4cc63875","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.375062Z","signature_b64":"auX4nWG+Y8voIEA846gp/LpWZOMbpcho1dDXZChVXWGxKH4ejOw35VjE/pfpgfRhu3hbDafzumO75wCc3Q/8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b777b776a983e8c17bc7916dd625c98490e329e24f97ed3673cf931c4cc63875","last_reissued_at":"2026-05-18T02:49:39.374745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.374745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4008","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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNiNSCZtIUSkYgXdJthL9Ot/iLH9hUM0FCcat+R/sqKlL918Exnr+KHca/mOTNwJ9itXHKPZ6Hvc8/PmpT7XBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:07:11.802525Z"},"content_sha256":"a1f3c578802431accad5388470dabbe5d854baf756c86c368aee146d74b5360d","schema_version":"1.0","event_id":"sha256:a1f3c578802431accad5388470dabbe5d854baf756c86c368aee146d74b5360d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W533O5VJQPUMC66HSFW5MJOJQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved analysis of algorithms based on supporting halfspaces and quadratic programming for the convex intersection and feasibility problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C.H. Jeffrey Pang","submitted_at":"2014-06-16T13:23:01Z","abstract_excerpt":"This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs (QPs) and approximate projections arising from partially solving the QPs are sufficient for multiple-term superlinear convergence for nonsmooth problems. Second, we identify additional regularity, which we call the second order supporting hyperplane property (SOSH), that gives multiple-term quadratic convergence. Third, we show that these fast convergence res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4008","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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXEyTHbTIjqGHy/sYROSkMwzxQFwhrUYCQz+1gI2RS7a5cf3fuYI5565FAf6Rbg2iMnjjlW9s7fSqllTeVivDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:07:11.803179Z"},"content_sha256":"b632474e777d629378f7cdc721bec5401323b9f15fd001441767e1453950fee6","schema_version":"1.0","event_id":"sha256:b632474e777d629378f7cdc721bec5401323b9f15fd001441767e1453950fee6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W533O5VJQPUMC66HSFW5MJOJQS/bundle.json","state_url":"https://pith.science/pith/W533O5VJQPUMC66HSFW5MJOJQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W533O5VJQPUMC66HSFW5MJOJQS/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-09T08:07:11Z","links":{"resolver":"https://pith.science/pith/W533O5VJQPUMC66HSFW5MJOJQS","bundle":"https://pith.science/pith/W533O5VJQPUMC66HSFW5MJOJQS/bundle.json","state":"https://pith.science/pith/W533O5VJQPUMC66HSFW5MJOJQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W533O5VJQPUMC66HSFW5MJOJQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W533O5VJQPUMC66HSFW5MJOJQS","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":"70f18f3a9d3f69d3fd29b03643560cd2d2b4f5485c594d7ee12aedcae30acef8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-16T13:23:01Z","title_canon_sha256":"a35b71f4eb8dfe5d96e91377fa6c80f30529288e8e5596089dc25556bfc64797"},"schema_version":"1.0","source":{"id":"1406.4008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4008","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4008v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4008","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"W533O5VJQPUM","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W533O5VJQPUMC66H","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W533O5VJ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:b632474e777d629378f7cdc721bec5401323b9f15fd001441767e1453950fee6","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs (QPs) and approximate projections arising from partially solving the QPs are sufficient for multiple-term superlinear convergence for nonsmooth problems. Second, we identify additional regularity, which we call the second order supporting hyperplane property (SOSH), that gives multiple-term quadratic convergence. Third, we show that these fast convergence res","authors_text":"C.H. Jeffrey Pang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-16T13:23:01Z","title":"Improved analysis of algorithms based on supporting halfspaces and quadratic programming for the convex intersection and feasibility problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4008","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:a1f3c578802431accad5388470dabbe5d854baf756c86c368aee146d74b5360d","target":"record","created_at":"2026-05-18T02:49:39Z","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":"70f18f3a9d3f69d3fd29b03643560cd2d2b4f5485c594d7ee12aedcae30acef8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-16T13:23:01Z","title_canon_sha256":"a35b71f4eb8dfe5d96e91377fa6c80f30529288e8e5596089dc25556bfc64797"},"schema_version":"1.0","source":{"id":"1406.4008","kind":"arxiv","version":1}},"canonical_sha256":"b777b776a983e8c17bc7916dd625c98490e329e24f97ed3673cf931c4cc63875","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b777b776a983e8c17bc7916dd625c98490e329e24f97ed3673cf931c4cc63875","first_computed_at":"2026-05-18T02:49:39.374745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.374745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"auX4nWG+Y8voIEA846gp/LpWZOMbpcho1dDXZChVXWGxKH4ejOw35VjE/pfpgfRhu3hbDafzumO75wCc3Q/8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.375062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1f3c578802431accad5388470dabbe5d854baf756c86c368aee146d74b5360d","sha256:b632474e777d629378f7cdc721bec5401323b9f15fd001441767e1453950fee6"],"state_sha256":"af376810bba6eef4113870226f213885da909c43efba79280286ae6f15855922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NuyPvGNc2EEyo1HYok7BxUN+CoIdf++zbTRMv44z6qD7KfVGRrFmZYT+m2BqY5N91u2npzh1QFHlcviNwwxODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:07:11.807329Z","bundle_sha256":"e39f2a4f75801516d62a42b09e3e73af47e0c4364ec7cc4adb998355f588db0e"}}