{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3BPEZBGVAAC3LPBQI34TDF625L","short_pith_number":"pith:3BPEZBGV","canonical_record":{"source":{"id":"2506.13533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T14:23:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4a0bd6419480da5f93b949fe970ce75bbe4198a72e817c175127903b0ee2c766","abstract_canon_sha256":"16cfeccd1f413af11e044370cc824e44965c4c846a48594f44f9ac85b86d1bd1"},"schema_version":"1.0"},"canonical_sha256":"d85e4c84d50005b5bc3046f93197daeae92b060af83d439c3dbf32a2e3f17db9","source":{"kind":"arxiv","id":"2506.13533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.13533","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"2506.13533v1","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13533","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"3BPEZBGVAAC3","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"pith_short_16","alias_value":"3BPEZBGVAAC3LPBQ","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"pith_short_8","alias_value":"3BPEZBGV","created_at":"2026-07-05T11:22:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3BPEZBGVAAC3LPBQI34TDF625L","target":"record","payload":{"canonical_record":{"source":{"id":"2506.13533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T14:23:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4a0bd6419480da5f93b949fe970ce75bbe4198a72e817c175127903b0ee2c766","abstract_canon_sha256":"16cfeccd1f413af11e044370cc824e44965c4c846a48594f44f9ac85b86d1bd1"},"schema_version":"1.0"},"canonical_sha256":"d85e4c84d50005b5bc3046f93197daeae92b060af83d439c3dbf32a2e3f17db9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:21.754121Z","signature_b64":"bBTEmYiRAAbGtlR2FAD7DXOpYrFnvhkLX57KpJ0VtF9851SkQN6HFcRguYkDyFVGn2k4G0JbBMohth+G6Gq3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85e4c84d50005b5bc3046f93197daeae92b060af83d439c3dbf32a2e3f17db9","last_reissued_at":"2026-07-05T11:22:21.753490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:21.753490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.13533","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-05T11:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpkxRL2mSHwx8KME9fcFE9pxUOQwBD20F5RvCqgcCn2GRazLmegJwL7OMPouya7juyLLOvk4zvvPC0vItucAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:15:09.317127Z"},"content_sha256":"a3a9a2a7fd6af961d8b74c6543e4acf85b24e6fa493a95b1cebcc5085f2ae434","schema_version":"1.0","event_id":"sha256:a3a9a2a7fd6af961d8b74c6543e4acf85b24e6fa493a95b1cebcc5085f2ae434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3BPEZBGVAAC3LPBQI34TDF625L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Augmented Graph $k$-Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Chenglin Fan, Kijun Shin","submitted_at":"2025-06-16T14:23:16Z","abstract_excerpt":"Clustering is a fundamental task in unsupervised learning. Previous research has focused on learning-augmented $k$-means in Euclidean metrics, limiting its applicability to complex data representations. In this paper, we generalize learning-augmented $k$-clustering to operate on general metrics, enabling its application to graph-structured and non-Euclidean domains. Our framework also relaxes restrictive cluster size constraints, providing greater flexibility for datasets with imbalanced or unknown cluster distributions. Furthermore, we extend the hardness of query complexity to general metric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13533","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/2506.13533/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-05T11:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zg5D5pugs5lB1CKFDmcTWdg3H9mpizOjHyBJ2LNLyK5IgF6gwXfyj+THeVTtDMacp2XxXdNeeyEMpkPHGfZQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:15:09.318022Z"},"content_sha256":"25cb2c0e9d97895031e9fcac9ce0a6c5734ed90d6e4095d71e7106a9392d2a74","schema_version":"1.0","event_id":"sha256:25cb2c0e9d97895031e9fcac9ce0a6c5734ed90d6e4095d71e7106a9392d2a74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BPEZBGVAAC3LPBQI34TDF625L/bundle.json","state_url":"https://pith.science/pith/3BPEZBGVAAC3LPBQI34TDF625L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BPEZBGVAAC3LPBQI34TDF625L/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-08-19T13:15:09Z","links":{"resolver":"https://pith.science/pith/3BPEZBGVAAC3LPBQI34TDF625L","bundle":"https://pith.science/pith/3BPEZBGVAAC3LPBQI34TDF625L/bundle.json","state":"https://pith.science/pith/3BPEZBGVAAC3LPBQI34TDF625L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BPEZBGVAAC3LPBQI34TDF625L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3BPEZBGVAAC3LPBQI34TDF625L","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":"16cfeccd1f413af11e044370cc824e44965c4c846a48594f44f9ac85b86d1bd1","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T14:23:16Z","title_canon_sha256":"4a0bd6419480da5f93b949fe970ce75bbe4198a72e817c175127903b0ee2c766"},"schema_version":"1.0","source":{"id":"2506.13533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.13533","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"2506.13533v1","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13533","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"3BPEZBGVAAC3","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"pith_short_16","alias_value":"3BPEZBGVAAC3LPBQ","created_at":"2026-07-05T11:22:21Z"},{"alias_kind":"pith_short_8","alias_value":"3BPEZBGV","created_at":"2026-07-05T11:22:21Z"}],"graph_snapshots":[{"event_id":"sha256:25cb2c0e9d97895031e9fcac9ce0a6c5734ed90d6e4095d71e7106a9392d2a74","target":"graph","created_at":"2026-07-05T11:22:21Z","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/2506.13533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering is a fundamental task in unsupervised learning. Previous research has focused on learning-augmented $k$-means in Euclidean metrics, limiting its applicability to complex data representations. In this paper, we generalize learning-augmented $k$-clustering to operate on general metrics, enabling its application to graph-structured and non-Euclidean domains. Our framework also relaxes restrictive cluster size constraints, providing greater flexibility for datasets with imbalanced or unknown cluster distributions. Furthermore, we extend the hardness of query complexity to general metric","authors_text":"Chenglin Fan, Kijun Shin","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13533","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:a3a9a2a7fd6af961d8b74c6543e4acf85b24e6fa493a95b1cebcc5085f2ae434","target":"record","created_at":"2026-07-05T11:22:21Z","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":"16cfeccd1f413af11e044370cc824e44965c4c846a48594f44f9ac85b86d1bd1","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T14:23:16Z","title_canon_sha256":"4a0bd6419480da5f93b949fe970ce75bbe4198a72e817c175127903b0ee2c766"},"schema_version":"1.0","source":{"id":"2506.13533","kind":"arxiv","version":1}},"canonical_sha256":"d85e4c84d50005b5bc3046f93197daeae92b060af83d439c3dbf32a2e3f17db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d85e4c84d50005b5bc3046f93197daeae92b060af83d439c3dbf32a2e3f17db9","first_computed_at":"2026-07-05T11:22:21.753490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:21.753490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBTEmYiRAAbGtlR2FAD7DXOpYrFnvhkLX57KpJ0VtF9851SkQN6HFcRguYkDyFVGn2k4G0JbBMohth+G6Gq3BA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:21.754121Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.13533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3a9a2a7fd6af961d8b74c6543e4acf85b24e6fa493a95b1cebcc5085f2ae434","sha256:25cb2c0e9d97895031e9fcac9ce0a6c5734ed90d6e4095d71e7106a9392d2a74"],"state_sha256":"59c5ddd907f59ebe901821345d678af10c294fecc2df7ea214b5c868b2ab69d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIf+Jf+WR+07/gy9f7MfqQmOP51XBQkPu3zd42TeZNVqRG4EW5jMDTItOyyljSD0YTdUViq50aeO2b2jrY7RCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:15:09.325128Z","bundle_sha256":"135b4652a6a2cc3760845d62d8a8c3bec4096e3b001a45d27b8054ad9932d9b4"}}