{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ITDZGM7JBTEBLCYK3K6J67KRX6","short_pith_number":"pith:ITDZGM7J","canonical_record":{"source":{"id":"1411.6678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T22:55:21Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"412f8885fe29f339b58904a954fc5760b9b9068d2ff64389091fe2b0f8e62be8","abstract_canon_sha256":"0706bd76fd4656206da4c1599b0d3a05f97f8a76271757d697f1c6c70f656ca4"},"schema_version":"1.0"},"canonical_sha256":"44c79333e90cc8158b0adabc9f7d51bf8c050bf104c7b05e7acc44dc214c8bf2","source":{"kind":"arxiv","id":"1411.6678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6678","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6678v1","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6678","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"pith_short_12","alias_value":"ITDZGM7JBTEB","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ITDZGM7JBTEBLCYK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ITDZGM7J","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ITDZGM7JBTEBLCYK3K6J67KRX6","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T22:55:21Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"412f8885fe29f339b58904a954fc5760b9b9068d2ff64389091fe2b0f8e62be8","abstract_canon_sha256":"0706bd76fd4656206da4c1599b0d3a05f97f8a76271757d697f1c6c70f656ca4"},"schema_version":"1.0"},"canonical_sha256":"44c79333e90cc8158b0adabc9f7d51bf8c050bf104c7b05e7acc44dc214c8bf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:52.672351Z","signature_b64":"3U5OBE2CBqGKZJoSLSIT6w1zsnC6Ims9zk471auntvDySkvoe+YEU8/OpCKhyRgLtuG6DyFTDyAdODijdijTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44c79333e90cc8158b0adabc9f7d51bf8c050bf104c7b05e7acc44dc214c8bf2","last_reissued_at":"2026-05-18T02:32:52.671898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:52.671898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6678","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-05-18T02:32:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pHgk8FwlTxq1do5UgF5G2R//2hC+kr5LMdJMHk2an1Zk2ogsHBsA2bUC8xsvE56pUjjuq9C6iLbJZaJ59aDbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:35:19.508139Z"},"content_sha256":"130cf0931ebb3e1e297bf51799915a39c8e39322efd61cd259b45bffbd9ebb2f","schema_version":"1.0","event_id":"sha256:130cf0931ebb3e1e297bf51799915a39c8e39322efd61cd259b45bffbd9ebb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ITDZGM7JBTEBLCYK3K6J67KRX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Ramsey simple structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Claude Laflamme, Natasha Dobrinen, Norbert Sauer","submitted_at":"2014-11-24T22:55:21Z","abstract_excerpt":"A relational structure $\\mathrm{R}$ is {\\em rainbow Ramsey} if for every finite induced substructure $\\mathrm{C}$ of $\\mathrm{R}$ and every colouring of the copies of $\\mathrm{C}$ with countably many colours, such that each colour is used at most $k$ times for a fixed $k$, there exists a copy $\\mathrm{R}^\\ast$ of $\\mathrm{R}$ so that the copies of $\\mathrm{C}$ in $\\mathrm{R^\\ast}$ use each colour at most once.\n  We show that certain ultrahomogenous binary relational structures, for example the Rado graph, are rainbow Ramsey. Via compactness this then implies that for all finite graphs $\\mathrm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6678","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":""},"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-05-18T02:32:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbD9ElL4Tj+lXE6GjDKunnYXftkICCuCk07Sj0aa4vLVEbZP7eXOsy3HHAMHv1hNh6wywBuguRlFhOsadFP+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:35:19.508752Z"},"content_sha256":"dd9341c28bf35cbc042a2b7227fb18378021f80840958707fa7ba601a1cc599b","schema_version":"1.0","event_id":"sha256:dd9341c28bf35cbc042a2b7227fb18378021f80840958707fa7ba601a1cc599b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITDZGM7JBTEBLCYK3K6J67KRX6/bundle.json","state_url":"https://pith.science/pith/ITDZGM7JBTEBLCYK3K6J67KRX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITDZGM7JBTEBLCYK3K6J67KRX6/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-06-07T09:35:19Z","links":{"resolver":"https://pith.science/pith/ITDZGM7JBTEBLCYK3K6J67KRX6","bundle":"https://pith.science/pith/ITDZGM7JBTEBLCYK3K6J67KRX6/bundle.json","state":"https://pith.science/pith/ITDZGM7JBTEBLCYK3K6J67KRX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITDZGM7JBTEBLCYK3K6J67KRX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ITDZGM7JBTEBLCYK3K6J67KRX6","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":"0706bd76fd4656206da4c1599b0d3a05f97f8a76271757d697f1c6c70f656ca4","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T22:55:21Z","title_canon_sha256":"412f8885fe29f339b58904a954fc5760b9b9068d2ff64389091fe2b0f8e62be8"},"schema_version":"1.0","source":{"id":"1411.6678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6678","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6678v1","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6678","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"pith_short_12","alias_value":"ITDZGM7JBTEB","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ITDZGM7JBTEBLCYK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ITDZGM7J","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:dd9341c28bf35cbc042a2b7227fb18378021f80840958707fa7ba601a1cc599b","target":"graph","created_at":"2026-05-18T02:32:52Z","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"},"paper":{"abstract_excerpt":"A relational structure $\\mathrm{R}$ is {\\em rainbow Ramsey} if for every finite induced substructure $\\mathrm{C}$ of $\\mathrm{R}$ and every colouring of the copies of $\\mathrm{C}$ with countably many colours, such that each colour is used at most $k$ times for a fixed $k$, there exists a copy $\\mathrm{R}^\\ast$ of $\\mathrm{R}$ so that the copies of $\\mathrm{C}$ in $\\mathrm{R^\\ast}$ use each colour at most once.\n  We show that certain ultrahomogenous binary relational structures, for example the Rado graph, are rainbow Ramsey. Via compactness this then implies that for all finite graphs $\\mathrm","authors_text":"Claude Laflamme, Natasha Dobrinen, Norbert Sauer","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T22:55:21Z","title":"Rainbow Ramsey simple structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6678","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:130cf0931ebb3e1e297bf51799915a39c8e39322efd61cd259b45bffbd9ebb2f","target":"record","created_at":"2026-05-18T02:32:52Z","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":"0706bd76fd4656206da4c1599b0d3a05f97f8a76271757d697f1c6c70f656ca4","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T22:55:21Z","title_canon_sha256":"412f8885fe29f339b58904a954fc5760b9b9068d2ff64389091fe2b0f8e62be8"},"schema_version":"1.0","source":{"id":"1411.6678","kind":"arxiv","version":1}},"canonical_sha256":"44c79333e90cc8158b0adabc9f7d51bf8c050bf104c7b05e7acc44dc214c8bf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44c79333e90cc8158b0adabc9f7d51bf8c050bf104c7b05e7acc44dc214c8bf2","first_computed_at":"2026-05-18T02:32:52.671898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:52.671898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3U5OBE2CBqGKZJoSLSIT6w1zsnC6Ims9zk471auntvDySkvoe+YEU8/OpCKhyRgLtuG6DyFTDyAdODijdijTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:52.672351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:130cf0931ebb3e1e297bf51799915a39c8e39322efd61cd259b45bffbd9ebb2f","sha256:dd9341c28bf35cbc042a2b7227fb18378021f80840958707fa7ba601a1cc599b"],"state_sha256":"dfa6b649b889474272430079340f994515f872ca01eb8049932f0f61e4f731ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c788H/3J0bjgjsxXFST+3KeAHdk9oHRvbhw5xwcN7C2OMpOx0KGNZu/wO138GUnmUrzUm1OgFQvf9i6olmh3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:35:19.512042Z","bundle_sha256":"d38f0b8334fb276dfc4a1ec079e017294c50a75f4aadf9cff66ec3daa1016453"}}