{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6NIOAUFYNIXS24JER6YHRSA7NA","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":"c302ca5ee70c2ef0dbcf8e331e4469aa2b384d2534e6c75cf2cfe453f63612dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-25T04:17:14Z","title_canon_sha256":"c9bf00514d274862ec9e21c2c06740baef9bcc921cdc6f4d7ecaee8a5e1442e9"},"schema_version":"1.0","source":{"id":"2304.12565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.12565","created_at":"2026-07-05T06:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2304.12565v1","created_at":"2026-07-05T06:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12565","created_at":"2026-07-05T06:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"6NIOAUFYNIXS","created_at":"2026-07-05T06:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"6NIOAUFYNIXS24JE","created_at":"2026-07-05T06:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"6NIOAUFY","created_at":"2026-07-05T06:04:18Z"}],"graph_snapshots":[{"event_id":"sha256:efea3b695f44e95284742a330a7afb3a28f609918ff9e804f60e86509526bd27","target":"graph","created_at":"2026-07-05T06:04:18Z","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/2304.12565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect matching excluding $e$. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of $G$ to guarantee that $G$ is $k$-extendable. Then we determine a lower bound on the size (resp. the spectral radius) of $G$ to guarantee that $G$ is $1$-excludable. All the corresponding extremal graphs are characterized.","authors_text":"Shuchao Li, Shujing Miao, Wei Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-25T04:17:14Z","title":"Matching extension and matching exclusion via the size or the spectral radius of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12565","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:8ae4d8b6cd26ad762e2d72f101e383d8f7e7119c2fb8424566acddf0a2f8ccda","target":"record","created_at":"2026-07-05T06:04:18Z","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":"c302ca5ee70c2ef0dbcf8e331e4469aa2b384d2534e6c75cf2cfe453f63612dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-25T04:17:14Z","title_canon_sha256":"c9bf00514d274862ec9e21c2c06740baef9bcc921cdc6f4d7ecaee8a5e1442e9"},"schema_version":"1.0","source":{"id":"2304.12565","kind":"arxiv","version":1}},"canonical_sha256":"f350e050b86a2f2d71248fb078c81f68032973df5f84789b12b46f5503c0f183","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f350e050b86a2f2d71248fb078c81f68032973df5f84789b12b46f5503c0f183","first_computed_at":"2026-07-05T06:04:18.401010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:04:18.401010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OKnSaV0NrUmnNyXTId01sY1ruWyxTjWmz7CrA0tlalSgM4KnqUl93XEpQPNDdNqAK6/JqwmCOn+Q9ZYZHbSuBg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:04:18.401404Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.12565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ae4d8b6cd26ad762e2d72f101e383d8f7e7119c2fb8424566acddf0a2f8ccda","sha256:efea3b695f44e95284742a330a7afb3a28f609918ff9e804f60e86509526bd27"],"state_sha256":"c8a45ffe14e86a761ecd95147b59aea6d9b32b888f9816a10bdda146c858e5bc"}