{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T7WKFZSSQKPA4ZXJ4KRK22K7WM","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":"356abc7b42c9814f2e89097e1087ed9df9f6d0cc4a4e09d8dbbd770697905a7e","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-19T22:53:52Z","title_canon_sha256":"c271654bc2b2455f68ca12a43ac6db91e48f61f7ab261a99453af031f49ef14c"},"schema_version":"1.0","source":{"id":"1907.08720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08720","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08720v1","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08720","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"T7WKFZSSQKPA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"T7WKFZSSQKPA4ZXJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"T7WKFZSS","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:0afa8ac1aa6c0b9f77c7102c3534af486ec6c41ae4c618481b7ef5847accbcbd","target":"graph","created_at":"2026-05-17T23:40:05Z","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":"This work presents a maximum entropy principle based algorithm for solving minimum multiway $k$-cut problem defined over static and dynamic {\\em digraphs}. A multiway $k$-cut problem requires partitioning the set of nodes in a graph into $k$ subsets, such that each subset contains one prespecified node, and the corresponding total cut weight is minimized. These problems arise in many applications and are computationally complex (NP-hard). In the static setting this article presents an approach that uses a relaxed multiway $k$-cut cost function; we show that the resulting algorithm converges to","authors_text":"Amber Srivastava, Mayank Baranwal, Srinivasa Salapaka","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-19T22:53:52Z","title":"Multiway k-Cut in Static and Dynamic Graphs: A Maximum Entropy Principle Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08720","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:3cde9fdb4c3a0061cb560e7433a9abbff4f630f650590e0b9e136d0814a827b4","target":"record","created_at":"2026-05-17T23:40:05Z","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":"356abc7b42c9814f2e89097e1087ed9df9f6d0cc4a4e09d8dbbd770697905a7e","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-19T22:53:52Z","title_canon_sha256":"c271654bc2b2455f68ca12a43ac6db91e48f61f7ab261a99453af031f49ef14c"},"schema_version":"1.0","source":{"id":"1907.08720","kind":"arxiv","version":1}},"canonical_sha256":"9feca2e652829e0e66e9e2a2ad695fb330f9b378425d0afe76405e34da5ba183","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9feca2e652829e0e66e9e2a2ad695fb330f9b378425d0afe76405e34da5ba183","first_computed_at":"2026-05-17T23:40:05.614816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:05.614816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z55lSnXbBwWfSkuqS+Kg4blkYFMVobBVAQADBtgyGkLvGB0O21MceEx0iO9ZMw6njJWPqkyE5K1wHoeFh1+yBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:05.615309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cde9fdb4c3a0061cb560e7433a9abbff4f630f650590e0b9e136d0814a827b4","sha256:0afa8ac1aa6c0b9f77c7102c3534af486ec6c41ae4c618481b7ef5847accbcbd"],"state_sha256":"dfb616224406873ccc5455329539868890a4162832517338a578bc88b10c8a64"}