{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MEKFWKLTG5EQZQKO3CRPQPUI3B","short_pith_number":"pith:MEKFWKLT","canonical_record":{"source":{"id":"2607.06709","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T18:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"bcfd782ba0d48bf3be0e8e61ce97e75e8dd9683c237f481945923ccd588ac0fa","abstract_canon_sha256":"ed5a808d9bdcdf474b42b4c00fced5e82012ac7c21dc64d7ba662999caf567a7"},"schema_version":"1.0"},"canonical_sha256":"61145b297337490cc14ed8a2f83e88d8515006ac3f1a4579510151728c385429","source":{"kind":"arxiv","id":"2607.06709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06709","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06709v1","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06709","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"MEKFWKLTG5EQ","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"MEKFWKLTG5EQZQKO","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"MEKFWKLT","created_at":"2026-07-09T00:19:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MEKFWKLTG5EQZQKO3CRPQPUI3B","target":"record","payload":{"canonical_record":{"source":{"id":"2607.06709","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T18:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"bcfd782ba0d48bf3be0e8e61ce97e75e8dd9683c237f481945923ccd588ac0fa","abstract_canon_sha256":"ed5a808d9bdcdf474b42b4c00fced5e82012ac7c21dc64d7ba662999caf567a7"},"schema_version":"1.0"},"canonical_sha256":"61145b297337490cc14ed8a2f83e88d8515006ac3f1a4579510151728c385429","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T00:19:24.172363Z","signature_b64":"6RFSJqbOOk5VWWobQw949jYbNvm9CQbj+RcNZwY7urUcZXS4//4HbNB+uHz/8maKOklkxsUnIHVBh3yKQzksAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61145b297337490cc14ed8a2f83e88d8515006ac3f1a4579510151728c385429","last_reissued_at":"2026-07-09T00:19:24.171915Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T00:19:24.171915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.06709","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-09T00:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2H3oE3a0akxn4mdBgunluFdUK4VAdnhhE9j9kIwCPAwfxa4HZIrvBHFeX6tn1rCRvttaHP1tlkf3THiXy7xDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:48:02.533337Z"},"content_sha256":"c5dbcb5f3e15c4caf5a8f60ca9b43b25dc01edafb11898162a6d698091698139","schema_version":"1.0","event_id":"sha256:c5dbcb5f3e15c4caf5a8f60ca9b43b25dc01edafb11898162a6d698091698139"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MEKFWKLTG5EQZQKO3CRPQPUI3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A scalable linear programming-based framework for data clustering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aida Khajavirad, Huanwen Shen, Yakun Wang","submitted_at":"2026-07-07T18:24:53Z","abstract_excerpt":"We extend the linear programming-based algorithm of De Rosa et al~\\cite{derKhaWan24} for K-means clustering to two important clustering paradigms: fair K-means clustering and spectral clustering. For fair K-means clustering, we show that widely used notions of group fairness can be incorporated into the partition-matrix formulation of K-means clustering through a linear number of linear inequalities. For spectral clustering, we consider a linear programming relaxation of the minimum ratio-cut problem that fits naturally within the same framework. We complement these formulations with problem-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06709","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/2607.06709/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-09T00:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvFVemGnkOEdkzDWKHQyytBYcyMqfu8aNZsz+5iajFiJQ5xKX98XoPTAu0DJxV6g/PU8hBuWEiqF0bwTE32QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:48:02.533837Z"},"content_sha256":"742f41f07b65819a6912c3e68a0887262b4fba0c981f9435f596fab33b86d1ba","schema_version":"1.0","event_id":"sha256:742f41f07b65819a6912c3e68a0887262b4fba0c981f9435f596fab33b86d1ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B/bundle.json","state_url":"https://pith.science/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B/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:48:02Z","links":{"resolver":"https://pith.science/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B","bundle":"https://pith.science/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B/bundle.json","state":"https://pith.science/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEKFWKLTG5EQZQKO3CRPQPUI3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MEKFWKLTG5EQZQKO3CRPQPUI3B","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":"ed5a808d9bdcdf474b42b4c00fced5e82012ac7c21dc64d7ba662999caf567a7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T18:24:53Z","title_canon_sha256":"bcfd782ba0d48bf3be0e8e61ce97e75e8dd9683c237f481945923ccd588ac0fa"},"schema_version":"1.0","source":{"id":"2607.06709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06709","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06709v1","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06709","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"MEKFWKLTG5EQ","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"MEKFWKLTG5EQZQKO","created_at":"2026-07-09T00:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"MEKFWKLT","created_at":"2026-07-09T00:19:24Z"}],"graph_snapshots":[{"event_id":"sha256:742f41f07b65819a6912c3e68a0887262b4fba0c981f9435f596fab33b86d1ba","target":"graph","created_at":"2026-07-09T00:19:24Z","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/2607.06709/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We extend the linear programming-based algorithm of De Rosa et al~\\cite{derKhaWan24} for K-means clustering to two important clustering paradigms: fair K-means clustering and spectral clustering. For fair K-means clustering, we show that widely used notions of group fairness can be incorporated into the partition-matrix formulation of K-means clustering through a linear number of linear inequalities. For spectral clustering, we consider a linear programming relaxation of the minimum ratio-cut problem that fits naturally within the same framework. We complement these formulations with problem-s","authors_text":"Aida Khajavirad, Huanwen Shen, Yakun Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T18:24:53Z","title":"A scalable linear programming-based framework for data clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06709","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:c5dbcb5f3e15c4caf5a8f60ca9b43b25dc01edafb11898162a6d698091698139","target":"record","created_at":"2026-07-09T00:19:24Z","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":"ed5a808d9bdcdf474b42b4c00fced5e82012ac7c21dc64d7ba662999caf567a7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-07T18:24:53Z","title_canon_sha256":"bcfd782ba0d48bf3be0e8e61ce97e75e8dd9683c237f481945923ccd588ac0fa"},"schema_version":"1.0","source":{"id":"2607.06709","kind":"arxiv","version":1}},"canonical_sha256":"61145b297337490cc14ed8a2f83e88d8515006ac3f1a4579510151728c385429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61145b297337490cc14ed8a2f83e88d8515006ac3f1a4579510151728c385429","first_computed_at":"2026-07-09T00:19:24.171915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T00:19:24.171915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6RFSJqbOOk5VWWobQw949jYbNvm9CQbj+RcNZwY7urUcZXS4//4HbNB+uHz/8maKOklkxsUnIHVBh3yKQzksAg==","signature_status":"signed_v1","signed_at":"2026-07-09T00:19:24.172363Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.06709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5dbcb5f3e15c4caf5a8f60ca9b43b25dc01edafb11898162a6d698091698139","sha256:742f41f07b65819a6912c3e68a0887262b4fba0c981f9435f596fab33b86d1ba"],"state_sha256":"b294a7ffc0a3aef72d9bccad9943fdf009aff1b848c8ebf6b0f9c8d82f3e03d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iykp1mtvgi7ug3ZgJiJytS+41yO2g4X+MXtL4QKlJRr0YXeDeD1Lss0Vx6bearRU+BXlh4YCnYBqaFEyzk/cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:48:02.539009Z","bundle_sha256":"ef6287411507b3a462b65b2997a0fa5cf86cf42e3be8fbbb568bb0bd146cd1c2"}}