{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OBHRIZMYYUSDG37WZZ5NTPJDUY","short_pith_number":"pith:OBHRIZMY","schema_version":"1.0","canonical_sha256":"704f146598c524336ff6ce7ad9bd23a61b98d08acaad41776ccf9631d888b451","source":{"kind":"arxiv","id":"2605.25695","version":1},"attestation_state":"computed","paper":{"title":"Tight cuts in matching covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong, Fuliang Lu","submitted_at":"2026-05-25T10:53:27Z","abstract_excerpt":"An edge cut C of a graph G is tight if |C \\M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of tight cuts in matching covered graphs. Edmonds, Lovasz and Pulleyblank [Brick decompositions and the matching rank of graphs, Combinatorica 2(3) (1982) 247-274] proved that if a matching covered graph has a non-trivial tight cut, then it also has a non-trivial ELP-cut. In confirmation of a conjecture proposed by Carvalho, Lucchesi and Murty, Chen et. al. [Laminar tight cuts in matching covered graphs, J. Comb. Theory, "},"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":"2605.25695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T10:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"ac9c373e873c5cdd035c39e6d0eadac3cd508b70902bd8b5cbde19ce97499322","abstract_canon_sha256":"5a683be77ee02d92a62f20845801d2d51d4e67d3f6ef46e1e55c3bfad278d3b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:50.844967Z","signature_b64":"zzphB8pZn4cP5mAD/Fmabs0nZOvpr+dswgVORTB5gLz0W0fBt5Lms5PwDtTe8wXRJeaKtMEf5V0zm/pkOc2fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"704f146598c524336ff6ce7ad9bd23a61b98d08acaad41776ccf9631d888b451","last_reissued_at":"2026-05-26T02:04:50.844453Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:50.844453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight cuts in matching covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong, Fuliang Lu","submitted_at":"2026-05-25T10:53:27Z","abstract_excerpt":"An edge cut C of a graph G is tight if |C \\M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of tight cuts in matching covered graphs. Edmonds, Lovasz and Pulleyblank [Brick decompositions and the matching rank of graphs, Combinatorica 2(3) (1982) 247-274] proved that if a matching covered graph has a non-trivial tight cut, then it also has a non-trivial ELP-cut. In confirmation of a conjecture proposed by Carvalho, Lucchesi and Murty, Chen et. al. [Laminar tight cuts in matching covered graphs, J. Comb. Theory, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25695","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.25695/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.25695","created_at":"2026-05-26T02:04:50.844545+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25695v1","created_at":"2026-05-26T02:04:50.844545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25695","created_at":"2026-05-26T02:04:50.844545+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBHRIZMYYUSD","created_at":"2026-05-26T02:04:50.844545+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBHRIZMYYUSDG37W","created_at":"2026-05-26T02:04:50.844545+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBHRIZMY","created_at":"2026-05-26T02:04:50.844545+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/OBHRIZMYYUSDG37WZZ5NTPJDUY","json":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY.json","graph_json":"https://pith.science/api/pith-number/OBHRIZMYYUSDG37WZZ5NTPJDUY/graph.json","events_json":"https://pith.science/api/pith-number/OBHRIZMYYUSDG37WZZ5NTPJDUY/events.json","paper":"https://pith.science/paper/OBHRIZMY"},"agent_actions":{"view_html":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY","download_json":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY.json","view_paper":"https://pith.science/paper/OBHRIZMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25695&json=true","fetch_graph":"https://pith.science/api/pith-number/OBHRIZMYYUSDG37WZZ5NTPJDUY/graph.json","fetch_events":"https://pith.science/api/pith-number/OBHRIZMYYUSDG37WZZ5NTPJDUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/action/storage_attestation","attest_author":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/action/author_attestation","sign_citation":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/action/citation_signature","submit_replication":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/action/replication_record"}},"created_at":"2026-05-26T02:04:50.844545+00:00","updated_at":"2026-05-26T02:04:50.844545+00:00"}