{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5SYM7LNUEU223AP72R5OJDFJJP","short_pith_number":"pith:5SYM7LNU","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"},"canonical_sha256":"ecb0cfadb42535ad81ffd47ae48ca94bdb19c7e97cafa7f0e13acee2381690ce","source":{"kind":"arxiv","id":"2411.13416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13416","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13416v1","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13416","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"5SYM7LNUEU22","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"pith_short_16","alias_value":"5SYM7LNUEU223AP7","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"pith_short_8","alias_value":"5SYM7LNU","created_at":"2026-07-05T09:38:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5SYM7LNUEU223AP72R5OJDFJJP","target":"record","payload":{"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"},"canonical_sha256":"ecb0cfadb42535ad81ffd47ae48ca94bdb19c7e97cafa7f0e13acee2381690ce","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"},"source_kind":"arxiv","source_id":"2411.13416","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-05T09:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teFj+Zq48p4y7McrIKbjFRehx7vJoum6K7up87YBQQPdpXgmufqojiNZfRvLZ8/HBXp9p1VPaq01CDnHxx4vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:17:25.358701Z"},"content_sha256":"c2f9fb06c31b81a43169f81ce0319d33643949526c5e1900e349cd9d7a350f79","schema_version":"1.0","event_id":"sha256:c2f9fb06c31b81a43169f81ce0319d33643949526c5e1900e349cd9d7a350f79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5SYM7LNUEU223AP72R5OJDFJJP","target":"graph","payload":{"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"},"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-05T09:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InG05RRcA5/vvsyEBNCdxG2dpYzusMT8XIgHmtsMhhhpU6bh7G9sWH+PwfnyCPb/fkRBU4oSwfHsOGZ6ThhpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:17:25.359073Z"},"content_sha256":"eaa5ff5cec34240b08de43917d368f4cd886e2f73bfa0c3f90226aa49e53622f","schema_version":"1.0","event_id":"sha256:eaa5ff5cec34240b08de43917d368f4cd886e2f73bfa0c3f90226aa49e53622f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/bundle.json","state_url":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SYM7LNUEU223AP72R5OJDFJJP/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-07-07T06:17:25Z","links":{"resolver":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP","bundle":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/bundle.json","state":"https://pith.science/pith/5SYM7LNUEU223AP72R5OJDFJJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SYM7LNUEU223AP72R5OJDFJJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5SYM7LNUEU223AP72R5OJDFJJP","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":"964a3e02147f3160dfef3a9c63d175caa2e838a2bf2fcdeb837933b500ab0772","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T16:02:34Z","title_canon_sha256":"228f48545e503bb886d5d1eb57a22855a7eff2f420665a1ffea1df0b1b006bce"},"schema_version":"1.0","source":{"id":"2411.13416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13416","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13416v1","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13416","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"5SYM7LNUEU22","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"pith_short_16","alias_value":"5SYM7LNUEU223AP7","created_at":"2026-07-05T09:38:16Z"},{"alias_kind":"pith_short_8","alias_value":"5SYM7LNU","created_at":"2026-07-05T09:38:16Z"}],"graph_snapshots":[{"event_id":"sha256:eaa5ff5cec34240b08de43917d368f4cd886e2f73bfa0c3f90226aa49e53622f","target":"graph","created_at":"2026-07-05T09:38:16Z","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/2411.13416/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Ayush Basu, Marcelo Sales, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T16:02:34Z","title":"Coloring triangles in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13416","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:c2f9fb06c31b81a43169f81ce0319d33643949526c5e1900e349cd9d7a350f79","target":"record","created_at":"2026-07-05T09:38:16Z","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":"964a3e02147f3160dfef3a9c63d175caa2e838a2bf2fcdeb837933b500ab0772","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T16:02:34Z","title_canon_sha256":"228f48545e503bb886d5d1eb57a22855a7eff2f420665a1ffea1df0b1b006bce"},"schema_version":"1.0","source":{"id":"2411.13416","kind":"arxiv","version":1}},"canonical_sha256":"ecb0cfadb42535ad81ffd47ae48ca94bdb19c7e97cafa7f0e13acee2381690ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb0cfadb42535ad81ffd47ae48ca94bdb19c7e97cafa7f0e13acee2381690ce","first_computed_at":"2026-07-05T09:38:16.588294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:16.588294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAmIuHfDMCCP8vOt+NC6Kk//bn8n9IzUDVqbgIBh0OD7jZW8F5qN4yXEOf7cDeQXFlmXB4tjw9vWSgUCl/9hCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:16.588756Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2f9fb06c31b81a43169f81ce0319d33643949526c5e1900e349cd9d7a350f79","sha256:eaa5ff5cec34240b08de43917d368f4cd886e2f73bfa0c3f90226aa49e53622f"],"state_sha256":"86e058a2b2c5c875436c4ed8f5fbb634cdf2bfa9b2fe12fbcd453c8f42803a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ZudJI0EzikOM0kTKI+MLveIGZ8sSTwNcUBMUSOwy4KCj53PcyQFXY0E5iHh3CYK7NYkjoZsQWzXeXx0GBDYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:17:25.361240Z","bundle_sha256":"51389a7ca1b5cd026095c91ece43c751b609367f09f42d88bf11bdd3a13292d6"}}