{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FEBBG6WMYDVR4D5655EAEPEF7T","short_pith_number":"pith:FEBBG6WM","canonical_record":{"source":{"id":"1309.5781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T12:10:14Z","cross_cats_sorted":[],"title_canon_sha256":"af8fa1953510f2ceee3608dd4c9aabf51586dfbff2775c4365d2291289ec0023","abstract_canon_sha256":"aa0808d9e9c1a6360aca4b954ece3b325a1c30aa09f378af615fb84fc2b4997a"},"schema_version":"1.0"},"canonical_sha256":"2902137accc0eb1e0fbeef48023c85fcda7eac66d71dd6977701c80cfbe2d422","source":{"kind":"arxiv","id":"1309.5781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5781","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5781v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5781","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"FEBBG6WMYDVR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FEBBG6WMYDVR4D56","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FEBBG6WM","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FEBBG6WMYDVR4D5655EAEPEF7T","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T12:10:14Z","cross_cats_sorted":[],"title_canon_sha256":"af8fa1953510f2ceee3608dd4c9aabf51586dfbff2775c4365d2291289ec0023","abstract_canon_sha256":"aa0808d9e9c1a6360aca4b954ece3b325a1c30aa09f378af615fb84fc2b4997a"},"schema_version":"1.0"},"canonical_sha256":"2902137accc0eb1e0fbeef48023c85fcda7eac66d71dd6977701c80cfbe2d422","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:34.174561Z","signature_b64":"h840Umut6z16Y0BaQBloF9lFJWCfAQhKtX6UvilMSYDfaPLZ1BIyKWSvdxzYkamCM0wVrW++YJrMYDz+mZXnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2902137accc0eb1e0fbeef48023c85fcda7eac66d71dd6977701c80cfbe2d422","last_reissued_at":"2026-05-18T03:12:34.173860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:34.173860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5781","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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTMZ7I6riEZCc1iGicqIaPmQX3Z8LlA/KTkQibjU8lZeOc9XvF280OJeqE8SfDtcxVECTsFPRyf1Mg4Kb5NOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:39:47.840698Z"},"content_sha256":"3ead7180d96f29cfec81a6f3f3fa4dcdffed23a44d6eebcf6850da4f6ed235b7","schema_version":"1.0","event_id":"sha256:3ead7180d96f29cfec81a6f3f3fa4dcdffed23a44d6eebcf6850da4f6ed235b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FEBBG6WMYDVR4D5655EAEPEF7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PROBI: A Heuristic for the probabilistic k-median problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hendrik Fichtenberger, Melanie Schmidt","submitted_at":"2013-09-23T12:10:14Z","abstract_excerpt":"We develop the heuristic PROBI for the probabilistic Euclidean k-median problem based on a coreset construction by Lammersen et al. Our algorithm computes a summary of the data and then uses an adapted version of k-means++ (Arthur and Vassilvitskii, 2007) to compute a good solution on the summary. The summary is maintained in a data stream, so PROBI can be used in a data stream setting on very large data sets. We experimentally evaluate the quality of the summary and of the computed solution and compare the running time to state of the art data stream clustering algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5781","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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+6yVGUw+y5Fl2aKQ/0ODiaqBAd5xff6bs8siTB1iBDcqxw7JYNVVSj9JSukrfpAPV9icWeL8U3YME6DvJTSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:39:47.841245Z"},"content_sha256":"e5b3cc6bbf4f32f4c09d9feb4e305dece476c638f93406fd3b49f987f2b14974","schema_version":"1.0","event_id":"sha256:e5b3cc6bbf4f32f4c09d9feb4e305dece476c638f93406fd3b49f987f2b14974"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEBBG6WMYDVR4D5655EAEPEF7T/bundle.json","state_url":"https://pith.science/pith/FEBBG6WMYDVR4D5655EAEPEF7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEBBG6WMYDVR4D5655EAEPEF7T/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-05-27T17:39:47Z","links":{"resolver":"https://pith.science/pith/FEBBG6WMYDVR4D5655EAEPEF7T","bundle":"https://pith.science/pith/FEBBG6WMYDVR4D5655EAEPEF7T/bundle.json","state":"https://pith.science/pith/FEBBG6WMYDVR4D5655EAEPEF7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEBBG6WMYDVR4D5655EAEPEF7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FEBBG6WMYDVR4D5655EAEPEF7T","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":"aa0808d9e9c1a6360aca4b954ece3b325a1c30aa09f378af615fb84fc2b4997a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T12:10:14Z","title_canon_sha256":"af8fa1953510f2ceee3608dd4c9aabf51586dfbff2775c4365d2291289ec0023"},"schema_version":"1.0","source":{"id":"1309.5781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5781","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5781v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5781","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"FEBBG6WMYDVR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FEBBG6WMYDVR4D56","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FEBBG6WM","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:e5b3cc6bbf4f32f4c09d9feb4e305dece476c638f93406fd3b49f987f2b14974","target":"graph","created_at":"2026-05-18T03:12:34Z","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 develop the heuristic PROBI for the probabilistic Euclidean k-median problem based on a coreset construction by Lammersen et al. Our algorithm computes a summary of the data and then uses an adapted version of k-means++ (Arthur and Vassilvitskii, 2007) to compute a good solution on the summary. The summary is maintained in a data stream, so PROBI can be used in a data stream setting on very large data sets. We experimentally evaluate the quality of the summary and of the computed solution and compare the running time to state of the art data stream clustering algorithms.","authors_text":"Hendrik Fichtenberger, Melanie Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T12:10:14Z","title":"PROBI: A Heuristic for the probabilistic k-median problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5781","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:3ead7180d96f29cfec81a6f3f3fa4dcdffed23a44d6eebcf6850da4f6ed235b7","target":"record","created_at":"2026-05-18T03:12:34Z","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":"aa0808d9e9c1a6360aca4b954ece3b325a1c30aa09f378af615fb84fc2b4997a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T12:10:14Z","title_canon_sha256":"af8fa1953510f2ceee3608dd4c9aabf51586dfbff2775c4365d2291289ec0023"},"schema_version":"1.0","source":{"id":"1309.5781","kind":"arxiv","version":1}},"canonical_sha256":"2902137accc0eb1e0fbeef48023c85fcda7eac66d71dd6977701c80cfbe2d422","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2902137accc0eb1e0fbeef48023c85fcda7eac66d71dd6977701c80cfbe2d422","first_computed_at":"2026-05-18T03:12:34.173860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:34.173860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h840Umut6z16Y0BaQBloF9lFJWCfAQhKtX6UvilMSYDfaPLZ1BIyKWSvdxzYkamCM0wVrW++YJrMYDz+mZXnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:34.174561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ead7180d96f29cfec81a6f3f3fa4dcdffed23a44d6eebcf6850da4f6ed235b7","sha256:e5b3cc6bbf4f32f4c09d9feb4e305dece476c638f93406fd3b49f987f2b14974"],"state_sha256":"e0ddfbaaf1909788ac361fe319ed0bc6718aaa48f433ba654ae19736bdac9f76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6oc7K37IQV28g8uVFRUXTraMu/o8QrJUUyHbYXxDoL14NLSx/3meyDtaloTjXjqwzLGrKMahU3RjpAUmsMZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:39:47.844481Z","bundle_sha256":"c9b23d8fe3e820397d50a330aa244ce8f48f6eecb1a96072caa36d66e7951a14"}}