{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ASGZVS5AL3E6BPL5PZ4DNMBPM6","short_pith_number":"pith:ASGZVS5A","canonical_record":{"source":{"id":"1404.5113","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-21T05:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"4d0cb86be063c6682e30fd2ada4a08014e3c6ac06cf2898f4faaa2dd89e696f7","abstract_canon_sha256":"5e220e037778c1444a41818cddb8311e25eae8d831b9abc08d227ca39b393be2"},"schema_version":"1.0"},"canonical_sha256":"048d9acba05ec9e0bd7d7e7836b02f678156a44869e5e47b84370a7c24d6a9ec","source":{"kind":"arxiv","id":"1404.5113","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5113","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5113v2","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5113","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"ASGZVS5AL3E6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ASGZVS5AL3E6BPL5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ASGZVS5A","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ASGZVS5AL3E6BPL5PZ4DNMBPM6","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5113","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-21T05:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"4d0cb86be063c6682e30fd2ada4a08014e3c6ac06cf2898f4faaa2dd89e696f7","abstract_canon_sha256":"5e220e037778c1444a41818cddb8311e25eae8d831b9abc08d227ca39b393be2"},"schema_version":"1.0"},"canonical_sha256":"048d9acba05ec9e0bd7d7e7836b02f678156a44869e5e47b84370a7c24d6a9ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:46.070680Z","signature_b64":"SaG+3CacaMDBeFzFSUXP3iibDXSjxC6fmipDc9nzHcRpxcKEWFfVUvlnM6ShibV3hJ0U3ky5YgJFifsIf9W6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"048d9acba05ec9e0bd7d7e7836b02f678156a44869e5e47b84370a7c24d6a9ec","last_reissued_at":"2026-05-18T02:48:46.069943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:46.069943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5113","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-18T02:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrQVXZshdY35KTL89YkgoqFSwMdA0a8KLfZtybVvYC7Y8fCakiUs3jIk+xxDUGm7MHcPYUKWtAq2vmzGrtB7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:08:19.600474Z"},"content_sha256":"2a9c85b810c62a2e6513076f71426a7b225b854290bdecd11dda1250ef000afe","schema_version":"1.0","event_id":"sha256:2a9c85b810c62a2e6513076f71426a7b225b854290bdecd11dda1250ef000afe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ASGZVS5AL3E6BPL5PZ4DNMBPM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Dong Yen, Nguyen Mau Nam, Nguyen Thai An","submitted_at":"2014-04-21T05:27:51Z","abstract_excerpt":"We study a location problem that involves a weighted sum of distances to closed convex sets. As several of the weights might be negative, traditional solution methods of convex optimization are not applicable. After obtaining some existence theorems, we introduce a simple, but effective, algorithm for solving the problem. Our method is based on the Pham Dinh - Le Thi algorithm for d.c. programming and a generalized version of the Weiszfeld algorithm, which works well for convex location problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5113","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-18T02:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rX+w93v1FjeHUhBv0SQVHYo40mm8dNlbiSKHf0jI2Ook7soaQAtSM1ylZ8Udbd8R85P0w+W0oNY9VsIUJbJkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:08:19.600807Z"},"content_sha256":"3874348b53b260f59bb29607e80827af68152b4943f2b743df3dab24b3f470eb","schema_version":"1.0","event_id":"sha256:3874348b53b260f59bb29607e80827af68152b4943f2b743df3dab24b3f470eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6/bundle.json","state_url":"https://pith.science/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6/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-09T15:08:19Z","links":{"resolver":"https://pith.science/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6","bundle":"https://pith.science/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6/bundle.json","state":"https://pith.science/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASGZVS5AL3E6BPL5PZ4DNMBPM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ASGZVS5AL3E6BPL5PZ4DNMBPM6","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":"5e220e037778c1444a41818cddb8311e25eae8d831b9abc08d227ca39b393be2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-21T05:27:51Z","title_canon_sha256":"4d0cb86be063c6682e30fd2ada4a08014e3c6ac06cf2898f4faaa2dd89e696f7"},"schema_version":"1.0","source":{"id":"1404.5113","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5113","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5113v2","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5113","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"ASGZVS5AL3E6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ASGZVS5AL3E6BPL5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ASGZVS5A","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:3874348b53b260f59bb29607e80827af68152b4943f2b743df3dab24b3f470eb","target":"graph","created_at":"2026-05-18T02:48:46Z","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 study a location problem that involves a weighted sum of distances to closed convex sets. As several of the weights might be negative, traditional solution methods of convex optimization are not applicable. After obtaining some existence theorems, we introduce a simple, but effective, algorithm for solving the problem. Our method is based on the Pham Dinh - Le Thi algorithm for d.c. programming and a generalized version of the Weiszfeld algorithm, which works well for convex location problems.","authors_text":"Nguyen Dong Yen, Nguyen Mau Nam, Nguyen Thai An","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-21T05:27:51Z","title":"A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5113","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:2a9c85b810c62a2e6513076f71426a7b225b854290bdecd11dda1250ef000afe","target":"record","created_at":"2026-05-18T02:48:46Z","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":"5e220e037778c1444a41818cddb8311e25eae8d831b9abc08d227ca39b393be2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-21T05:27:51Z","title_canon_sha256":"4d0cb86be063c6682e30fd2ada4a08014e3c6ac06cf2898f4faaa2dd89e696f7"},"schema_version":"1.0","source":{"id":"1404.5113","kind":"arxiv","version":2}},"canonical_sha256":"048d9acba05ec9e0bd7d7e7836b02f678156a44869e5e47b84370a7c24d6a9ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"048d9acba05ec9e0bd7d7e7836b02f678156a44869e5e47b84370a7c24d6a9ec","first_computed_at":"2026-05-18T02:48:46.069943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:46.069943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SaG+3CacaMDBeFzFSUXP3iibDXSjxC6fmipDc9nzHcRpxcKEWFfVUvlnM6ShibV3hJ0U3ky5YgJFifsIf9W6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:46.070680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5113","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a9c85b810c62a2e6513076f71426a7b225b854290bdecd11dda1250ef000afe","sha256:3874348b53b260f59bb29607e80827af68152b4943f2b743df3dab24b3f470eb"],"state_sha256":"0710352d1bce1d1de64e1ab531814548bb95c6797a26c7476a1dbe15624ed386"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8SLPhHtCwgatWA/i1zBJv2xupZpdxMZcIXt16WjdHMni9RwKnP4k2QhTTEiq1w2H+UyHIfbDMdHQDk+AK7jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:08:19.602710Z","bundle_sha256":"b43339c6db43bddf62edbc6d7ef355e890d74ce6d923badf75e0f149cd94dd7e"}}