{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TLT4WTJP6VQBFBKSA62B2R35E3","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":"5909b143b4eb46eb6d62f08790c59efefe9d14588ca5cc742d9115688c2ccd39","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T14:03:19Z","title_canon_sha256":"b315a1fcb1ce1c53e3c086e7c04495716f99379297ac8b50f3b7adbdba5f744e"},"schema_version":"1.0","source":{"id":"1705.08773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08773","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08773v1","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08773","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"TLT4WTJP6VQB","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLT4WTJP6VQBFBKS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLT4WTJP","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:5fee49e5c1984fed5299c42c1426257c4c159ce00ebd29d104da5322c55add86","target":"graph","created_at":"2026-05-18T00:43:44Z","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":"In the k-partition problem (k-PP), one is given an edge-weighted undirected graph, and one must partition the node set into at most k subsets, in order to minimise (or maximise) the total weight of the edges that have their end-nodes in the same cluster. Various hierarchical variants of this problem have been studied in the context of data mining. We consider a 'two-level' variant that arises in mobile wireless communications. We show that an exact algorithm based on intelligent preprocessing, cutting planes and symmetry-breaking is capable of solving small- and medium-size instances to proven","authors_text":"Adam Letchford, Jamie Fairbrother, Keith Briggs","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T14:03:19Z","title":"A Two-Level Graph Partitioning Problem Arising in Mobile Wireless Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08773","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:61b579835027ab36b0e05b402903439a32c1350e8dbe766a8504e2c886a3331a","target":"record","created_at":"2026-05-18T00:43:44Z","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":"5909b143b4eb46eb6d62f08790c59efefe9d14588ca5cc742d9115688c2ccd39","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T14:03:19Z","title_canon_sha256":"b315a1fcb1ce1c53e3c086e7c04495716f99379297ac8b50f3b7adbdba5f744e"},"schema_version":"1.0","source":{"id":"1705.08773","kind":"arxiv","version":1}},"canonical_sha256":"9ae7cb4d2ff56012855207b41d477d26d78ee7bc445713e65ac3f87244059943","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ae7cb4d2ff56012855207b41d477d26d78ee7bc445713e65ac3f87244059943","first_computed_at":"2026-05-18T00:43:44.292907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:44.292907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0UScFR3BMwJqs3g3jSk7HG8XJ21pYjVYWH6XjzhnFfKstlKEnx12hAqjuG6HqNLZAH4WqU0pdW5tGJOie0XRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:44.293527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61b579835027ab36b0e05b402903439a32c1350e8dbe766a8504e2c886a3331a","sha256:5fee49e5c1984fed5299c42c1426257c4c159ce00ebd29d104da5322c55add86"],"state_sha256":"c114635393a126fae185e922b9aa16682ed7dde7a0217a752047283a8961d0da"}