{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VC6F5HWCELBVVYZGL5OH4GROUB","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":"7243de904e3645094f627a242dab20d478ef1c45a771c64ecd48be1b8be314ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-29T19:14:39Z","title_canon_sha256":"2d45b3ecbded52895cbcca3ddcef62f760bb1d25871e58f4ba57e1060bec495b"},"schema_version":"1.0","source":{"id":"1501.07549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07549","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07549v1","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07549","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"VC6F5HWCELBV","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VC6F5HWCELBVVYZG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VC6F5HWC","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:1355f015284c3dc64d428e2b033a555df5c3019e0ad0bdae3e4f3c6a5b856bb0","target":"graph","created_at":"2026-05-18T02:28:21Z","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":"A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, and that these two classes are disjoint. This paper provides a description of k-connected equimatchable factor-critical graphs with respect to their k-cuts for $k\\ge 3$. As our main result we prove that if G is a k-connected equimatchable factor-critical graph with at least 2k+3 vertices and a k-cut S, then G-S has exactly two components and both these components are close to being complete or complete bipartite. If b","authors_text":"Eduard Eiben, Michal Kotrbcik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-29T19:14:39Z","title":"Equimatchable factor-critical graphs and independence number 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07549","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:c22a384f02840911f7538b4c836c40baefe6c4e71645dcb8b944682e001c9b77","target":"record","created_at":"2026-05-18T02:28:21Z","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":"7243de904e3645094f627a242dab20d478ef1c45a771c64ecd48be1b8be314ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-29T19:14:39Z","title_canon_sha256":"2d45b3ecbded52895cbcca3ddcef62f760bb1d25871e58f4ba57e1060bec495b"},"schema_version":"1.0","source":{"id":"1501.07549","kind":"arxiv","version":1}},"canonical_sha256":"a8bc5e9ec222c35ae3265f5c7e1a2ea076c30bfd7cbd3ee571992b850ab1c715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8bc5e9ec222c35ae3265f5c7e1a2ea076c30bfd7cbd3ee571992b850ab1c715","first_computed_at":"2026-05-18T02:28:21.674428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:21.674428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k65SNxiPPXOZi6dOyCXTKHQlW8fqZcyIekxPg8Gmb2i5aY8eYTCKt1OKVWaqh6BT2mATtRREGV5X08xJDMOgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:21.675085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c22a384f02840911f7538b4c836c40baefe6c4e71645dcb8b944682e001c9b77","sha256:1355f015284c3dc64d428e2b033a555df5c3019e0ad0bdae3e4f3c6a5b856bb0"],"state_sha256":"1b02f29b112a60522a58dd90de2ec26d7882676b0e4ae7a821ff0a5a3aadaecf"}