{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:PKEJ26BWSQ7HCFICDK63YGOD5U","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":"d7724686bbc21657c1d760b14b18ae0f44842f5ebe3df2a9c91ba2eaf0861d2b","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2005-04-27T19:36:08Z","title_canon_sha256":"e2c5a8ad4d0d269c2e1a269d3aff53e7bdf1d83d5a49828eaa532fa3104489d0"},"schema_version":"1.0","source":{"id":"cs/0504104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0504104","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0504104v2","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504104","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"PKEJ26BWSQ7H","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"PKEJ26BWSQ7HCFIC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"PKEJ26BW","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:852f489f871d21f37ff7aa94f6524aedba28b187f1fd0b5bc4d74d5f5754803f","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"The Reverse Greedy algorithm (RGreedy) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the resulting total distance from the customers to the remaining facilities. It stops when k facilities remain. We prove that, if the distance function is metric, then the approximation ratio of RGreedy is between ?(log n/ log log n) and O(log n).","authors_text":"Claire Kenyon, Marek Chrobak, Neal E. Young","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2005-04-27T19:36:08Z","title":"The reverse greedy algorithm for the metric k-median problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0504104","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:af3f9e68d61c740e8dfe3fa2d3eee720c2e141bd05fe51ee827c3f054946cb66","target":"record","created_at":"2026-05-18T01:59:53Z","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":"d7724686bbc21657c1d760b14b18ae0f44842f5ebe3df2a9c91ba2eaf0861d2b","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2005-04-27T19:36:08Z","title_canon_sha256":"e2c5a8ad4d0d269c2e1a269d3aff53e7bdf1d83d5a49828eaa532fa3104489d0"},"schema_version":"1.0","source":{"id":"cs/0504104","kind":"arxiv","version":2}},"canonical_sha256":"7a889d7836943e7115021abdbc19c3ed202529aeeda8400337cdb01b14ac0857","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a889d7836943e7115021abdbc19c3ed202529aeeda8400337cdb01b14ac0857","first_computed_at":"2026-05-18T01:59:53.860952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.860952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ltOdrqEyYxIsGs8XG6b3VxQ/kfsiiHt3Gm0wlh1ixVOJXQabV08M59os/7V/EoniYDis60+jCexvHagOUsa+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.861569Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0504104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af3f9e68d61c740e8dfe3fa2d3eee720c2e141bd05fe51ee827c3f054946cb66","sha256:852f489f871d21f37ff7aa94f6524aedba28b187f1fd0b5bc4d74d5f5754803f"],"state_sha256":"a9375440b11e2e6f8043fc031b61a344cf2600061cf1e6fe2e5b404bb71c0ad6"}