{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5VFLHMQJE6OEVG2QSY6XN6F62H","short_pith_number":"pith:5VFLHMQJ","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"},"canonical_sha256":"ed4ab3b209279c4a9b50963d76f8bed1f080f18887f8779e0ff2d9108dba5435","source":{"kind":"arxiv","id":"1808.04540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04540","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04540v1","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04540","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"5VFLHMQJE6OE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5VFLHMQJE6OEVG2Q","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5VFLHMQJ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5VFLHMQJE6OEVG2QSY6XN6F62H","target":"record","payload":{"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"},"canonical_sha256":"ed4ab3b209279c4a9b50963d76f8bed1f080f18887f8779e0ff2d9108dba5435","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"},"source_kind":"arxiv","source_id":"1808.04540","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnozdc8zQnnyiikq30p3xWft7u9+O+X8iFEkzDkiY/QXBZL5BQPDBIb7/E3iLHUxyU9NiJBon2BAoC1BC8+VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:02:28.801307Z"},"content_sha256":"0412b2ce89c09200abf6c8977f03e6a697b2940aedc75eb857e256e0abcd12ef","schema_version":"1.0","event_id":"sha256:0412b2ce89c09200abf6c8977f03e6a697b2940aedc75eb857e256e0abcd12ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5VFLHMQJE6OEVG2QSY6XN6F62H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggdkgUJ6NOb0qd1MhhNWM5oZcN7EYoPKRY9HOQE8ght4UE+tdXYERtnaLn1+laXI+yVW6MPhqyyA3hmlZGyNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:02:28.801958Z"},"content_sha256":"508560e42bcae40c7d4ab41245f119ab06b57a0875cdf6d1b017d5038b38d202","schema_version":"1.0","event_id":"sha256:508560e42bcae40c7d4ab41245f119ab06b57a0875cdf6d1b017d5038b38d202"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/bundle.json","state_url":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T23:02:28Z","links":{"resolver":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H","bundle":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/bundle.json","state":"https://pith.science/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VFLHMQJE6OEVG2QSY6XN6F62H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5VFLHMQJE6OEVG2QSY6XN6F62H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e54101a72b3ec7d74fcd9895f1e358ede25ac537071fa39c138f586cba300ea9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T05:52:40Z","title_canon_sha256":"dea6d250a8edcb0ac353753e4f92c17c4685cd6b707819f55da74b46c4cda1ec"},"schema_version":"1.0","source":{"id":"1808.04540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04540","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04540v1","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04540","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"5VFLHMQJE6OE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5VFLHMQJE6OEVG2Q","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5VFLHMQJ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:508560e42bcae40c7d4ab41245f119ab06b57a0875cdf6d1b017d5038b38d202","target":"graph","created_at":"2026-05-18T00:08:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Boram Park, Ilkyoo Choi, Michitaka Furuya, Ringi Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T05:52:40Z","title":"A Ramsey-type theorem for the matching number regarding connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04540","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0412b2ce89c09200abf6c8977f03e6a697b2940aedc75eb857e256e0abcd12ef","target":"record","created_at":"2026-05-18T00:08:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e54101a72b3ec7d74fcd9895f1e358ede25ac537071fa39c138f586cba300ea9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T05:52:40Z","title_canon_sha256":"dea6d250a8edcb0ac353753e4f92c17c4685cd6b707819f55da74b46c4cda1ec"},"schema_version":"1.0","source":{"id":"1808.04540","kind":"arxiv","version":1}},"canonical_sha256":"ed4ab3b209279c4a9b50963d76f8bed1f080f18887f8779e0ff2d9108dba5435","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed4ab3b209279c4a9b50963d76f8bed1f080f18887f8779e0ff2d9108dba5435","first_computed_at":"2026-05-18T00:08:12.225411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:12.225411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+J018hokd4Mo70TpOsmf1x2sLgB7kSaDc0sYDNzyhxzRruf9KMGtPvLyUZrTE8XYi+ClNaNOshY7zGSPQ9OBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:12.225905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0412b2ce89c09200abf6c8977f03e6a697b2940aedc75eb857e256e0abcd12ef","sha256:508560e42bcae40c7d4ab41245f119ab06b57a0875cdf6d1b017d5038b38d202"],"state_sha256":"e76a7fa9a623eeeb8ca17d51e71745df3e186ba3b3e2460e5c326f37b620a404"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ZxfPHORMFNu+YP9Og9Ehy/sPPoM0/sSdKBibIsBEyYGhwv1plXj3YDCA6eNt4QyDZGMFWGxFrx08/3yQ61oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:02:28.805428Z","bundle_sha256":"ce5287d90f4de9c5df4345a4a65c3a00cc175e94b859073ede0e4192aff079fe"}}