{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M4XDQJAWZYF3GSGQAYCJIZR7N3","short_pith_number":"pith:M4XDQJAW","schema_version":"1.0","canonical_sha256":"672e382416ce0bb348d0060494663f6edc6dd30fa568b838e151c0ae5e0ee4f7","source":{"kind":"arxiv","id":"1612.08531","version":1},"attestation_state":"computed","paper":{"title":"On two extensions of equimatchable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Milani\\v{c}, Mordechai Shalom, Tatiana Romina Hartinger, T{\\i}naz Ekim, Zakir Deniz","submitted_at":"2016-12-27T08:26:38Z","abstract_excerpt":"A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two new graph parameters that measure how far a graph is from being equimatchable. The first one, called the matching gap, measures the difference between the sizes of a maximum matching and a minimum maximal matching. The second extension is obtained by introducing the concept of equimatchable sets; a set of vertices in a graph $G$ is said to be equimatchable if all maximal matchings of $G$ saturating the set are of the"},"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":"1612.08531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-27T08:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"1c05796a68c7b4d235ca63f54fef8de0d972cd5e582663904bed7e61b38a4264","abstract_canon_sha256":"4aaef22e4fc54b8cb89c3d81c0284f4aa682759a2e9ad13be8714ac14534b82e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:52.763612Z","signature_b64":"jX8dAy8a9iCvsEicBbWltz0FhrW2nrD3MVkA0jFJqZOIaUHyLgANp6g0gPf5a1rw7XtVVsjlR7vt0D7UJGxUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"672e382416ce0bb348d0060494663f6edc6dd30fa568b838e151c0ae5e0ee4f7","last_reissued_at":"2026-05-18T00:53:52.763089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:52.763089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On two extensions of equimatchable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Milani\\v{c}, Mordechai Shalom, Tatiana Romina Hartinger, T{\\i}naz Ekim, Zakir Deniz","submitted_at":"2016-12-27T08:26:38Z","abstract_excerpt":"A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two new graph parameters that measure how far a graph is from being equimatchable. The first one, called the matching gap, measures the difference between the sizes of a maximum matching and a minimum maximal matching. The second extension is obtained by introducing the concept of equimatchable sets; a set of vertices in a graph $G$ is said to be equimatchable if all maximal matchings of $G$ saturating the set are of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08531","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":""},"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":"1612.08531","created_at":"2026-05-18T00:53:52.763170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08531v1","created_at":"2026-05-18T00:53:52.763170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08531","created_at":"2026-05-18T00:53:52.763170+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4XDQJAWZYF3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4XDQJAWZYF3GSGQ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4XDQJAW","created_at":"2026-05-18T12:30:29.479603+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/M4XDQJAWZYF3GSGQAYCJIZR7N3","json":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3.json","graph_json":"https://pith.science/api/pith-number/M4XDQJAWZYF3GSGQAYCJIZR7N3/graph.json","events_json":"https://pith.science/api/pith-number/M4XDQJAWZYF3GSGQAYCJIZR7N3/events.json","paper":"https://pith.science/paper/M4XDQJAW"},"agent_actions":{"view_html":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3","download_json":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3.json","view_paper":"https://pith.science/paper/M4XDQJAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08531&json=true","fetch_graph":"https://pith.science/api/pith-number/M4XDQJAWZYF3GSGQAYCJIZR7N3/graph.json","fetch_events":"https://pith.science/api/pith-number/M4XDQJAWZYF3GSGQAYCJIZR7N3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3/action/storage_attestation","attest_author":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3/action/author_attestation","sign_citation":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3/action/citation_signature","submit_replication":"https://pith.science/pith/M4XDQJAWZYF3GSGQAYCJIZR7N3/action/replication_record"}},"created_at":"2026-05-18T00:53:52.763170+00:00","updated_at":"2026-05-18T00:53:52.763170+00:00"}