{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q64IORL4NATUXJSSBCDDQM5RBU","short_pith_number":"pith:Q64IORL4","canonical_record":{"source":{"id":"1303.3735","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-15T11:18:56Z","cross_cats_sorted":[],"title_canon_sha256":"c9c3420fe943a117ad199f82cc84e2006bf50c4ed49a7f2f1e710adc3fabf949","abstract_canon_sha256":"e804dc343cc6364cc9e1e2defdd25666abc556e562581c62aac3fc249aacc4af"},"schema_version":"1.0"},"canonical_sha256":"87b887457c68274ba65208863833b10d0fccc6305b7bb4cf3463f140b4feb860","source":{"kind":"arxiv","id":"1303.3735","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3735","created_at":"2026-05-18T03:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3735v3","created_at":"2026-05-18T03:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3735","created_at":"2026-05-18T03:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"Q64IORL4NATU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q64IORL4NATUXJSS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q64IORL4","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q64IORL4NATUXJSSBCDDQM5RBU","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3735","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-15T11:18:56Z","cross_cats_sorted":[],"title_canon_sha256":"c9c3420fe943a117ad199f82cc84e2006bf50c4ed49a7f2f1e710adc3fabf949","abstract_canon_sha256":"e804dc343cc6364cc9e1e2defdd25666abc556e562581c62aac3fc249aacc4af"},"schema_version":"1.0"},"canonical_sha256":"87b887457c68274ba65208863833b10d0fccc6305b7bb4cf3463f140b4feb860","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:13.871988Z","signature_b64":"cxbzmpG7EDnbJJEmndOi1pvzJ1y2dAaJFBFGz91UIB8Bfc45n3JXhPtbbwFU/oP4AyADbMM6Z5p2vrNqhSGwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87b887457c68274ba65208863833b10d0fccc6305b7bb4cf3463f140b4feb860","last_reissued_at":"2026-05-18T03:04:13.871403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:13.871403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3735","source_version":3,"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-18T03:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQOLHLjMPKeMI2bM8bja8SQFHJ1T633Kb99Qcg7XtJecFvwcB1YC7nQY6A7ekPgyY3daz9HClCWQXgq46BzfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:48:46.466675Z"},"content_sha256":"e5dcbda469d0198a8c425dedd6f84feffa1348d1e36debb4e83e8ee117d77159","schema_version":"1.0","event_id":"sha256:e5dcbda469d0198a8c425dedd6f84feffa1348d1e36debb4e83e8ee117d77159"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q64IORL4NATUXJSSBCDDQM5RBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgradient Algorithm, Stochastic Subgradient Algorithm, Incremental Subgradient Algorithm, and Set Location Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Han Le, Nguyen Mau Nam, Nguyen Thai An","submitted_at":"2013-03-15T11:18:56Z","abstract_excerpt":"In recent years, important progress has been made in applying methods and techniques of convex optimization to many fields of applications such as location science, engineering, computational statistics, and computer science. In this paper, we present some simple algorithms for solving a number of new models of facility location involving sets which generalize the classical Fermat-Torricelli problem and the smallest enclosing circle problem. The general nondifferentiability of the models prevents us from applying gradient-type algorithms, so our approach is to use subgradient-type algorithms i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3735","kind":"arxiv","version":3},"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-18T03:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoD3ng4VVDciMqC6Tq2KyDl3lwbDWimS/mIpDXRr+8lDk+9M90eT8s4muFFK/JKbGkpTf1PRbfmxo9L4LPldAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:48:46.467048Z"},"content_sha256":"079bef4f65cfdc8340efb82d298d2145569f4796d9fc35f19688a0bdae6bfb1a","schema_version":"1.0","event_id":"sha256:079bef4f65cfdc8340efb82d298d2145569f4796d9fc35f19688a0bdae6bfb1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q64IORL4NATUXJSSBCDDQM5RBU/bundle.json","state_url":"https://pith.science/pith/Q64IORL4NATUXJSSBCDDQM5RBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q64IORL4NATUXJSSBCDDQM5RBU/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-09T22:48:46Z","links":{"resolver":"https://pith.science/pith/Q64IORL4NATUXJSSBCDDQM5RBU","bundle":"https://pith.science/pith/Q64IORL4NATUXJSSBCDDQM5RBU/bundle.json","state":"https://pith.science/pith/Q64IORL4NATUXJSSBCDDQM5RBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q64IORL4NATUXJSSBCDDQM5RBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q64IORL4NATUXJSSBCDDQM5RBU","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":"e804dc343cc6364cc9e1e2defdd25666abc556e562581c62aac3fc249aacc4af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-15T11:18:56Z","title_canon_sha256":"c9c3420fe943a117ad199f82cc84e2006bf50c4ed49a7f2f1e710adc3fabf949"},"schema_version":"1.0","source":{"id":"1303.3735","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3735","created_at":"2026-05-18T03:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3735v3","created_at":"2026-05-18T03:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3735","created_at":"2026-05-18T03:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"Q64IORL4NATU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q64IORL4NATUXJSS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q64IORL4","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:079bef4f65cfdc8340efb82d298d2145569f4796d9fc35f19688a0bdae6bfb1a","target":"graph","created_at":"2026-05-18T03:04:13Z","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 recent years, important progress has been made in applying methods and techniques of convex optimization to many fields of applications such as location science, engineering, computational statistics, and computer science. In this paper, we present some simple algorithms for solving a number of new models of facility location involving sets which generalize the classical Fermat-Torricelli problem and the smallest enclosing circle problem. The general nondifferentiability of the models prevents us from applying gradient-type algorithms, so our approach is to use subgradient-type algorithms i","authors_text":"Han Le, Nguyen Mau Nam, Nguyen Thai An","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-15T11:18:56Z","title":"Subgradient Algorithm, Stochastic Subgradient Algorithm, Incremental Subgradient Algorithm, and Set Location Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3735","kind":"arxiv","version":3},"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:e5dcbda469d0198a8c425dedd6f84feffa1348d1e36debb4e83e8ee117d77159","target":"record","created_at":"2026-05-18T03:04:13Z","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":"e804dc343cc6364cc9e1e2defdd25666abc556e562581c62aac3fc249aacc4af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-15T11:18:56Z","title_canon_sha256":"c9c3420fe943a117ad199f82cc84e2006bf50c4ed49a7f2f1e710adc3fabf949"},"schema_version":"1.0","source":{"id":"1303.3735","kind":"arxiv","version":3}},"canonical_sha256":"87b887457c68274ba65208863833b10d0fccc6305b7bb4cf3463f140b4feb860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87b887457c68274ba65208863833b10d0fccc6305b7bb4cf3463f140b4feb860","first_computed_at":"2026-05-18T03:04:13.871403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:13.871403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cxbzmpG7EDnbJJEmndOi1pvzJ1y2dAaJFBFGz91UIB8Bfc45n3JXhPtbbwFU/oP4AyADbMM6Z5p2vrNqhSGwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:13.871988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3735","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5dcbda469d0198a8c425dedd6f84feffa1348d1e36debb4e83e8ee117d77159","sha256:079bef4f65cfdc8340efb82d298d2145569f4796d9fc35f19688a0bdae6bfb1a"],"state_sha256":"5f2340c0c03ea6b1ae437005b348c4c0a3d2bbc4211f84969d17b23338b50ee0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upoymNsowVM94/+YWbZJ9E6xkkfTcN32ZDRAyodwXeekNpSnbws+My1uBshOwnMuK9r94iVQtnQIvCDw3cDODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:48:46.470365Z","bundle_sha256":"840e941730fcd54ba6cf2b8b075192a91ddcd197350d8fc8e638aca0aa8f014a"}}