{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O4FZSNXMZGVMGOUKUQKUA2P7UI","short_pith_number":"pith:O4FZSNXM","canonical_record":{"source":{"id":"1801.08285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-25T06:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"ce1bc37a4e0008c16fe19c8aaef71b9da81eb8e10b45d0153d4660f096574f1e","abstract_canon_sha256":"1feacf48c566867be063a6bc703d8b7b968387f019e1c805c800277176e54850"},"schema_version":"1.0"},"canonical_sha256":"770b9936ecc9aac33a8aa4154069ffa2283b23060073887a2a302dcf543634db","source":{"kind":"arxiv","id":"1801.08285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08285","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08285v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08285","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"O4FZSNXMZGVM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O4FZSNXMZGVMGOUK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O4FZSNXM","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O4FZSNXMZGVMGOUKUQKUA2P7UI","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-25T06:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"ce1bc37a4e0008c16fe19c8aaef71b9da81eb8e10b45d0153d4660f096574f1e","abstract_canon_sha256":"1feacf48c566867be063a6bc703d8b7b968387f019e1c805c800277176e54850"},"schema_version":"1.0"},"canonical_sha256":"770b9936ecc9aac33a8aa4154069ffa2283b23060073887a2a302dcf543634db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.634024Z","signature_b64":"tkuMufI8mYVveTWGHz5a3NFOeJCsbyrVic94nJbNu2V/y89M3+t1KXZYJhwUW4NIlkJigqikoP0vLCZ7t4f+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770b9936ecc9aac33a8aa4154069ffa2283b23060073887a2a302dcf543634db","last_reissued_at":"2026-05-18T00:25:06.633377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.633377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08285","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-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q980JuQOchcaI1U5rE392wTFL3J0xAe2WCJsR5zt1QQYx7zzJgrE7WD65NMfMDLsSaQ1h2BR6W8WOmO3i7mXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:00.249133Z"},"content_sha256":"5215578ac294cfa2db8a5c99143857c6486e0d9e12d49fe3097ef266087ac4a6","schema_version":"1.0","event_id":"sha256:5215578ac294cfa2db8a5c99143857c6486e0d9e12d49fe3097ef266087ac4a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O4FZSNXMZGVMGOUKUQKUA2P7UI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothing Algorithms for Computing the Projection onto a Minkowski Sum of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Thai An, Xiaolong Qin","submitted_at":"2018-01-25T06:23:20Z","abstract_excerpt":"In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by Nirenberg and the Nesterov smoothing techniques. It is shown that projection points onto a Minkowski sum of sets can be represented as the sum of points on constituent sets so that, at these points, all of the sets share the same normal vector which is the negative of the dual solution. The proposed NESMINO algorithm improves the theoretical bound on number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08285","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-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IGUdt6OmOjPciYaUNDPZUpaKagQrH6rPCetZKwcd2/BVCaS2Lc4lXT76JugcBB+MFbgPFb6pSQKlHWvV3F1bDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:00.249503Z"},"content_sha256":"6669d5fa4c46a7614b738bb192f18ca323f4d2a0249287f7faa980cb533c07e9","schema_version":"1.0","event_id":"sha256:6669d5fa4c46a7614b738bb192f18ca323f4d2a0249287f7faa980cb533c07e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI/bundle.json","state_url":"https://pith.science/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI/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-05T12:47:00Z","links":{"resolver":"https://pith.science/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI","bundle":"https://pith.science/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI/bundle.json","state":"https://pith.science/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4FZSNXMZGVMGOUKUQKUA2P7UI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O4FZSNXMZGVMGOUKUQKUA2P7UI","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":"1feacf48c566867be063a6bc703d8b7b968387f019e1c805c800277176e54850","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-25T06:23:20Z","title_canon_sha256":"ce1bc37a4e0008c16fe19c8aaef71b9da81eb8e10b45d0153d4660f096574f1e"},"schema_version":"1.0","source":{"id":"1801.08285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08285","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08285v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08285","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"O4FZSNXMZGVM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O4FZSNXMZGVMGOUK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O4FZSNXM","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:6669d5fa4c46a7614b738bb192f18ca323f4d2a0249287f7faa980cb533c07e9","target":"graph","created_at":"2026-05-18T00:25:06Z","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":"In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by Nirenberg and the Nesterov smoothing techniques. It is shown that projection points onto a Minkowski sum of sets can be represented as the sum of points on constituent sets so that, at these points, all of the sets share the same normal vector which is the negative of the dual solution. The proposed NESMINO algorithm improves the theoretical bound on number ","authors_text":"Nguyen Thai An, Xiaolong Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-25T06:23:20Z","title":"Smoothing Algorithms for Computing the Projection onto a Minkowski Sum of Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08285","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:5215578ac294cfa2db8a5c99143857c6486e0d9e12d49fe3097ef266087ac4a6","target":"record","created_at":"2026-05-18T00:25:06Z","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":"1feacf48c566867be063a6bc703d8b7b968387f019e1c805c800277176e54850","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-25T06:23:20Z","title_canon_sha256":"ce1bc37a4e0008c16fe19c8aaef71b9da81eb8e10b45d0153d4660f096574f1e"},"schema_version":"1.0","source":{"id":"1801.08285","kind":"arxiv","version":1}},"canonical_sha256":"770b9936ecc9aac33a8aa4154069ffa2283b23060073887a2a302dcf543634db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"770b9936ecc9aac33a8aa4154069ffa2283b23060073887a2a302dcf543634db","first_computed_at":"2026-05-18T00:25:06.633377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:06.633377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tkuMufI8mYVveTWGHz5a3NFOeJCsbyrVic94nJbNu2V/y89M3+t1KXZYJhwUW4NIlkJigqikoP0vLCZ7t4f+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:06.634024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5215578ac294cfa2db8a5c99143857c6486e0d9e12d49fe3097ef266087ac4a6","sha256:6669d5fa4c46a7614b738bb192f18ca323f4d2a0249287f7faa980cb533c07e9"],"state_sha256":"046bbc8398ceda6ee0c9484cfc863009fe2b29e4a161fac4a0f8a93744b05421"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDYaaax5GaEP3kq1ZZu/CaIRJcrmsPsNZOZMg7VZcWjxuWgPX6hRuAykHrrQ73lKeI/Lr4E2iTeEF+siCltdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:47:00.251483Z","bundle_sha256":"ae572807c695821b0c2f0e6a906b4ad4cab065b6cc4f78268b8c311e65d3486c"}}