{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2ZMM4ETGBMN3FUZH3FF7SQAPNS","short_pith_number":"pith:2ZMM4ETG","canonical_record":{"source":{"id":"2605.31425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T15:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"10c95a3cbde2fd9dded1a078bd2885ad127a1c77b8bc07c5532ddac6ef3a2cc5","abstract_canon_sha256":"c12824508da686d95d754e782759d41041e23c7f22b3698efe2889214865f43c"},"schema_version":"1.0"},"canonical_sha256":"d658ce12660b1bb2d327d94bf9400f6cbd5f68ac8304cf7360ebea17260e335a","source":{"kind":"arxiv","id":"2605.31425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.31425","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.31425v1","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31425","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"2ZMM4ETGBMN3","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"2ZMM4ETGBMN3FUZH","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"2ZMM4ETG","created_at":"2026-06-01T02:04:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2ZMM4ETGBMN3FUZH3FF7SQAPNS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.31425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T15:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"10c95a3cbde2fd9dded1a078bd2885ad127a1c77b8bc07c5532ddac6ef3a2cc5","abstract_canon_sha256":"c12824508da686d95d754e782759d41041e23c7f22b3698efe2889214865f43c"},"schema_version":"1.0"},"canonical_sha256":"d658ce12660b1bb2d327d94bf9400f6cbd5f68ac8304cf7360ebea17260e335a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:05.012748Z","signature_b64":"iZkbzLLh/WasOmz58SEoNevZ721G50o+iBQNsY0r6rViDeQZFyKaGUdNvNzv2LNCf+Oty47I0l/VYd5KJMIcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d658ce12660b1bb2d327d94bf9400f6cbd5f68ac8304cf7360ebea17260e335a","last_reissued_at":"2026-06-01T02:04:05.011893Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:05.011893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.31425","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-06-01T02:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCHFNozAr/XzTX2iYfDQWUKfFT+lhE6HCEcyr7NDLovXkBjjm8QmdQzpeYLm+yAO48Cbd2GUWj84hiHCHIklDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:22.525630Z"},"content_sha256":"1a52b9f36e34506e22a6411db484e42ec6e8ee42ca359706d96c2428e56931be","schema_version":"1.0","event_id":"sha256:1a52b9f36e34506e22a6411db484e42ec6e8ee42ca359706d96c2428e56931be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2ZMM4ETGBMN3FUZH3FF7SQAPNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lei Yang, Ling Liang","submitted_at":"2026-05-29T15:22:38Z","abstract_excerpt":"A mixed-precision GPU-oriented optimization framework is developed for computing the minimum enclosing ball of a collection of balls. The approach is built on an equivalent second-order cone programming reformulation and a relative-type inexact proximal augmented Lagrangian method (ripALM), which provides a high-accuracy optimization backbone while solving the inner subproblems only to a progress-dependent relative accuracy. The proximal augmented Lagrangian inherits a constraint-wise separable structure: its objective, gradient, generalized Hessian, and multiplier updates can be efficiently e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31425","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.31425/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-01T02:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMko6TZdILoiKJOO0T6XSTX+r4tmYb4C8LdZwA6nil/pWbYREmjc314MczVV7k5c8IJ0cIxjnGRBjOVskOJPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:22.526260Z"},"content_sha256":"43ff873a6e9d4ae627924cda24d9442ea6ef083f8af7643c9e968611b3f24e3c","schema_version":"1.0","event_id":"sha256:43ff873a6e9d4ae627924cda24d9442ea6ef083f8af7643c9e968611b3f24e3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS/bundle.json","state_url":"https://pith.science/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS/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-07T14:16:22Z","links":{"resolver":"https://pith.science/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS","bundle":"https://pith.science/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS/bundle.json","state":"https://pith.science/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZMM4ETGBMN3FUZH3FF7SQAPNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2ZMM4ETGBMN3FUZH3FF7SQAPNS","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":"c12824508da686d95d754e782759d41041e23c7f22b3698efe2889214865f43c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T15:22:38Z","title_canon_sha256":"10c95a3cbde2fd9dded1a078bd2885ad127a1c77b8bc07c5532ddac6ef3a2cc5"},"schema_version":"1.0","source":{"id":"2605.31425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.31425","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.31425v1","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31425","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"2ZMM4ETGBMN3","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"2ZMM4ETGBMN3FUZH","created_at":"2026-06-01T02:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"2ZMM4ETG","created_at":"2026-06-01T02:04:05Z"}],"graph_snapshots":[{"event_id":"sha256:43ff873a6e9d4ae627924cda24d9442ea6ef083f8af7643c9e968611b3f24e3c","target":"graph","created_at":"2026-06-01T02:04:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.31425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A mixed-precision GPU-oriented optimization framework is developed for computing the minimum enclosing ball of a collection of balls. The approach is built on an equivalent second-order cone programming reformulation and a relative-type inexact proximal augmented Lagrangian method (ripALM), which provides a high-accuracy optimization backbone while solving the inner subproblems only to a progress-dependent relative accuracy. The proximal augmented Lagrangian inherits a constraint-wise separable structure: its objective, gradient, generalized Hessian, and multiplier updates can be efficiently e","authors_text":"Lei Yang, Ling Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T15:22:38Z","title":"Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31425","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:1a52b9f36e34506e22a6411db484e42ec6e8ee42ca359706d96c2428e56931be","target":"record","created_at":"2026-06-01T02:04:05Z","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":"c12824508da686d95d754e782759d41041e23c7f22b3698efe2889214865f43c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T15:22:38Z","title_canon_sha256":"10c95a3cbde2fd9dded1a078bd2885ad127a1c77b8bc07c5532ddac6ef3a2cc5"},"schema_version":"1.0","source":{"id":"2605.31425","kind":"arxiv","version":1}},"canonical_sha256":"d658ce12660b1bb2d327d94bf9400f6cbd5f68ac8304cf7360ebea17260e335a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d658ce12660b1bb2d327d94bf9400f6cbd5f68ac8304cf7360ebea17260e335a","first_computed_at":"2026-06-01T02:04:05.011893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T02:04:05.011893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iZkbzLLh/WasOmz58SEoNevZ721G50o+iBQNsY0r6rViDeQZFyKaGUdNvNzv2LNCf+Oty47I0l/VYd5KJMIcDA==","signature_status":"signed_v1","signed_at":"2026-06-01T02:04:05.012748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.31425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a52b9f36e34506e22a6411db484e42ec6e8ee42ca359706d96c2428e56931be","sha256:43ff873a6e9d4ae627924cda24d9442ea6ef083f8af7643c9e968611b3f24e3c"],"state_sha256":"6a93e83feade08b1c13734b9facb02b63cf6a4f720ee659399fa0a08721b7439"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4FVndpgfrKGOkQQml9u26B4rllmskPxYsHN3Io/G6bKj3IqxeV9OoOHoIu3A5jNIsxgbAC5ScbXZMyTr8vtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:16:22.529899Z","bundle_sha256":"a5c03c35b7695607fe3ed494198d62f7d17b89c1a375211850735a01b9262dc6"}}