{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5VFLHMQJE6OEVG2QSY6XN6F62H","short_pith_number":"pith:5VFLHMQJ","schema_version":"1.0","canonical_sha256":"ed4ab3b209279c4a9b50963d76f8bed1f080f18887f8779e0ff2d9108dba5435","source":{"kind":"arxiv","id":"1808.04540","version":1},"attestation_state":"computed","paper":{"title":"A Ramsey-type theorem for the matching number regarding connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Ilkyoo Choi, Michitaka Furuya, Ringi Kim","submitted_at":"2018-08-14T05:52:40Z","abstract_excerpt":"A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $\\rho$, every graph $G$ with sufficiently large $\\rho(G)$ contains a `well-structured' induced subgraph $H$ with large $\\rho(H)$. The classical Ramsey's theorem deals with the case when the graph parameter under consideration is the number of vertices; there is also a Ramsey-type theorem regarding connected graphs.\n  Given a graph $G$, the matching number and the induced matching number of $G$ is the maximum size of a matching and an induced matching, respectively, of "},"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":"1808.04540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T05:52:40Z","cross_cats_sorted":[],"title_canon_sha256":"dea6d250a8edcb0ac353753e4f92c17c4685cd6b707819f55da74b46c4cda1ec","abstract_canon_sha256":"e54101a72b3ec7d74fcd9895f1e358ede25ac537071fa39c138f586cba300ea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:12.225905Z","signature_b64":"t+J018hokd4Mo70TpOsmf1x2sLgB7kSaDc0sYDNzyhxzRruf9KMGtPvLyUZrTE8XYi+ClNaNOshY7zGSPQ9OBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed4ab3b209279c4a9b50963d76f8bed1f080f18887f8779e0ff2d9108dba5435","last_reissued_at":"2026-05-18T00:08:12.225411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:12.225411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Ramsey-type theorem for the matching number regarding connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Ilkyoo Choi, Michitaka Furuya, Ringi Kim","submitted_at":"2018-08-14T05:52:40Z","abstract_excerpt":"A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $\\rho$, every graph $G$ with sufficiently large $\\rho(G)$ contains a `well-structured' induced subgraph $H$ with large $\\rho(H)$. The classical Ramsey's theorem deals with the case when the graph parameter under consideration is the number of vertices; there is also a Ramsey-type theorem regarding connected graphs.\n  Given a graph $G$, the matching number and the induced matching number of $G$ is the maximum size of a matching and an induced matching, respectively, of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04540","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":"1808.04540","created_at":"2026-05-18T00:08:12.225483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04540v1","created_at":"2026-05-18T00:08:12.225483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04540","created_at":"2026-05-18T00:08:12.225483+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VFLHMQJE6OE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VFLHMQJE6OEVG2Q","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VFLHMQJ","created_at":"2026-05-18T12:32:08.215937+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/5VFLHMQJE6OEVG2QSY6XN6F62H","json":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H.json","graph_json":"https://pith.science/api/pith-number/5VFLHMQJE6OEVG2QSY6XN6F62H/graph.json","events_json":"https://pith.science/api/pith-number/5VFLHMQJE6OEVG2QSY6XN6F62H/events.json","paper":"https://pith.science/paper/5VFLHMQJ"},"agent_actions":{"view_html":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H","download_json":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H.json","view_paper":"https://pith.science/paper/5VFLHMQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04540&json=true","fetch_graph":"https://pith.science/api/pith-number/5VFLHMQJE6OEVG2QSY6XN6F62H/graph.json","fetch_events":"https://pith.science/api/pith-number/5VFLHMQJE6OEVG2QSY6XN6F62H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/action/storage_attestation","attest_author":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/action/author_attestation","sign_citation":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/action/citation_signature","submit_replication":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/action/replication_record"}},"created_at":"2026-05-18T00:08:12.225483+00:00","updated_at":"2026-05-18T00:08:12.225483+00:00"}