{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J6MUYVEIUJLWNS5T3LYF2QI5RZ","short_pith_number":"pith:J6MUYVEI","canonical_record":{"source":{"id":"1207.3771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T19:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"ccced9b17c67d6616ade2e0f54041472e439950c7c887ae4ad807f86373d2822","abstract_canon_sha256":"10f1e7cc290c8199fc007fb9268a49cf0032d808b24b3d874273a23aa56f2c86"},"schema_version":"1.0"},"canonical_sha256":"4f994c5488a25766cbb3daf05d411d8e67b591911f39a850354badeca06f4f80","source":{"kind":"arxiv","id":"1207.3771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3771","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3771v1","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3771","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"J6MUYVEIUJLW","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"J6MUYVEIUJLWNS5T","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"J6MUYVEI","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J6MUYVEIUJLWNS5T3LYF2QI5RZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T19:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"ccced9b17c67d6616ade2e0f54041472e439950c7c887ae4ad807f86373d2822","abstract_canon_sha256":"10f1e7cc290c8199fc007fb9268a49cf0032d808b24b3d874273a23aa56f2c86"},"schema_version":"1.0"},"canonical_sha256":"4f994c5488a25766cbb3daf05d411d8e67b591911f39a850354badeca06f4f80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:59.533050Z","signature_b64":"+qZJW6FqUTX6tsN0bkwr8l++1j8NIR7S0goXBCuHtuS2Q8K24axqf34D97SmQV5SIBRAQupAuMHwc7lXEPy/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f994c5488a25766cbb3daf05d411d8e67b591911f39a850354badeca06f4f80","last_reissued_at":"2026-05-18T03:50:59.532301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:59.532301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3771","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-18T03:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4T91A7yVXdC2gEiY6IbEahZ1o2H/JgaUcyxVUYdNyMR7jWl9WmzpuBYw9wDBGh4xv2f1suHMInrqEC/xbrvYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:05:47.247119Z"},"content_sha256":"990ea59d2e896731063cffbc4868740a3b7b9cf3d1b3ec84ceae3ead991e7567","schema_version":"1.0","event_id":"sha256:990ea59d2e896731063cffbc4868740a3b7b9cf3d1b3ec84ceae3ead991e7567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J6MUYVEIUJLWNS5T3LYF2QI5RZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On three-color Ramsey number of paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ghaffar Raeisi, Gholamreza Omidi, Leila Maherani, Maryam Shahsiah","submitted_at":"2012-07-16T19:24:48Z","abstract_excerpt":"Let $G_1, G_2, ..., G_t$ be graphs. The multicolor Ramsey number $R(G_1, G_2, ..., G_t)$ is the smallest positive integer $n$ such that if the edges of complete graph $K_n$ are partitioned into $t$ disjoint color classes giving $t$ graphs $H_1,H_2,...,H_t$, then at least one $H_i$ has a subgraph isomorphic to $G_i$. In this paper, we prove that if $(n,m)\\neq (3,3), (3,4)$ and $m\\geq n$, then $R(P_3,P_n,P_m)=R(P_n,P_m)=m+\\lfloor \\frac{n}{2}\\rfloor-1$. Consequently $R(P_3,mK_2,nK_2)=2m+n-1$ for $m\\geq n\\geq 3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3771","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-18T03:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKb/qb2W5xFIoO7DTDlbAo64g8zMXCUiviitLZUn8tMrbDq75CZXQKe8c5jLO+kkL2rZ9Yz0HgZUa/0ofWzWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:05:47.247470Z"},"content_sha256":"cf13ad1341be8dfe35716b9919c4e3cc52238b604a467ab836505e8cb65dbb24","schema_version":"1.0","event_id":"sha256:cf13ad1341be8dfe35716b9919c4e3cc52238b604a467ab836505e8cb65dbb24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ/bundle.json","state_url":"https://pith.science/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ/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-01T16:05:47Z","links":{"resolver":"https://pith.science/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ","bundle":"https://pith.science/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ/bundle.json","state":"https://pith.science/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6MUYVEIUJLWNS5T3LYF2QI5RZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J6MUYVEIUJLWNS5T3LYF2QI5RZ","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":"10f1e7cc290c8199fc007fb9268a49cf0032d808b24b3d874273a23aa56f2c86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T19:24:48Z","title_canon_sha256":"ccced9b17c67d6616ade2e0f54041472e439950c7c887ae4ad807f86373d2822"},"schema_version":"1.0","source":{"id":"1207.3771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3771","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3771v1","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3771","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"J6MUYVEIUJLW","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"J6MUYVEIUJLWNS5T","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"J6MUYVEI","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:cf13ad1341be8dfe35716b9919c4e3cc52238b604a467ab836505e8cb65dbb24","target":"graph","created_at":"2026-05-18T03:50:59Z","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":"Let $G_1, G_2, ..., G_t$ be graphs. The multicolor Ramsey number $R(G_1, G_2, ..., G_t)$ is the smallest positive integer $n$ such that if the edges of complete graph $K_n$ are partitioned into $t$ disjoint color classes giving $t$ graphs $H_1,H_2,...,H_t$, then at least one $H_i$ has a subgraph isomorphic to $G_i$. In this paper, we prove that if $(n,m)\\neq (3,3), (3,4)$ and $m\\geq n$, then $R(P_3,P_n,P_m)=R(P_n,P_m)=m+\\lfloor \\frac{n}{2}\\rfloor-1$. Consequently $R(P_3,mK_2,nK_2)=2m+n-1$ for $m\\geq n\\geq 3$.","authors_text":"Ghaffar Raeisi, Gholamreza Omidi, Leila Maherani, Maryam Shahsiah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T19:24:48Z","title":"On three-color Ramsey number of paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3771","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:990ea59d2e896731063cffbc4868740a3b7b9cf3d1b3ec84ceae3ead991e7567","target":"record","created_at":"2026-05-18T03:50:59Z","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":"10f1e7cc290c8199fc007fb9268a49cf0032d808b24b3d874273a23aa56f2c86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T19:24:48Z","title_canon_sha256":"ccced9b17c67d6616ade2e0f54041472e439950c7c887ae4ad807f86373d2822"},"schema_version":"1.0","source":{"id":"1207.3771","kind":"arxiv","version":1}},"canonical_sha256":"4f994c5488a25766cbb3daf05d411d8e67b591911f39a850354badeca06f4f80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f994c5488a25766cbb3daf05d411d8e67b591911f39a850354badeca06f4f80","first_computed_at":"2026-05-18T03:50:59.532301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:59.532301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+qZJW6FqUTX6tsN0bkwr8l++1j8NIR7S0goXBCuHtuS2Q8K24axqf34D97SmQV5SIBRAQupAuMHwc7lXEPy/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:59.533050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:990ea59d2e896731063cffbc4868740a3b7b9cf3d1b3ec84ceae3ead991e7567","sha256:cf13ad1341be8dfe35716b9919c4e3cc52238b604a467ab836505e8cb65dbb24"],"state_sha256":"e0a6d5b0f715a2dce8d5fab7d07c7960e23ae0164d1ce4f4a239f75b3c1d9116"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60LnmyAdEkmUCkMF8m301/69uTZyJY5BfsO1sIiW4ggOeGlglVPZVPjx69ja7CKFY1A4UGu+AivM9ofz2H1UBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:05:47.249499Z","bundle_sha256":"b71b9953d5fb6e3b3a466a743bfb695b25ee0d717e90e1401a678884b2552611"}}