{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J7YLSVKY452GCT3ZWSS3GGKNHC","short_pith_number":"pith:J7YLSVKY","canonical_record":{"source":{"id":"2402.04035","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-02-06T14:32:13Z","cross_cats_sorted":[],"title_canon_sha256":"1902b57010200956ffa37290512407abb33dbeb2687139cd0f0bf8985c3cc4c1","abstract_canon_sha256":"ee8bde42ef93d6df95b4301480cdf5087253384d9b42c398e9ea6a31767cbc64"},"schema_version":"1.0"},"canonical_sha256":"4ff0b95558e774614f79b4a5b3194d38979718a15806371cb3bb781af65056e4","source":{"kind":"arxiv","id":"2402.04035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04035","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04035v1","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04035","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"J7YLSVKY452G","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"pith_short_16","alias_value":"J7YLSVKY452GCT3Z","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"pith_short_8","alias_value":"J7YLSVKY","created_at":"2026-07-05T07:42:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J7YLSVKY452GCT3ZWSS3GGKNHC","target":"record","payload":{"canonical_record":{"source":{"id":"2402.04035","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-02-06T14:32:13Z","cross_cats_sorted":[],"title_canon_sha256":"1902b57010200956ffa37290512407abb33dbeb2687139cd0f0bf8985c3cc4c1","abstract_canon_sha256":"ee8bde42ef93d6df95b4301480cdf5087253384d9b42c398e9ea6a31767cbc64"},"schema_version":"1.0"},"canonical_sha256":"4ff0b95558e774614f79b4a5b3194d38979718a15806371cb3bb781af65056e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:42:02.217242Z","signature_b64":"CIX4VHJe5awCIgYdYm5xq/x6/jEWacDwAj25P1OwjqqAvU0efFcyEDoG4QpcXmq9k9RccOaQw/O6H1LOaYSkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ff0b95558e774614f79b4a5b3194d38979718a15806371cb3bb781af65056e4","last_reissued_at":"2026-07-05T07:42:02.216797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:42:02.216797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.04035","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-07-05T07:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLlG1JpTuaiTT4esxebn+Mqo81/xtoGl4714iRVRb1dt6l1n8BgQUbkLhMmcrSUYHhMBJfq2Ub8tbXV6n6mPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T16:44:54.342656Z"},"content_sha256":"b17a083526cfb36c5bb686529465307dfe20ff5fd976d60ddf54e858bc34a85c","schema_version":"1.0","event_id":"sha256:b17a083526cfb36c5bb686529465307dfe20ff5fd976d60ddf54e858bc34a85c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J7YLSVKY452GCT3ZWSS3GGKNHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Distortion Clustering with Ordinal and Limited Cardinal Information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chris Schwiegelshohn, Ioannis Caragiannis, Jakob Burkhardt, Karl Fehrs, Matteo Russo, Sudarshan Shyam","submitted_at":"2024-02-06T14:32:13Z","abstract_excerpt":"Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of $n$ agents located in an underlying metric space, our goal is to partition them into $k$ clusters, optimizing some social cost objective. The metric space is defined by a distance function $d$ between the agent locations. Information about $d$ is available only implicitly via $n$ rankings, through which each agent ranks all other agents in terms of their distance from her. Still, we would like to evaluate clustering algorithms in terms of social cost objecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04035","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.04035/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPHQMyh3tumfNiE08Ox7D+Kq9SkAHZuUcGw67Nk9PY2NvQREp/Lr0vpR71B7aROu+vk9qNOTFBwRK4MTCC8pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T16:44:54.343032Z"},"content_sha256":"e941114e333a112bcf9da2750f62b948d4b3ff5ae424a123d9c38e83ea01162d","schema_version":"1.0","event_id":"sha256:e941114e333a112bcf9da2750f62b948d4b3ff5ae424a123d9c38e83ea01162d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7YLSVKY452GCT3ZWSS3GGKNHC/bundle.json","state_url":"https://pith.science/pith/J7YLSVKY452GCT3ZWSS3GGKNHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7YLSVKY452GCT3ZWSS3GGKNHC/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-07-12T16:44:54Z","links":{"resolver":"https://pith.science/pith/J7YLSVKY452GCT3ZWSS3GGKNHC","bundle":"https://pith.science/pith/J7YLSVKY452GCT3ZWSS3GGKNHC/bundle.json","state":"https://pith.science/pith/J7YLSVKY452GCT3ZWSS3GGKNHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7YLSVKY452GCT3ZWSS3GGKNHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J7YLSVKY452GCT3ZWSS3GGKNHC","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":"ee8bde42ef93d6df95b4301480cdf5087253384d9b42c398e9ea6a31767cbc64","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-02-06T14:32:13Z","title_canon_sha256":"1902b57010200956ffa37290512407abb33dbeb2687139cd0f0bf8985c3cc4c1"},"schema_version":"1.0","source":{"id":"2402.04035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04035","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04035v1","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04035","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"J7YLSVKY452G","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"pith_short_16","alias_value":"J7YLSVKY452GCT3Z","created_at":"2026-07-05T07:42:02Z"},{"alias_kind":"pith_short_8","alias_value":"J7YLSVKY","created_at":"2026-07-05T07:42:02Z"}],"graph_snapshots":[{"event_id":"sha256:e941114e333a112bcf9da2750f62b948d4b3ff5ae424a123d9c38e83ea01162d","target":"graph","created_at":"2026-07-05T07:42:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.04035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of $n$ agents located in an underlying metric space, our goal is to partition them into $k$ clusters, optimizing some social cost objective. The metric space is defined by a distance function $d$ between the agent locations. Information about $d$ is available only implicitly via $n$ rankings, through which each agent ranks all other agents in terms of their distance from her. Still, we would like to evaluate clustering algorithms in terms of social cost objecti","authors_text":"Chris Schwiegelshohn, Ioannis Caragiannis, Jakob Burkhardt, Karl Fehrs, Matteo Russo, Sudarshan Shyam","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-02-06T14:32:13Z","title":"Low-Distortion Clustering with Ordinal and Limited Cardinal Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04035","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:b17a083526cfb36c5bb686529465307dfe20ff5fd976d60ddf54e858bc34a85c","target":"record","created_at":"2026-07-05T07:42:02Z","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":"ee8bde42ef93d6df95b4301480cdf5087253384d9b42c398e9ea6a31767cbc64","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-02-06T14:32:13Z","title_canon_sha256":"1902b57010200956ffa37290512407abb33dbeb2687139cd0f0bf8985c3cc4c1"},"schema_version":"1.0","source":{"id":"2402.04035","kind":"arxiv","version":1}},"canonical_sha256":"4ff0b95558e774614f79b4a5b3194d38979718a15806371cb3bb781af65056e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ff0b95558e774614f79b4a5b3194d38979718a15806371cb3bb781af65056e4","first_computed_at":"2026-07-05T07:42:02.216797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:42:02.216797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CIX4VHJe5awCIgYdYm5xq/x6/jEWacDwAj25P1OwjqqAvU0efFcyEDoG4QpcXmq9k9RccOaQw/O6H1LOaYSkAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:42:02.217242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.04035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b17a083526cfb36c5bb686529465307dfe20ff5fd976d60ddf54e858bc34a85c","sha256:e941114e333a112bcf9da2750f62b948d4b3ff5ae424a123d9c38e83ea01162d"],"state_sha256":"214a80bd2df3f95847a4b9419b82c687f29dbb894b5c15832ca6d6b7fac11689"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTwj/leYloe7FXLDOny4SCM3lyyIcg5T5IVR4TTACk5nS7XfPiwqkcyW6Q7xkLVR9E8NOwVqAWSuOyGxs5opDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T16:44:54.345152Z","bundle_sha256":"a22cb79e0a49b9db4adc4d1ae87a20bff82d58b6df38345493c7bac310a90947"}}