{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5SYM7LNUEU223AP72R5OJDFJJP","short_pith_number":"pith:5SYM7LNU","schema_version":"1.0","canonical_sha256":"ecb0cfadb42535ad81ffd47ae48ca94bdb19c7e97cafa7f0e13acee2381690ce","source":{"kind":"arxiv","id":"2411.13416","version":1},"attestation_state":"computed","paper":{"title":"Coloring triangles in graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ayush Basu, Marcelo Sales, Vojt\\v{e}ch R\\\"odl","submitted_at":"2024-11-20T16:02:34Z","abstract_excerpt":"We study quantitative aspects of the following fact: For every graph $F$, there exists a graph $G$ with the property that any $2$-coloring of the triangles of $G$ yields an induced copy of $F$, in which all triangles are monochromatic. We define the Ramsey number $R_{\\text{ind}}^{\\Delta}(F)$ as the smallest size of such a graph $G$. Although this fact has several proofs, all of them provide tower-type bounds. We study the number $R_{\\text{ind}}^{\\Delta}(F)$ for some particular classes of graphs $F$."},"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":"2411.13416","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T16:02:34Z","cross_cats_sorted":[],"title_canon_sha256":"228f48545e503bb886d5d1eb57a22855a7eff2f420665a1ffea1df0b1b006bce","abstract_canon_sha256":"964a3e02147f3160dfef3a9c63d175caa2e838a2bf2fcdeb837933b500ab0772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:16.588756Z","signature_b64":"sAmIuHfDMCCP8vOt+NC6Kk//bn8n9IzUDVqbgIBh0OD7jZW8F5qN4yXEOf7cDeQXFlmXB4tjw9vWSgUCl/9hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb0cfadb42535ad81ffd47ae48ca94bdb19c7e97cafa7f0e13acee2381690ce","last_reissued_at":"2026-07-05T09:38:16.588294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:16.588294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring triangles in graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ayush Basu, Marcelo Sales, Vojt\\v{e}ch R\\\"odl","submitted_at":"2024-11-20T16:02:34Z","abstract_excerpt":"We study quantitative aspects of the following fact: For every graph $F$, there exists a graph $G$ with the property that any $2$-coloring of the triangles of $G$ yields an induced copy of $F$, in which all triangles are monochromatic. We define the Ramsey number $R_{\\text{ind}}^{\\Delta}(F)$ as the smallest size of such a graph $G$. Although this fact has several proofs, all of them provide tower-type bounds. We study the number $R_{\\text{ind}}^{\\Delta}(F)$ for some particular classes of graphs $F$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13416","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/2411.13416/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.13416","created_at":"2026-07-05T09:38:16.588365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13416v1","created_at":"2026-07-05T09:38:16.588365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13416","created_at":"2026-07-05T09:38:16.588365+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SYM7LNUEU22","created_at":"2026-07-05T09:38:16.588365+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SYM7LNUEU223AP7","created_at":"2026-07-05T09:38:16.588365+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SYM7LNU","created_at":"2026-07-05T09:38:16.588365+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/5SYM7LNUEU223AP72R5OJDFJJP","json":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP.json","graph_json":"https://pith.science/api/pith-number/5SYM7LNUEU223AP72R5OJDFJJP/graph.json","events_json":"https://pith.science/api/pith-number/5SYM7LNUEU223AP72R5OJDFJJP/events.json","paper":"https://pith.science/paper/5SYM7LNU"},"agent_actions":{"view_html":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP","download_json":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP.json","view_paper":"https://pith.science/paper/5SYM7LNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13416&json=true","fetch_graph":"https://pith.science/api/pith-number/5SYM7LNUEU223AP72R5OJDFJJP/graph.json","fetch_events":"https://pith.science/api/pith-number/5SYM7LNUEU223AP72R5OJDFJJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/action/storage_attestation","attest_author":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/action/author_attestation","sign_citation":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/action/citation_signature","submit_replication":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/action/replication_record"}},"created_at":"2026-07-05T09:38:16.588365+00:00","updated_at":"2026-07-05T09:38:16.588365+00:00"}