{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:MSG3SFJJ4XXD5SNUHNSXRMLO72","short_pith_number":"pith:MSG3SFJJ","schema_version":"1.0","canonical_sha256":"648db91529e5ee3ec9b43b6578b16efea2005b4788cb6d9ef9f29bb595a5fae2","source":{"kind":"arxiv","id":"0706.2107","version":2},"attestation_state":"computed","paper":{"title":"Constrained Ramsey Numbers","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Po-Shen Loh","submitted_at":"2007-06-14T12:25:48Z","abstract_excerpt":"For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge coloring of the complete graph on n vertices, with any number of colors, has a monochromatic subgraph isomorphic to S or a rainbow (all edges differently colored) subgraph isomorphic to T. The Erdos-Rado Canonical Ramsey Theorem implies that f(S, T) exists if and only if S is a star or T is acyclic, and much work has been done to determine the rate of growth of f(S, T) for various types of parameters. When S and T are both trees having s and t edges respectively, Jamison, Jiang, and Ling showed "},"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":"0706.2107","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-06-14T12:25:48Z","cross_cats_sorted":[],"title_canon_sha256":"cc62298a8dbeb4ee9d1faa59bc87d38db5af0ef33821a32b95b3b8d9d47f2e6b","abstract_canon_sha256":"501d9199e7cd04681791f0f84bf27d23612ab5e484b6abdf171277136696dcd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:16.202757Z","signature_b64":"9QIZBJoaLx5WgBDajxtYDODgpEfNOi0tartOmVAX+c2wOujrHyixuIPzRg1bVquTvPqesJ6CU+lwCja3Qb1qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"648db91529e5ee3ec9b43b6578b16efea2005b4788cb6d9ef9f29bb595a5fae2","last_reissued_at":"2026-05-18T04:09:16.202384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:16.202384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Ramsey Numbers","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Po-Shen Loh","submitted_at":"2007-06-14T12:25:48Z","abstract_excerpt":"For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge coloring of the complete graph on n vertices, with any number of colors, has a monochromatic subgraph isomorphic to S or a rainbow (all edges differently colored) subgraph isomorphic to T. The Erdos-Rado Canonical Ramsey Theorem implies that f(S, T) exists if and only if S is a star or T is acyclic, and much work has been done to determine the rate of growth of f(S, T) for various types of parameters. When S and T are both trees having s and t edges respectively, Jamison, Jiang, and Ling showed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.2107","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":"0706.2107","created_at":"2026-05-18T04:09:16.202441+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.2107v2","created_at":"2026-05-18T04:09:16.202441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.2107","created_at":"2026-05-18T04:09:16.202441+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSG3SFJJ4XXD","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSG3SFJJ4XXD5SNU","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSG3SFJJ","created_at":"2026-05-18T12:25:55.427421+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/MSG3SFJJ4XXD5SNUHNSXRMLO72","json":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72.json","graph_json":"https://pith.science/api/pith-number/MSG3SFJJ4XXD5SNUHNSXRMLO72/graph.json","events_json":"https://pith.science/api/pith-number/MSG3SFJJ4XXD5SNUHNSXRMLO72/events.json","paper":"https://pith.science/paper/MSG3SFJJ"},"agent_actions":{"view_html":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72","download_json":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72.json","view_paper":"https://pith.science/paper/MSG3SFJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.2107&json=true","fetch_graph":"https://pith.science/api/pith-number/MSG3SFJJ4XXD5SNUHNSXRMLO72/graph.json","fetch_events":"https://pith.science/api/pith-number/MSG3SFJJ4XXD5SNUHNSXRMLO72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72/action/storage_attestation","attest_author":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72/action/author_attestation","sign_citation":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72/action/citation_signature","submit_replication":"https://pith.science/pith/MSG3SFJJ4XXD5SNUHNSXRMLO72/action/replication_record"}},"created_at":"2026-05-18T04:09:16.202441+00:00","updated_at":"2026-05-18T04:09:16.202441+00:00"}