{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:JXD2BIOR726S6XS3CCDUYTXLQK","short_pith_number":"pith:JXD2BIOR","schema_version":"1.0","canonical_sha256":"4dc7a0a1d1febd2f5e5b10874c4eeb82b782eec5af28e0ae2e96db35d9dd2a7b","source":{"kind":"arxiv","id":"0901.0121","version":3},"attestation_state":"computed","paper":{"title":"On upper bounds for parameters related to construction of special maximum matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Artur Khojabaghyan, Vahan V. Mkrtchyan","submitted_at":"2008-12-31T17:23:00Z","abstract_excerpt":"For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that $L(G)\\leq 2l(G),$ and $L(G)\\leq (3/2)l(G)$ provided that $G$ contains a perfect matching. We also characterize the class of graphs for which $L(G)=2l(G)$. Our characterization implies the existence of a polynomial algorithm for testing the property $L(G)=2l(G)$. Finally we show that it is $NP$-complete to test whether a graph $G$ containing a perfect matching satisfies $L(G)=(3/2)l(G)$."},"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":"0901.0121","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-12-31T17:23:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e6bc43fb55802ab0b89d331399015346d2c96e132ce778478cc91227d1de80dc","abstract_canon_sha256":"cb06ccacd2dabc24c74aa6f6f74625eda6fefeea79ded608d7fc0fd4459f70e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:13.678252Z","signature_b64":"br2doByq3QNW/lxS8ZNr3AIwc5XAG0W2555W6JO3OeQYO1gUm5rDNorqMzP4B2FIHkzsnR2YEaGab7aA3ChkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dc7a0a1d1febd2f5e5b10874c4eeb82b782eec5af28e0ae2e96db35d9dd2a7b","last_reissued_at":"2026-05-18T04:08:13.677828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:13.677828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On upper bounds for parameters related to construction of special maximum matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Artur Khojabaghyan, Vahan V. Mkrtchyan","submitted_at":"2008-12-31T17:23:00Z","abstract_excerpt":"For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that $L(G)\\leq 2l(G),$ and $L(G)\\leq (3/2)l(G)$ provided that $G$ contains a perfect matching. We also characterize the class of graphs for which $L(G)=2l(G)$. Our characterization implies the existence of a polynomial algorithm for testing the property $L(G)=2l(G)$. Finally we show that it is $NP$-complete to test whether a graph $G$ containing a perfect matching satisfies $L(G)=(3/2)l(G)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0121","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"0901.0121","created_at":"2026-05-18T04:08:13.677890+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.0121v3","created_at":"2026-05-18T04:08:13.677890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0121","created_at":"2026-05-18T04:08:13.677890+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXD2BIOR726S","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXD2BIOR726S6XS3","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXD2BIOR","created_at":"2026-05-18T12:25:57.157939+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/JXD2BIOR726S6XS3CCDUYTXLQK","json":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK.json","graph_json":"https://pith.science/api/pith-number/JXD2BIOR726S6XS3CCDUYTXLQK/graph.json","events_json":"https://pith.science/api/pith-number/JXD2BIOR726S6XS3CCDUYTXLQK/events.json","paper":"https://pith.science/paper/JXD2BIOR"},"agent_actions":{"view_html":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK","download_json":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK.json","view_paper":"https://pith.science/paper/JXD2BIOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.0121&json=true","fetch_graph":"https://pith.science/api/pith-number/JXD2BIOR726S6XS3CCDUYTXLQK/graph.json","fetch_events":"https://pith.science/api/pith-number/JXD2BIOR726S6XS3CCDUYTXLQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK/action/storage_attestation","attest_author":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK/action/author_attestation","sign_citation":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK/action/citation_signature","submit_replication":"https://pith.science/pith/JXD2BIOR726S6XS3CCDUYTXLQK/action/replication_record"}},"created_at":"2026-05-18T04:08:13.677890+00:00","updated_at":"2026-05-18T04:08:13.677890+00:00"}