{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T6NVUYEUCDJFY5BV5MN5TLGUOG","short_pith_number":"pith:T6NVUYEU","canonical_record":{"source":{"id":"1503.06877","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-24T00:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"69456c8748dd66420a737e7647ddf295dc598ff0d60e2a10df6ecdb1bdad9c38","abstract_canon_sha256":"32c5189d92cb39613a4b191c98a681ec7bcb4ff6b973ed86f2ba4b87218f0b8f"},"schema_version":"1.0"},"canonical_sha256":"9f9b5a609410d25c7435eb1bd9acd471b09b98ca2cbee230eb50bc67b50861ab","source":{"kind":"arxiv","id":"1503.06877","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06877","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06877v3","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06877","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"T6NVUYEUCDJF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T6NVUYEUCDJFY5BV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T6NVUYEU","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T6NVUYEUCDJFY5BV5MN5TLGUOG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06877","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-24T00:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"69456c8748dd66420a737e7647ddf295dc598ff0d60e2a10df6ecdb1bdad9c38","abstract_canon_sha256":"32c5189d92cb39613a4b191c98a681ec7bcb4ff6b973ed86f2ba4b87218f0b8f"},"schema_version":"1.0"},"canonical_sha256":"9f9b5a609410d25c7435eb1bd9acd471b09b98ca2cbee230eb50bc67b50861ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:18.197358Z","signature_b64":"3ywN730JXPOhO1D9Ew8vwPuRtxXd0GrP4aECKSQBrf9z5nRVR8bNreMTVoDU8zWR/2b7NXLH3txWnjfffTaHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f9b5a609410d25c7435eb1bd9acd471b09b98ca2cbee230eb50bc67b50861ab","last_reissued_at":"2026-05-18T01:14:18.196816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:18.196816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06877","source_version":3,"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-18T01:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lDvO9VZtm4Zus11XDAZBC7EvM/z0o5lWIABnFxbsACcm8V8o2qh9xKxPdVedyPJqe5/IbPbF8x/5BK4VUDaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:44:18.894826Z"},"content_sha256":"4c7d59f3978ec6912bd2f9a0a02eb0d098429bf0a0a82fe4e66ddeb69d5def11","schema_version":"1.0","event_id":"sha256:4c7d59f3978ec6912bd2f9a0a02eb0d098429bf0a0a82fe4e66ddeb69d5def11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T6NVUYEUCDJFY5BV5MN5TLGUOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient solutions for weight-balanced partitioning problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shmuel Onn, Steffen Borgwardt","submitted_at":"2015-03-24T00:28:27Z","abstract_excerpt":"We prove polynomial-time solvability of a large class of clustering problems where a weighted set of items has to be partitioned into clusters with respect to some balancing constraints. The data points are weighted with respect to different features and the clusters adhere to given lower and upper bounds on the total weight of their points with respect to each of these features. Further the weight-contribution of a vector to a cluster can depend on the cluster it is assigned to. Our interest in these types of clustering problems is motivated by an application in land consolidation where the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06877","kind":"arxiv","version":3},"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-18T01:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yF2HIkwfHBUWK8OrBqOs2KfRf74oXyX9rV5arxQbKNx0ENKrmZylxd2ZhzMqFTFQQuT5aakOo9zayveyaZg/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:44:18.895538Z"},"content_sha256":"2c599acf770fe6f5ca7648e815cd18d574cd429eac13a75fd53e816b4adff979","schema_version":"1.0","event_id":"sha256:2c599acf770fe6f5ca7648e815cd18d574cd429eac13a75fd53e816b4adff979"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG/bundle.json","state_url":"https://pith.science/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG/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-06-11T11:44:18Z","links":{"resolver":"https://pith.science/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG","bundle":"https://pith.science/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG/bundle.json","state":"https://pith.science/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6NVUYEUCDJFY5BV5MN5TLGUOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T6NVUYEUCDJFY5BV5MN5TLGUOG","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":"32c5189d92cb39613a4b191c98a681ec7bcb4ff6b973ed86f2ba4b87218f0b8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-24T00:28:27Z","title_canon_sha256":"69456c8748dd66420a737e7647ddf295dc598ff0d60e2a10df6ecdb1bdad9c38"},"schema_version":"1.0","source":{"id":"1503.06877","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06877","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06877v3","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06877","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"T6NVUYEUCDJF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T6NVUYEUCDJFY5BV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T6NVUYEU","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:2c599acf770fe6f5ca7648e815cd18d574cd429eac13a75fd53e816b4adff979","target":"graph","created_at":"2026-05-18T01:14:18Z","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 prove polynomial-time solvability of a large class of clustering problems where a weighted set of items has to be partitioned into clusters with respect to some balancing constraints. The data points are weighted with respect to different features and the clusters adhere to given lower and upper bounds on the total weight of their points with respect to each of these features. Further the weight-contribution of a vector to a cluster can depend on the cluster it is assigned to. Our interest in these types of clustering problems is motivated by an application in land consolidation where the a","authors_text":"Shmuel Onn, Steffen Borgwardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-24T00:28:27Z","title":"Efficient solutions for weight-balanced partitioning problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06877","kind":"arxiv","version":3},"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:4c7d59f3978ec6912bd2f9a0a02eb0d098429bf0a0a82fe4e66ddeb69d5def11","target":"record","created_at":"2026-05-18T01:14:18Z","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":"32c5189d92cb39613a4b191c98a681ec7bcb4ff6b973ed86f2ba4b87218f0b8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-24T00:28:27Z","title_canon_sha256":"69456c8748dd66420a737e7647ddf295dc598ff0d60e2a10df6ecdb1bdad9c38"},"schema_version":"1.0","source":{"id":"1503.06877","kind":"arxiv","version":3}},"canonical_sha256":"9f9b5a609410d25c7435eb1bd9acd471b09b98ca2cbee230eb50bc67b50861ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f9b5a609410d25c7435eb1bd9acd471b09b98ca2cbee230eb50bc67b50861ab","first_computed_at":"2026-05-18T01:14:18.196816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:18.196816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ywN730JXPOhO1D9Ew8vwPuRtxXd0GrP4aECKSQBrf9z5nRVR8bNreMTVoDU8zWR/2b7NXLH3txWnjfffTaHBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:18.197358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06877","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c7d59f3978ec6912bd2f9a0a02eb0d098429bf0a0a82fe4e66ddeb69d5def11","sha256:2c599acf770fe6f5ca7648e815cd18d574cd429eac13a75fd53e816b4adff979"],"state_sha256":"a92d294b6d80989f2cc6185962ea2df3f49a31c7a1598a3e5094d85bacbdd924"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rei4LHACrEohcR2BvjlMQpmayZhg90mOQ2MYz9N5QOFhfywdJnKEQNvA1mid8tUKEbsrnGlNmKfPwn9b7JVbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:44:18.898340Z","bundle_sha256":"0d6b6d850d6879b8419785f4ec791d3ee47066bc62e2f8c446345d3d1f59fc80"}}