{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IS4KJY3L73UF5DIPZBBKXABYUM","short_pith_number":"pith:IS4KJY3L","canonical_record":{"source":{"id":"1906.04860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-06-11T23:27:09Z","cross_cats_sorted":[],"title_canon_sha256":"f345ad36c12027cdf1159e0f0b11ccb5b66ce7259d9577b66bc44430928e3daf","abstract_canon_sha256":"659483fc4aeaefc620e03d04187a5e31d0f621bf60fc75d2f0a840248eb6bff1"},"schema_version":"1.0"},"canonical_sha256":"44b8a4e36bfee85e8d0fc842ab8038a335204988c8c40318b2d6412d8650a219","source":{"kind":"arxiv","id":"1906.04860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04860","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04860v1","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04860","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"IS4KJY3L73UF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IS4KJY3L73UF5DIP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IS4KJY3L","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IS4KJY3L73UF5DIPZBBKXABYUM","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-06-11T23:27:09Z","cross_cats_sorted":[],"title_canon_sha256":"f345ad36c12027cdf1159e0f0b11ccb5b66ce7259d9577b66bc44430928e3daf","abstract_canon_sha256":"659483fc4aeaefc620e03d04187a5e31d0f621bf60fc75d2f0a840248eb6bff1"},"schema_version":"1.0"},"canonical_sha256":"44b8a4e36bfee85e8d0fc842ab8038a335204988c8c40318b2d6412d8650a219","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:30.302766Z","signature_b64":"E6tzOMQgfPTIkd6Xqsmlx053aEZ5Fk7MDrzz9lXRqn06Ri1BuO/l9ZLfk9FsIZn7u4rqfddMSpr9UyZPYAxHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b8a4e36bfee85e8d0fc842ab8038a335204988c8c40318b2d6412d8650a219","last_reissued_at":"2026-05-17T23:43:30.302240Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:30.302240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04860","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-05-17T23:43:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"flhnm6ozJB18hNEZfQ9dvLdqU/P7rLUWAt5z7U0dXLWohyskR8GKEU9Yuh+eSZbKF8jrlnPCVAuHSjNaeKPRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:22:11.702745Z"},"content_sha256":"7a7e6b249d4e91b21f290ef54ef0718192beadf15b71d95f59d7d0a2732771ee","schema_version":"1.0","event_id":"sha256:7a7e6b249d4e91b21f290ef54ef0718192beadf15b71d95f59d7d0a2732771ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IS4KJY3L73UF5DIPZBBKXABYUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A mixed-integer linear programming approach for soft graph clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"John Yearwood, Vicky Mak-Hau","submitted_at":"2019-06-11T23:27:09Z","abstract_excerpt":"This paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that enforces an equal balance of the cluster memberships. Compared to ([Palla et al., 2005], [Derenyi et al., 2005], [Adamcsek et al., 2006]), the clusters found in our method are not limited to k-clique neighbourhoods. Compared to ([Hope and Keller, 2013]), our method can produce non-trivial clusters even for a connected unweighted graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04860","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":""},"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-17T23:43:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7NxtkfkgoPfCq+fTD7IGv8OI3wqaJHbl7AgTnxBQjVNmfUheqcBCMrWZTWF0uLVOIkkxfjF543R+6hfQ0WuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:22:11.703192Z"},"content_sha256":"eedd76e23e0109c00b29ce84f4de1a64eccd2be5985b0ecae25e7264389ca719","schema_version":"1.0","event_id":"sha256:eedd76e23e0109c00b29ce84f4de1a64eccd2be5985b0ecae25e7264389ca719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS4KJY3L73UF5DIPZBBKXABYUM/bundle.json","state_url":"https://pith.science/pith/IS4KJY3L73UF5DIPZBBKXABYUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS4KJY3L73UF5DIPZBBKXABYUM/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-11T17:22:11Z","links":{"resolver":"https://pith.science/pith/IS4KJY3L73UF5DIPZBBKXABYUM","bundle":"https://pith.science/pith/IS4KJY3L73UF5DIPZBBKXABYUM/bundle.json","state":"https://pith.science/pith/IS4KJY3L73UF5DIPZBBKXABYUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS4KJY3L73UF5DIPZBBKXABYUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IS4KJY3L73UF5DIPZBBKXABYUM","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":"659483fc4aeaefc620e03d04187a5e31d0f621bf60fc75d2f0a840248eb6bff1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-06-11T23:27:09Z","title_canon_sha256":"f345ad36c12027cdf1159e0f0b11ccb5b66ce7259d9577b66bc44430928e3daf"},"schema_version":"1.0","source":{"id":"1906.04860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04860","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04860v1","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04860","created_at":"2026-05-17T23:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"IS4KJY3L73UF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IS4KJY3L73UF5DIP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IS4KJY3L","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:eedd76e23e0109c00b29ce84f4de1a64eccd2be5985b0ecae25e7264389ca719","target":"graph","created_at":"2026-05-17T23:43:30Z","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 paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that enforces an equal balance of the cluster memberships. Compared to ([Palla et al., 2005], [Derenyi et al., 2005], [Adamcsek et al., 2006]), the clusters found in our method are not limited to k-clique neighbourhoods. Compared to ([Hope and Keller, 2013]), our method can produce non-trivial clusters even for a connected unweighted graph.","authors_text":"John Yearwood, Vicky Mak-Hau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-06-11T23:27:09Z","title":"A mixed-integer linear programming approach for soft graph clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04860","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:7a7e6b249d4e91b21f290ef54ef0718192beadf15b71d95f59d7d0a2732771ee","target":"record","created_at":"2026-05-17T23:43:30Z","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":"659483fc4aeaefc620e03d04187a5e31d0f621bf60fc75d2f0a840248eb6bff1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-06-11T23:27:09Z","title_canon_sha256":"f345ad36c12027cdf1159e0f0b11ccb5b66ce7259d9577b66bc44430928e3daf"},"schema_version":"1.0","source":{"id":"1906.04860","kind":"arxiv","version":1}},"canonical_sha256":"44b8a4e36bfee85e8d0fc842ab8038a335204988c8c40318b2d6412d8650a219","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b8a4e36bfee85e8d0fc842ab8038a335204988c8c40318b2d6412d8650a219","first_computed_at":"2026-05-17T23:43:30.302240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:30.302240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6tzOMQgfPTIkd6Xqsmlx053aEZ5Fk7MDrzz9lXRqn06Ri1BuO/l9ZLfk9FsIZn7u4rqfddMSpr9UyZPYAxHBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:30.302766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a7e6b249d4e91b21f290ef54ef0718192beadf15b71d95f59d7d0a2732771ee","sha256:eedd76e23e0109c00b29ce84f4de1a64eccd2be5985b0ecae25e7264389ca719"],"state_sha256":"da6abf4cba4bc492ab5bcfc3c021868708f25c9f680c3cc2c7af99b55e71bbe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JHJXJFNjcRU132fUGcp1C274dS6t0N2HAhrNeRtpS42LfHH7BHJOmRco+SlxNUrIcHW3ByFe+rg81s+YNHTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:22:11.706817Z","bundle_sha256":"d2549e498fb34d85f92243136836b1b95060e9bbc003aea9cbd81535a3f7878a"}}