{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DB2TUOMU2NRBCCIPY62OU2QK7T","short_pith_number":"pith:DB2TUOMU","schema_version":"1.0","canonical_sha256":"18753a3994d36211090fc7b4ea6a0afcf57c8324d1aac82687b16d38792ab7af","source":{"kind":"arxiv","id":"1812.01426","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial persistency criteria for multicut and max-cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bjoern Andres, Jan-Hendrik Lange, Paul Swoboda","submitted_at":"2018-12-04T14:15:17Z","abstract_excerpt":"In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to verify them. The criteria that we derive are based on mappings that improve feasible multicuts, respectively cuts. Our elementary criteria can be checked enumeratively. The more advanced ones rely on fast algorithms for upper and lower bounds for the respective cut problems and max-flow techniques for auxiliary min-cut problems. Our methods can be used as a prepr"},"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":"1812.01426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-04T14:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"aac1adfce5e0b2957684318ef4201066568c7c52993c9fe0a24c928f5afdf0c8","abstract_canon_sha256":"79e57365c3f3f54bcb81f7359c8da993672d65c543bd69f6a2aa23846dd4f199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:12.513131Z","signature_b64":"4jGpe0/9+WbGaNzddX+Gi6+IcOKpKmKlBCJR5GbxX3uJv4GeAnm8VJnSQlbRNDHC0NVgsvDd235wlKYPLSeVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18753a3994d36211090fc7b4ea6a0afcf57c8324d1aac82687b16d38792ab7af","last_reissued_at":"2026-05-17T23:59:12.512539Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.512539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial persistency criteria for multicut and max-cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bjoern Andres, Jan-Hendrik Lange, Paul Swoboda","submitted_at":"2018-12-04T14:15:17Z","abstract_excerpt":"In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to verify them. The criteria that we derive are based on mappings that improve feasible multicuts, respectively cuts. Our elementary criteria can be checked enumeratively. The more advanced ones rely on fast algorithms for upper and lower bounds for the respective cut problems and max-flow techniques for auxiliary min-cut problems. Our methods can be used as a prepr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01426","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.01426","created_at":"2026-05-17T23:59:12.512634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01426v1","created_at":"2026-05-17T23:59:12.512634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01426","created_at":"2026-05-17T23:59:12.512634+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB2TUOMU2NRB","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB2TUOMU2NRBCCIP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB2TUOMU","created_at":"2026-05-18T12:32:19.392346+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/DB2TUOMU2NRBCCIPY62OU2QK7T","json":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T.json","graph_json":"https://pith.science/api/pith-number/DB2TUOMU2NRBCCIPY62OU2QK7T/graph.json","events_json":"https://pith.science/api/pith-number/DB2TUOMU2NRBCCIPY62OU2QK7T/events.json","paper":"https://pith.science/paper/DB2TUOMU"},"agent_actions":{"view_html":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T","download_json":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T.json","view_paper":"https://pith.science/paper/DB2TUOMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01426&json=true","fetch_graph":"https://pith.science/api/pith-number/DB2TUOMU2NRBCCIPY62OU2QK7T/graph.json","fetch_events":"https://pith.science/api/pith-number/DB2TUOMU2NRBCCIPY62OU2QK7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T/action/storage_attestation","attest_author":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T/action/author_attestation","sign_citation":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T/action/citation_signature","submit_replication":"https://pith.science/pith/DB2TUOMU2NRBCCIPY62OU2QK7T/action/replication_record"}},"created_at":"2026-05-17T23:59:12.512634+00:00","updated_at":"2026-05-17T23:59:12.512634+00:00"}