{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UT57525TN5O3J662S22PZMLRJY","short_pith_number":"pith:UT57525T","schema_version":"1.0","canonical_sha256":"a4fbfeebb36f5db4fbda96b4fcb1714e01b351678b7b44d3b656dc0857cb098c","source":{"kind":"arxiv","id":"1603.04788","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.04788","created_at":"2026-05-18T00:25:44.539806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04788v2","created_at":"2026-05-18T00:25:44.539806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04788","created_at":"2026-05-18T00:25:44.539806+00:00"},{"alias_kind":"pith_short_12","alias_value":"UT57525TN5O3","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UT57525TN5O3J662","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UT57525T","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY","json":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY.json","graph_json":"https://pith.science/api/pith-number/UT57525TN5O3J662S22PZMLRJY/graph.json","events_json":"https://pith.science/api/pith-number/UT57525TN5O3J662S22PZMLRJY/events.json","paper":"https://pith.science/paper/UT57525T"},"agent_actions":{"view_html":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY","download_json":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY.json","view_paper":"https://pith.science/paper/UT57525T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04788&json=true","fetch_graph":"https://pith.science/api/pith-number/UT57525TN5O3J662S22PZMLRJY/graph.json","fetch_events":"https://pith.science/api/pith-number/UT57525TN5O3J662S22PZMLRJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/action/storage_attestation","attest_author":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/action/author_attestation","sign_citation":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/action/citation_signature","submit_replication":"https://pith.science/pith/UT57525TN5O3J662S22PZMLRJY/action/replication_record"}},"created_at":"2026-05-18T00:25:44.539806+00:00","updated_at":"2026-05-18T00:25:44.539806+00:00"}