{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2XJUID62DWCNK3YB53QEFF67M3","short_pith_number":"pith:2XJUID62","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"},"canonical_sha256":"d5d3440fda1d84d56f01eee04297df66ed86d3b69983b0fbd3f9b3c83e74a501","source":{"kind":"arxiv","id":"2606.24695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24695","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24695v1","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24695","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"2XJUID62DWCN","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"pith_short_16","alias_value":"2XJUID62DWCNK3YB","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"pith_short_8","alias_value":"2XJUID62","created_at":"2026-06-24T01:15:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2XJUID62DWCNK3YB53QEFF67M3","target":"record","payload":{"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"},"canonical_sha256":"d5d3440fda1d84d56f01eee04297df66ed86d3b69983b0fbd3f9b3c83e74a501","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"},"source_kind":"arxiv","source_id":"2606.24695","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-06-24T01:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MYYo1Wu3KGdHsk8ESqJOxAkb4SY4dJLhpIcCWi+yEAWnzh1R968yPvv4UE39Yk+DD3Jp+VS90TsNXMgY2d6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:27:17.808159Z"},"content_sha256":"74145ad7221249e5a7fd99f404ce56e6feb86aae7207d88dcb3d39327bed10c2","schema_version":"1.0","event_id":"sha256:74145ad7221249e5a7fd99f404ce56e6feb86aae7207d88dcb3d39327bed10c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2XJUID62DWCNK3YB53QEFF67M3","target":"graph","payload":{"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"},"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-06-24T01:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4w6bXeNXRBlHDb6T/DExxKTPMnIphj0aY/VpWootrLxCAE0VCrcudzybjdbHlJvfQQa26yphUJM0kKd+uLJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:27:17.809130Z"},"content_sha256":"6d6e351fc755f96d3d483ed9ef3c4a180c919166c0229881ba72754a5cb87ede","schema_version":"1.0","event_id":"sha256:6d6e351fc755f96d3d483ed9ef3c4a180c919166c0229881ba72754a5cb87ede"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/bundle.json","state_url":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XJUID62DWCNK3YB53QEFF67M3/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-08-05T18:27:17Z","links":{"resolver":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3","bundle":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/bundle.json","state":"https://pith.science/pith/2XJUID62DWCNK3YB53QEFF67M3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XJUID62DWCNK3YB53QEFF67M3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2XJUID62DWCNK3YB53QEFF67M3","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":"9cf1457cb1a4c64db64449bb0d0321df0a7f3487509846250d2611cf5206e3de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T15:23:37Z","title_canon_sha256":"e3fc0c7e931637f72e2db4f1155c51454db6840bb811485e42fed2537a89dff5"},"schema_version":"1.0","source":{"id":"2606.24695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24695","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24695v1","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24695","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"2XJUID62DWCN","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"pith_short_16","alias_value":"2XJUID62DWCNK3YB","created_at":"2026-06-24T01:15:39Z"},{"alias_kind":"pith_short_8","alias_value":"2XJUID62","created_at":"2026-06-24T01:15:39Z"}],"graph_snapshots":[{"event_id":"sha256:6d6e351fc755f96d3d483ed9ef3c4a180c919166c0229881ba72754a5cb87ede","target":"graph","created_at":"2026-06-24T01:15:39Z","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/2606.24695/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$ ","authors_text":"Sepehr Hajebi, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T15:23:37Z","title":"Forcing monochromatic induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24695","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:74145ad7221249e5a7fd99f404ce56e6feb86aae7207d88dcb3d39327bed10c2","target":"record","created_at":"2026-06-24T01:15:39Z","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":"9cf1457cb1a4c64db64449bb0d0321df0a7f3487509846250d2611cf5206e3de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T15:23:37Z","title_canon_sha256":"e3fc0c7e931637f72e2db4f1155c51454db6840bb811485e42fed2537a89dff5"},"schema_version":"1.0","source":{"id":"2606.24695","kind":"arxiv","version":1}},"canonical_sha256":"d5d3440fda1d84d56f01eee04297df66ed86d3b69983b0fbd3f9b3c83e74a501","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5d3440fda1d84d56f01eee04297df66ed86d3b69983b0fbd3f9b3c83e74a501","first_computed_at":"2026-06-24T01:15:39.450698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:39.450698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BEGyy73k7ti6bnzksRNmiFGLedx+q1YQ49/CbIbr6zkMCpnSA5Esu0P+VW4tui7hTDrVKx1FiE68ogG3k6vQAA==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:39.451049Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74145ad7221249e5a7fd99f404ce56e6feb86aae7207d88dcb3d39327bed10c2","sha256:6d6e351fc755f96d3d483ed9ef3c4a180c919166c0229881ba72754a5cb87ede"],"state_sha256":"a83c5036b4e30dcb89a0880bd30323d289a6f241137a0547796b5702c179f07b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dv0c5zx252f/QOXgPbPasTZ9QrCCklbv4gN5vHmz3E6nUKw7+Tid4tItJQ0QRsxnbhcyxWg9nI+UX8uljBQdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:27:17.816355Z","bundle_sha256":"da00bf3ef80700144038ad5e0eca84c32289857370d01574846212b9937af122"}}