{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:6DWGMNVDYZE3QFIIN263F66FS3","short_pith_number":"pith:6DWGMNVD","canonical_record":{"source":{"id":"2205.03965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-08T22:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"db4841d0e6c4d9d4ba21cce28e77cfa7d6254db7675b40e00a1548c5ad0cb116","abstract_canon_sha256":"8f98d3ffc4e4e0006e34de4e0ae90b23ceaeedf005299ea6eb216da904a27ece"},"schema_version":"1.0"},"canonical_sha256":"f0ec6636a3c649b815086ebdb2fbc596e1331171095266109e3fdcb4ebf3b288","source":{"kind":"arxiv","id":"2205.03965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.03965","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"2205.03965v1","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03965","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"6DWGMNVDYZE3","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"pith_short_16","alias_value":"6DWGMNVDYZE3QFII","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"pith_short_8","alias_value":"6DWGMNVD","created_at":"2026-07-05T04:21:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:6DWGMNVDYZE3QFIIN263F66FS3","target":"record","payload":{"canonical_record":{"source":{"id":"2205.03965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-08T22:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"db4841d0e6c4d9d4ba21cce28e77cfa7d6254db7675b40e00a1548c5ad0cb116","abstract_canon_sha256":"8f98d3ffc4e4e0006e34de4e0ae90b23ceaeedf005299ea6eb216da904a27ece"},"schema_version":"1.0"},"canonical_sha256":"f0ec6636a3c649b815086ebdb2fbc596e1331171095266109e3fdcb4ebf3b288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:21:19.994830Z","signature_b64":"HodyQOdv8LtFdXvCl60sYQr8webglEOyYlhC02oYHlHDrmsVIfJQbRWvfFSRhZat1TjnGVAh6EWhNEh3m1f6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0ec6636a3c649b815086ebdb2fbc596e1331171095266109e3fdcb4ebf3b288","last_reissued_at":"2026-07-05T04:21:19.994388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:21:19.994388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.03965","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-07-05T04:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLgu211ddaq/WOiEneSN9fg4qzMfUx2avbU54mHYT+/O3S7qYDQll+LlnKXs/wNipozbeoQdherwxYmEe7YXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:27:49.303896Z"},"content_sha256":"f9f06e4828ad14be5f98ca577b25341b2f43f4018a174d67f6b040aa33c34c64","schema_version":"1.0","event_id":"sha256:f9f06e4828ad14be5f98ca577b25341b2f43f4018a174d67f6b040aa33c34c64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:6DWGMNVDYZE3QFIIN263F66FS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected size Ramsey numbers of matchings versus a small path or cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruyu Song, Sha Wang, Yanbo Zhang, Yixin Zhang","submitted_at":"2022-05-08T22:48:00Z","abstract_excerpt":"Given two graphs $G_1, G_2$, the connected size Ramsey number ${\\hat{r}}_c(G_1,G_2)$ is defined to be the minimum number of edges of a connected graph $G$, such that for any red-blue edge colouring of $G$, there is either a red copy of $G_1$ or a blue copy of $G_2$. Concentrating on ${\\hat{r}}_c(nK_2,G_2)$ where $nK_2$ is a matching, we generalise and improve two previous results as follows. Vito, Nabila, Safitri, and Silaban obtained the exact values of ${\\hat{r}}_c(nK_2,P_3)$ for $n=2,3,4$. We determine its exact values for all positive integers $n$. Rahadjeng, Baskoro, and Assiyatun proved "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03965","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.03965/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q56YUsUcoh6WdrBq84qUcb1reMxa8MrxNmaTXcSCBDR3I//IfXtyARbzGyxghrBbPE2r+72x/leg9G80utBZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:27:49.304277Z"},"content_sha256":"bdadfe0453137228bbd1fbd362f43832ea5f01109fab7c9064ca527b1e3d3d4e","schema_version":"1.0","event_id":"sha256:bdadfe0453137228bbd1fbd362f43832ea5f01109fab7c9064ca527b1e3d3d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DWGMNVDYZE3QFIIN263F66FS3/bundle.json","state_url":"https://pith.science/pith/6DWGMNVDYZE3QFIIN263F66FS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DWGMNVDYZE3QFIIN263F66FS3/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-08-03T15:27:49Z","links":{"resolver":"https://pith.science/pith/6DWGMNVDYZE3QFIIN263F66FS3","bundle":"https://pith.science/pith/6DWGMNVDYZE3QFIIN263F66FS3/bundle.json","state":"https://pith.science/pith/6DWGMNVDYZE3QFIIN263F66FS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DWGMNVDYZE3QFIIN263F66FS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6DWGMNVDYZE3QFIIN263F66FS3","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":"8f98d3ffc4e4e0006e34de4e0ae90b23ceaeedf005299ea6eb216da904a27ece","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-08T22:48:00Z","title_canon_sha256":"db4841d0e6c4d9d4ba21cce28e77cfa7d6254db7675b40e00a1548c5ad0cb116"},"schema_version":"1.0","source":{"id":"2205.03965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.03965","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"2205.03965v1","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03965","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"6DWGMNVDYZE3","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"pith_short_16","alias_value":"6DWGMNVDYZE3QFII","created_at":"2026-07-05T04:21:19Z"},{"alias_kind":"pith_short_8","alias_value":"6DWGMNVD","created_at":"2026-07-05T04:21:19Z"}],"graph_snapshots":[{"event_id":"sha256:bdadfe0453137228bbd1fbd362f43832ea5f01109fab7c9064ca527b1e3d3d4e","target":"graph","created_at":"2026-07-05T04:21:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.03965/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given two graphs $G_1, G_2$, the connected size Ramsey number ${\\hat{r}}_c(G_1,G_2)$ is defined to be the minimum number of edges of a connected graph $G$, such that for any red-blue edge colouring of $G$, there is either a red copy of $G_1$ or a blue copy of $G_2$. Concentrating on ${\\hat{r}}_c(nK_2,G_2)$ where $nK_2$ is a matching, we generalise and improve two previous results as follows. Vito, Nabila, Safitri, and Silaban obtained the exact values of ${\\hat{r}}_c(nK_2,P_3)$ for $n=2,3,4$. We determine its exact values for all positive integers $n$. Rahadjeng, Baskoro, and Assiyatun proved ","authors_text":"Ruyu Song, Sha Wang, Yanbo Zhang, Yixin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-08T22:48:00Z","title":"Connected size Ramsey numbers of matchings versus a small path or cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03965","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:f9f06e4828ad14be5f98ca577b25341b2f43f4018a174d67f6b040aa33c34c64","target":"record","created_at":"2026-07-05T04:21:19Z","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":"8f98d3ffc4e4e0006e34de4e0ae90b23ceaeedf005299ea6eb216da904a27ece","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-08T22:48:00Z","title_canon_sha256":"db4841d0e6c4d9d4ba21cce28e77cfa7d6254db7675b40e00a1548c5ad0cb116"},"schema_version":"1.0","source":{"id":"2205.03965","kind":"arxiv","version":1}},"canonical_sha256":"f0ec6636a3c649b815086ebdb2fbc596e1331171095266109e3fdcb4ebf3b288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0ec6636a3c649b815086ebdb2fbc596e1331171095266109e3fdcb4ebf3b288","first_computed_at":"2026-07-05T04:21:19.994388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:21:19.994388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HodyQOdv8LtFdXvCl60sYQr8webglEOyYlhC02oYHlHDrmsVIfJQbRWvfFSRhZat1TjnGVAh6EWhNEh3m1f6AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:21:19.994830Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.03965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9f06e4828ad14be5f98ca577b25341b2f43f4018a174d67f6b040aa33c34c64","sha256:bdadfe0453137228bbd1fbd362f43832ea5f01109fab7c9064ca527b1e3d3d4e"],"state_sha256":"ff290e66603a8236fc5c6d3ad18579e3d60956082c222f464baa6a1daf869e3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Klt5kgPMObIJc9iv8asogwLlcCvvqEVRRo/qsm2Go+RK6saGJvyfOC4BpUR4AutHKiqMhX9VM2JICqNI0LOrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:27:49.307472Z","bundle_sha256":"d349d8650610274380e06c362d2315246bd2e2cc61069cc7e86de04742d730b1"}}