{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OBHRIZMYYUSDG37WZZ5NTPJDUY","short_pith_number":"pith:OBHRIZMY","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"},"canonical_sha256":"704f146598c524336ff6ce7ad9bd23a61b98d08acaad41776ccf9631d888b451","source":{"kind":"arxiv","id":"2605.25695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25695","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25695v1","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25695","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"OBHRIZMYYUSD","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"OBHRIZMYYUSDG37W","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"OBHRIZMY","created_at":"2026-05-26T02:04:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OBHRIZMYYUSDG37WZZ5NTPJDUY","target":"record","payload":{"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"},"canonical_sha256":"704f146598c524336ff6ce7ad9bd23a61b98d08acaad41776ccf9631d888b451","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"},"source_kind":"arxiv","source_id":"2605.25695","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-26T02:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DR0bnlP7I2TcX+tK/sVudk4ROGO2DbQ2BCClEiEWJXnBlA33PxQjuh6ZtKxKN0vRJtc8r9BoMJQ6VYh2ztIvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:20:51.542603Z"},"content_sha256":"b9c32c4433c36160a8a426b9f44b2501c433aad3ae98d4264b9199f8a44f47d1","schema_version":"1.0","event_id":"sha256:b9c32c4433c36160a8a426b9f44b2501c433aad3ae98d4264b9199f8a44f47d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OBHRIZMYYUSDG37WZZ5NTPJDUY","target":"graph","payload":{"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"},"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-26T02:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AKwrbHBxbzemVDQj2cdE3gtEZCsc3PAXwDselHejeo/Se6Rz925h3hgV203+Jyst2cWN3I0R6t/zSvumpvsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:20:51.543189Z"},"content_sha256":"470c61187d4b1dbb289639424ec6a491a9ff04f178b73ed7e90b6e9d5936073b","schema_version":"1.0","event_id":"sha256:470c61187d4b1dbb289639424ec6a491a9ff04f178b73ed7e90b6e9d5936073b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/bundle.json","state_url":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/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-05-31T04:20:51Z","links":{"resolver":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY","bundle":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/bundle.json","state":"https://pith.science/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBHRIZMYYUSDG37WZZ5NTPJDUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OBHRIZMYYUSDG37WZZ5NTPJDUY","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":"5a683be77ee02d92a62f20845801d2d51d4e67d3f6ef46e1e55c3bfad278d3b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T10:53:27Z","title_canon_sha256":"ac9c373e873c5cdd035c39e6d0eadac3cd508b70902bd8b5cbde19ce97499322"},"schema_version":"1.0","source":{"id":"2605.25695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25695","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25695v1","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25695","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"OBHRIZMYYUSD","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"OBHRIZMYYUSDG37W","created_at":"2026-05-26T02:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"OBHRIZMY","created_at":"2026-05-26T02:04:50Z"}],"graph_snapshots":[{"event_id":"sha256:470c61187d4b1dbb289639424ec6a491a9ff04f178b73ed7e90b6e9d5936073b","target":"graph","created_at":"2026-05-26T02:04:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.25695/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Fengming Dong, Fuliang Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T10:53:27Z","title":"Tight cuts in matching covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25695","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:b9c32c4433c36160a8a426b9f44b2501c433aad3ae98d4264b9199f8a44f47d1","target":"record","created_at":"2026-05-26T02:04:50Z","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":"5a683be77ee02d92a62f20845801d2d51d4e67d3f6ef46e1e55c3bfad278d3b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T10:53:27Z","title_canon_sha256":"ac9c373e873c5cdd035c39e6d0eadac3cd508b70902bd8b5cbde19ce97499322"},"schema_version":"1.0","source":{"id":"2605.25695","kind":"arxiv","version":1}},"canonical_sha256":"704f146598c524336ff6ce7ad9bd23a61b98d08acaad41776ccf9631d888b451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"704f146598c524336ff6ce7ad9bd23a61b98d08acaad41776ccf9631d888b451","first_computed_at":"2026-05-26T02:04:50.844453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:50.844453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zzphB8pZn4cP5mAD/Fmabs0nZOvpr+dswgVORTB5gLz0W0fBt5Lms5PwDtTe8wXRJeaKtMEf5V0zm/pkOc2fBw==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:50.844967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9c32c4433c36160a8a426b9f44b2501c433aad3ae98d4264b9199f8a44f47d1","sha256:470c61187d4b1dbb289639424ec6a491a9ff04f178b73ed7e90b6e9d5936073b"],"state_sha256":"6f0b7e0ea3076010d5805e7c3dec23dccd9c88442ae9964d97dec0477b7829c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zr2GJzTsIs0woA2R8y9BNyBw+eL/kcYmSQjWrHyWm1JV/oRo8bpaj6G/Gc5GNtY7ueH+rY1wADnk+nGQocQSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:20:51.546226Z","bundle_sha256":"f12830ccc5faa0ce52a4fb3ab5894b61e5ac75abeca86add1bd7401531bbff86"}}