{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6NIOAUFYNIXS24JER6YHRSA7NA","short_pith_number":"pith:6NIOAUFY","schema_version":"1.0","canonical_sha256":"f350e050b86a2f2d71248fb078c81f68032973df5f84789b12b46f5503c0f183","source":{"kind":"arxiv","id":"2304.12565","version":1},"attestation_state":"computed","paper":{"title":"Matching extension and matching exclusion via the size or the spectral radius of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Shujing Miao, Wei Wei","submitted_at":"2023-04-25T04:17:14Z","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."},"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":"2304.12565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-25T04:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"c9bf00514d274862ec9e21c2c06740baef9bcc921cdc6f4d7ecaee8a5e1442e9","abstract_canon_sha256":"c302ca5ee70c2ef0dbcf8e331e4469aa2b384d2534e6c75cf2cfe453f63612dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:18.401404Z","signature_b64":"OKnSaV0NrUmnNyXTId01sY1ruWyxTjWmz7CrA0tlalSgM4KnqUl93XEpQPNDdNqAK6/JqwmCOn+Q9ZYZHbSuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f350e050b86a2f2d71248fb078c81f68032973df5f84789b12b46f5503c0f183","last_reissued_at":"2026-07-05T06:04:18.401010Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:18.401010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching extension and matching exclusion via the size or the spectral radius of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Shujing Miao, Wei Wei","submitted_at":"2023-04-25T04:17:14Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12565","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/2304.12565/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":"2304.12565","created_at":"2026-07-05T06:04:18.401063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.12565v1","created_at":"2026-07-05T06:04:18.401063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12565","created_at":"2026-07-05T06:04:18.401063+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NIOAUFYNIXS","created_at":"2026-07-05T06:04:18.401063+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NIOAUFYNIXS24JE","created_at":"2026-07-05T06:04:18.401063+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NIOAUFY","created_at":"2026-07-05T06:04:18.401063+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/6NIOAUFYNIXS24JER6YHRSA7NA","json":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA.json","graph_json":"https://pith.science/api/pith-number/6NIOAUFYNIXS24JER6YHRSA7NA/graph.json","events_json":"https://pith.science/api/pith-number/6NIOAUFYNIXS24JER6YHRSA7NA/events.json","paper":"https://pith.science/paper/6NIOAUFY"},"agent_actions":{"view_html":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA","download_json":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA.json","view_paper":"https://pith.science/paper/6NIOAUFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.12565&json=true","fetch_graph":"https://pith.science/api/pith-number/6NIOAUFYNIXS24JER6YHRSA7NA/graph.json","fetch_events":"https://pith.science/api/pith-number/6NIOAUFYNIXS24JER6YHRSA7NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA/action/storage_attestation","attest_author":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA/action/author_attestation","sign_citation":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA/action/citation_signature","submit_replication":"https://pith.science/pith/6NIOAUFYNIXS24JER6YHRSA7NA/action/replication_record"}},"created_at":"2026-07-05T06:04:18.401063+00:00","updated_at":"2026-07-05T06:04:18.401063+00:00"}