{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UT57525TN5O3J662S22PZMLRJY","short_pith_number":"pith:UT57525T","canonical_record":{"source":{"id":"1603.04788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-15T18:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"0360823956b95bf15602ab57a4cbbc945d5b7b77e3a789665fe350694b97c131","abstract_canon_sha256":"db052f86ee93468798a6f99ad98e756bbb86b2252929754eaab9d9aaf5a27e74"},"schema_version":"1.0"},"canonical_sha256":"a4fbfeebb36f5db4fbda96b4fcb1714e01b351678b7b44d3b656dc0857cb098c","source":{"kind":"arxiv","id":"1603.04788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04788","created_at":"2026-05-18T00:25:44Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04788v2","created_at":"2026-05-18T00:25:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04788","created_at":"2026-05-18T00:25:44Z"},{"alias_kind":"pith_short_12","alias_value":"UT57525TN5O3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UT57525TN5O3J662","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UT57525T","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UT57525TN5O3J662S22PZMLRJY","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-15T18:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"0360823956b95bf15602ab57a4cbbc945d5b7b77e3a789665fe350694b97c131","abstract_canon_sha256":"db052f86ee93468798a6f99ad98e756bbb86b2252929754eaab9d9aaf5a27e74"},"schema_version":"1.0"},"canonical_sha256":"a4fbfeebb36f5db4fbda96b4fcb1714e01b351678b7b44d3b656dc0857cb098c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:44.540389Z","signature_b64":"11oC6ntQdc6YmEwmuKzk+V0h+PVStTu8cbPMnyyjy/N1WD7tVhQoseOg7CCjb54PiDDuI9eVmkTi78jqCqBiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4fbfeebb36f5db4fbda96b4fcb1714e01b351678b7b44d3b656dc0857cb098c","last_reissued_at":"2026-05-18T00:25:44.539713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:44.539713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04788","source_version":2,"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-18T00:25:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w3oTOnoqBH2rZJDZPVmyGpv43LgA13sAr9TcZueOBiRz7KIoqU6iZyv08/rt1cHivUQ5TKct3d7zTwRVYDkKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:50:33.078540Z"},"content_sha256":"8375c51da60f166ff662dc25cd10b825505e429724ad98f0072c1cf1e604c2aa","schema_version":"1.0","event_id":"sha256:8375c51da60f166ff662dc25cd10b825505e429724ad98f0072c1cf1e604c2aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UT57525TN5O3J662S22PZMLRJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Henning Meyerhenke, Roland Glantz","submitted_at":"2016-03-15T18:01:13Z","abstract_excerpt":"Let $\\mathcal{P}$ and $\\mathcal{P}'$ be finite partitions of the set $V$. Finding good correspondences between the parts of $\\mathcal{P}$ and those of $\\mathcal{P}'$ is helpful in classification, pattern recognition, and network analysis. Unlike common similarity measures for partitions that yield only a single value, we provide specifics on how $\\mathcal{P}$ and $\\mathcal{P'}$ correspond to each other.\n  To this end, we first define natural collections of best correspondences under three constraints \\cone, \\ctwo, and \\cthree. In case of \\cone, the best correspondences form a minimum cut basis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04788","kind":"arxiv","version":2},"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-18T00:25:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caMxjZiyPxuthNklj1URq5KwniA6RuAUH0/BX8Y5HvO3Owv4jJAIw58aa1MHmn6YqSKGrEN5Ei1bse1/4aLbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:50:33.078879Z"},"content_sha256":"f82530e8abbd0d13b945d3897f121c11def7ec06db75e4452e69487a7d339fe7","schema_version":"1.0","event_id":"sha256:f82530e8abbd0d13b945d3897f121c11def7ec06db75e4452e69487a7d339fe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/bundle.json","state_url":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UT57525TN5O3J662S22PZMLRJY/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-26T00:50:33Z","links":{"resolver":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY","bundle":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/bundle.json","state":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UT57525TN5O3J662S22PZMLRJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UT57525TN5O3J662S22PZMLRJY","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":"db052f86ee93468798a6f99ad98e756bbb86b2252929754eaab9d9aaf5a27e74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-15T18:01:13Z","title_canon_sha256":"0360823956b95bf15602ab57a4cbbc945d5b7b77e3a789665fe350694b97c131"},"schema_version":"1.0","source":{"id":"1603.04788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04788","created_at":"2026-05-18T00:25:44Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04788v2","created_at":"2026-05-18T00:25:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04788","created_at":"2026-05-18T00:25:44Z"},{"alias_kind":"pith_short_12","alias_value":"UT57525TN5O3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UT57525TN5O3J662","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UT57525T","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:f82530e8abbd0d13b945d3897f121c11def7ec06db75e4452e69487a7d339fe7","target":"graph","created_at":"2026-05-18T00:25: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":"Let $\\mathcal{P}$ and $\\mathcal{P}'$ be finite partitions of the set $V$. Finding good correspondences between the parts of $\\mathcal{P}$ and those of $\\mathcal{P}'$ is helpful in classification, pattern recognition, and network analysis. Unlike common similarity measures for partitions that yield only a single value, we provide specifics on how $\\mathcal{P}$ and $\\mathcal{P'}$ correspond to each other.\n  To this end, we first define natural collections of best correspondences under three constraints \\cone, \\ctwo, and \\cthree. In case of \\cone, the best correspondences form a minimum cut basis","authors_text":"Henning Meyerhenke, Roland Glantz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-15T18:01:13Z","title":"Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04788","kind":"arxiv","version":2},"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:8375c51da60f166ff662dc25cd10b825505e429724ad98f0072c1cf1e604c2aa","target":"record","created_at":"2026-05-18T00:25: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":"db052f86ee93468798a6f99ad98e756bbb86b2252929754eaab9d9aaf5a27e74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-15T18:01:13Z","title_canon_sha256":"0360823956b95bf15602ab57a4cbbc945d5b7b77e3a789665fe350694b97c131"},"schema_version":"1.0","source":{"id":"1603.04788","kind":"arxiv","version":2}},"canonical_sha256":"a4fbfeebb36f5db4fbda96b4fcb1714e01b351678b7b44d3b656dc0857cb098c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4fbfeebb36f5db4fbda96b4fcb1714e01b351678b7b44d3b656dc0857cb098c","first_computed_at":"2026-05-18T00:25:44.539713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:44.539713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11oC6ntQdc6YmEwmuKzk+V0h+PVStTu8cbPMnyyjy/N1WD7tVhQoseOg7CCjb54PiDDuI9eVmkTi78jqCqBiDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:44.540389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8375c51da60f166ff662dc25cd10b825505e429724ad98f0072c1cf1e604c2aa","sha256:f82530e8abbd0d13b945d3897f121c11def7ec06db75e4452e69487a7d339fe7"],"state_sha256":"5092a0ac5c54ca636e4ae4099f7bb5da098b7d92081f3de45f5e4e1c50f49712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+LFh1sU/lx0j/spPJrz0ZwlHR7fCiCKjC+UulE4brN+SQtSJtZon/PCHKd8MF1ac5Iv8tEQUBQoG9KM3K0xCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:50:33.080751Z","bundle_sha256":"b22a5acb30ae0a062725dd528ee526e51bd9e22ee76074a0126be975cc762f88"}}