{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2XJUID62DWCNK3YB53QEFF67M3","short_pith_number":"pith:2XJUID62","schema_version":"1.0","canonical_sha256":"d5d3440fda1d84d56f01eee04297df66ed86d3b69983b0fbd3f9b3c83e74a501","source":{"kind":"arxiv","id":"2606.24695","version":1},"attestation_state":"computed","paper":{"title":"Forcing monochromatic induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sepehr Hajebi, Sophie Spirkl","submitted_at":"2026-06-23T15:23:37Z","abstract_excerpt":"We prove that for all $c\\in\\mathbb N$ and nonnull graphs $H_1,\\ldots,H_t$, there exists $n\\in\\mathbb N$ such that if $G$ is a $c$-edge-colored complete graph with no monochromatic induced copy of the complete join of $H_1,\\ldots,H_t$, then $V(G)$ is the union of $n$ sets $V_1,\\ldots,V_n$ such that within each set $V_j$ with $|V_j|\\neq 1$, the edges of some color form a graph that excludes at least one of $H_1,\\ldots,H_t$ as an induced subgraph. In fact, the same holds even if the colors overlap, and with a different list of graphs $H_1,\\ldots,H_t$ assigned to each color. When $H_1,\\ldots,H_t$ "},"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":"2606.24695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T15:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"e3fc0c7e931637f72e2db4f1155c51454db6840bb811485e42fed2537a89dff5","abstract_canon_sha256":"9cf1457cb1a4c64db64449bb0d0321df0a7f3487509846250d2611cf5206e3de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:39.451049Z","signature_b64":"BEGyy73k7ti6bnzksRNmiFGLedx+q1YQ49/CbIbr6zkMCpnSA5Esu0P+VW4tui7hTDrVKx1FiE68ogG3k6vQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5d3440fda1d84d56f01eee04297df66ed86d3b69983b0fbd3f9b3c83e74a501","last_reissued_at":"2026-06-24T01:15:39.450698Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:39.450698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forcing monochromatic induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sepehr Hajebi, Sophie Spirkl","submitted_at":"2026-06-23T15:23:37Z","abstract_excerpt":"We prove that for all $c\\in\\mathbb N$ and nonnull graphs $H_1,\\ldots,H_t$, there exists $n\\in\\mathbb N$ such that if $G$ is a $c$-edge-colored complete graph with no monochromatic induced copy of the complete join of $H_1,\\ldots,H_t$, then $V(G)$ is the union of $n$ sets $V_1,\\ldots,V_n$ such that within each set $V_j$ with $|V_j|\\neq 1$, the edges of some color form a graph that excludes at least one of $H_1,\\ldots,H_t$ as an induced subgraph. In fact, the same holds even if the colors overlap, and with a different list of graphs $H_1,\\ldots,H_t$ assigned to each color. When $H_1,\\ldots,H_t$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24695","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/2606.24695/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":"2606.24695","created_at":"2026-06-24T01:15:39.450747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24695v1","created_at":"2026-06-24T01:15:39.450747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24695","created_at":"2026-06-24T01:15:39.450747+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XJUID62DWCN","created_at":"2026-06-24T01:15:39.450747+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XJUID62DWCNK3YB","created_at":"2026-06-24T01:15:39.450747+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XJUID62","created_at":"2026-06-24T01:15:39.450747+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/2XJUID62DWCNK3YB53QEFF67M3","json":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3.json","graph_json":"https://pith.science/api/pith-number/2XJUID62DWCNK3YB53QEFF67M3/graph.json","events_json":"https://pith.science/api/pith-number/2XJUID62DWCNK3YB53QEFF67M3/events.json","paper":"https://pith.science/paper/2XJUID62"},"agent_actions":{"view_html":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3","download_json":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3.json","view_paper":"https://pith.science/paper/2XJUID62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24695&json=true","fetch_graph":"https://pith.science/api/pith-number/2XJUID62DWCNK3YB53QEFF67M3/graph.json","fetch_events":"https://pith.science/api/pith-number/2XJUID62DWCNK3YB53QEFF67M3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/action/storage_attestation","attest_author":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/action/author_attestation","sign_citation":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/action/citation_signature","submit_replication":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/action/replication_record"}},"created_at":"2026-06-24T01:15:39.450747+00:00","updated_at":"2026-06-24T01:15:39.450747+00:00"}