{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SRFCB5W5LVI2TBMMP6UOAIYBA6","short_pith_number":"pith:SRFCB5W5","schema_version":"1.0","canonical_sha256":"944a20f6dd5d51a9858c7fa8e0230107a9dd4f75a4171fc8b9c8eb1688946a9d","source":{"kind":"arxiv","id":"1208.0085","version":2},"attestation_state":"computed","paper":{"title":"Game matching number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Douglas B. West, Suil O., William B. Kinnersley","submitted_at":"2012-08-01T03:51:42Z","abstract_excerpt":"We study a competitive optimization version of $\\alpha'(G)$, the maximum size of a matching in a graph $G$. Players alternate adding edges of $G$ to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted $\\Max(G)$ and $\\Min(G)$, respectively. We show that always $|\\Max(G)-\\Min(G)|\\le 1$. We obtain a sufficient condition for $\\Max(G)=\\alpha'(G)$ that is preserved under cartesian product. In general, $\\Max(G)\\ge \\frac23\\alpha'(G)$, with equali"},"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":"1208.0085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-01T03:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"86c626c00ed0c56ce8dfdb7b45c7199bb8f304ff8f88ab46f7f58fdf417eceac","abstract_canon_sha256":"4f44a13f7ea5e6ea1f03ffd0985c2d8ae6972ed4e7b6d8fa68f7186e575bf89d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.040950Z","signature_b64":"ZmoaF8/TBe278g3rna5ZISVJa+CbkJo83ck03lcrTEbiP5WtevpeLY1IF6R1vVwiZ1gqFygNkWsaP2zgAsRbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"944a20f6dd5d51a9858c7fa8e0230107a9dd4f75a4171fc8b9c8eb1688946a9d","last_reissued_at":"2026-05-18T01:35:53.040103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.040103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game matching number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Douglas B. West, Suil O., William B. Kinnersley","submitted_at":"2012-08-01T03:51:42Z","abstract_excerpt":"We study a competitive optimization version of $\\alpha'(G)$, the maximum size of a matching in a graph $G$. Players alternate adding edges of $G$ to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted $\\Max(G)$ and $\\Min(G)$, respectively. We show that always $|\\Max(G)-\\Min(G)|\\le 1$. We obtain a sufficient condition for $\\Max(G)=\\alpha'(G)$ that is preserved under cartesian product. In general, $\\Max(G)\\ge \\frac23\\alpha'(G)$, with equali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0085","kind":"arxiv","version":2},"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":"1208.0085","created_at":"2026-05-18T01:35:53.040263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0085v2","created_at":"2026-05-18T01:35:53.040263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0085","created_at":"2026-05-18T01:35:53.040263+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRFCB5W5LVI2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRFCB5W5LVI2TBMM","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRFCB5W5","created_at":"2026-05-18T12:27:20.899486+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/SRFCB5W5LVI2TBMMP6UOAIYBA6","json":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6.json","graph_json":"https://pith.science/api/pith-number/SRFCB5W5LVI2TBMMP6UOAIYBA6/graph.json","events_json":"https://pith.science/api/pith-number/SRFCB5W5LVI2TBMMP6UOAIYBA6/events.json","paper":"https://pith.science/paper/SRFCB5W5"},"agent_actions":{"view_html":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6","download_json":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6.json","view_paper":"https://pith.science/paper/SRFCB5W5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0085&json=true","fetch_graph":"https://pith.science/api/pith-number/SRFCB5W5LVI2TBMMP6UOAIYBA6/graph.json","fetch_events":"https://pith.science/api/pith-number/SRFCB5W5LVI2TBMMP6UOAIYBA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6/action/storage_attestation","attest_author":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6/action/author_attestation","sign_citation":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6/action/citation_signature","submit_replication":"https://pith.science/pith/SRFCB5W5LVI2TBMMP6UOAIYBA6/action/replication_record"}},"created_at":"2026-05-18T01:35:53.040263+00:00","updated_at":"2026-05-18T01:35:53.040263+00:00"}