{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U5XPEDJA5E5CWVZ25CJU4TVHUI","short_pith_number":"pith:U5XPEDJA","canonical_record":{"source":{"id":"1708.09180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T09:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"1d00520ccfbb4ac621fab86d09c01d7d78ca466fee60aa61f271bb2d4a360804","abstract_canon_sha256":"8a26f351253c7c9707de26f31f91aec7e10c8b157dd58ec09732bcd5d56b7182"},"schema_version":"1.0"},"canonical_sha256":"a76ef20d20e93a2b573ae8934e4ea7a21a3a86a6ca99db131a128e76ff40319b","source":{"kind":"arxiv","id":"1708.09180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09180","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09180v1","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09180","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"U5XPEDJA5E5C","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U5XPEDJA5E5CWVZ2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U5XPEDJA","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U5XPEDJA5E5CWVZ25CJU4TVHUI","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T09:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"1d00520ccfbb4ac621fab86d09c01d7d78ca466fee60aa61f271bb2d4a360804","abstract_canon_sha256":"8a26f351253c7c9707de26f31f91aec7e10c8b157dd58ec09732bcd5d56b7182"},"schema_version":"1.0"},"canonical_sha256":"a76ef20d20e93a2b573ae8934e4ea7a21a3a86a6ca99db131a128e76ff40319b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:20.714848Z","signature_b64":"G8+O0Fr7t8Q0/1/U/xQ8PcUqlilA0qWsgtDSTj8tIEhvEqwA9ZEIrnG6EuZYrgJ626jxe5wc+cdEaoB21Z0WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a76ef20d20e93a2b573ae8934e4ea7a21a3a86a6ca99db131a128e76ff40319b","last_reissued_at":"2026-05-18T00:36:20.714229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:20.714229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09180","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:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPlG6LKBeyP7gTKS22Ip90qK9TEiQRaAFtiuvIXORlqxkKbuTa6bco++iHLJu2ovq7fX+9vRgSD94I4lvN5dDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:00:58.727715Z"},"content_sha256":"2b5584ebad0bc29f1ad141784ae5ab7d59a2d8a1aad8b366bcfe49bfeba1cb5e","schema_version":"1.0","event_id":"sha256:2b5584ebad0bc29f1ad141784ae5ab7d59a2d8a1aad8b366bcfe49bfeba1cb5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U5XPEDJA5E5CWVZ25CJU4TVHUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improvements on the k-center problem for uncertain data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amir Jafari, Sharareh Alipour","submitted_at":"2017-08-30T09:07:06Z","abstract_excerpt":"In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. In this paper, we study the $k$-center problem, for uncertain input. In our setting, each uncertain point $P_i$ is located independently from other points in one of several possible locations $\\{P_{i,1},\\dots, P_{i,z_i}\\}$ in a metric space with metric $d$, with specified probabilities and the goal is to compute $k$-centers $\\{c_1,\\dots, c_k\\}$ that minimize th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09180","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:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kr0bzdwV+/OrRwc4y89c05N/D+Y92ajxtYvOGGJcti7I21fUhXSsuoUDa6qZac2kjT762haSRVt9A604zLBNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:00:58.728049Z"},"content_sha256":"c54318cd604078a6b23c8b9bdd73a2ca57a364773f3917d7fd7ed2a3d92955d3","schema_version":"1.0","event_id":"sha256:c54318cd604078a6b23c8b9bdd73a2ca57a364773f3917d7fd7ed2a3d92955d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI/bundle.json","state_url":"https://pith.science/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI/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-08T15:00:58Z","links":{"resolver":"https://pith.science/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI","bundle":"https://pith.science/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI/bundle.json","state":"https://pith.science/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5XPEDJA5E5CWVZ25CJU4TVHUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U5XPEDJA5E5CWVZ25CJU4TVHUI","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":"8a26f351253c7c9707de26f31f91aec7e10c8b157dd58ec09732bcd5d56b7182","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T09:07:06Z","title_canon_sha256":"1d00520ccfbb4ac621fab86d09c01d7d78ca466fee60aa61f271bb2d4a360804"},"schema_version":"1.0","source":{"id":"1708.09180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09180","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09180v1","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09180","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"U5XPEDJA5E5C","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U5XPEDJA5E5CWVZ2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U5XPEDJA","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:c54318cd604078a6b23c8b9bdd73a2ca57a364773f3917d7fd7ed2a3d92955d3","target":"graph","created_at":"2026-05-18T00:36:20Z","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 real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. In this paper, we study the $k$-center problem, for uncertain input. In our setting, each uncertain point $P_i$ is located independently from other points in one of several possible locations $\\{P_{i,1},\\dots, P_{i,z_i}\\}$ in a metric space with metric $d$, with specified probabilities and the goal is to compute $k$-centers $\\{c_1,\\dots, c_k\\}$ that minimize th","authors_text":"Amir Jafari, Sharareh Alipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T09:07:06Z","title":"Improvements on the k-center problem for uncertain data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09180","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:2b5584ebad0bc29f1ad141784ae5ab7d59a2d8a1aad8b366bcfe49bfeba1cb5e","target":"record","created_at":"2026-05-18T00:36:20Z","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":"8a26f351253c7c9707de26f31f91aec7e10c8b157dd58ec09732bcd5d56b7182","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T09:07:06Z","title_canon_sha256":"1d00520ccfbb4ac621fab86d09c01d7d78ca466fee60aa61f271bb2d4a360804"},"schema_version":"1.0","source":{"id":"1708.09180","kind":"arxiv","version":1}},"canonical_sha256":"a76ef20d20e93a2b573ae8934e4ea7a21a3a86a6ca99db131a128e76ff40319b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a76ef20d20e93a2b573ae8934e4ea7a21a3a86a6ca99db131a128e76ff40319b","first_computed_at":"2026-05-18T00:36:20.714229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:20.714229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8+O0Fr7t8Q0/1/U/xQ8PcUqlilA0qWsgtDSTj8tIEhvEqwA9ZEIrnG6EuZYrgJ626jxe5wc+cdEaoB21Z0WCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:20.714848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b5584ebad0bc29f1ad141784ae5ab7d59a2d8a1aad8b366bcfe49bfeba1cb5e","sha256:c54318cd604078a6b23c8b9bdd73a2ca57a364773f3917d7fd7ed2a3d92955d3"],"state_sha256":"60cc5a7f8fe3345cf5a56329e8723208bf0961db5b03d04c1a86c879f13732ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OPvcva9YhitX8U8f1uHKEvRQpOqRXfH+31bLO3JxCFfRF01tSH0AUGvpF7wns4l1b3XY70+KSVVFC8EkaoYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:00:58.729903Z","bundle_sha256":"01e7f2ba194b0689c47b76aab6fdad76f85161eb41cc4a19e3875d5ab291ce91"}}