{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I47YQ522EKRKRJEY7L2PSBECWD","short_pith_number":"pith:I47YQ522","canonical_record":{"source":{"id":"1807.09376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T22:27:04Z","cross_cats_sorted":[],"title_canon_sha256":"d655bf68cbfbb1a661aa044a7e21650d218f1450c5fb191e6e77d9ece60501e7","abstract_canon_sha256":"00e27eaeadd20f7e7b5f5071e3e6c2c050245bbc79a117183678cf4b69d3b29b"},"schema_version":"1.0"},"canonical_sha256":"473f88775a22a2a8a498faf4f90482b0f9e3b376de4b360f50330a251f4216b5","source":{"kind":"arxiv","id":"1807.09376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09376","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09376v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09376","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"I47YQ522EKRK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I47YQ522EKRKRJEY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I47YQ522","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I47YQ522EKRKRJEY7L2PSBECWD","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T22:27:04Z","cross_cats_sorted":[],"title_canon_sha256":"d655bf68cbfbb1a661aa044a7e21650d218f1450c5fb191e6e77d9ece60501e7","abstract_canon_sha256":"00e27eaeadd20f7e7b5f5071e3e6c2c050245bbc79a117183678cf4b69d3b29b"},"schema_version":"1.0"},"canonical_sha256":"473f88775a22a2a8a498faf4f90482b0f9e3b376de4b360f50330a251f4216b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:51.502512Z","signature_b64":"GiIEekmfeokphVxv9FWe1kpM4j8gJyDN82GlE5QyeF6AHOxxJOdYkBrKihohgsJsxTFXEW6PYGwPBsE4C4CRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473f88775a22a2a8a498faf4f90482b0f9e3b376de4b360f50330a251f4216b5","last_reissued_at":"2026-05-18T00:09:51.501884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:51.501884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09376","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-18T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEC7SmIVOIP12tMFnRJXxmXqOS6orGW6YXEHydz1cG7PsQw69ZZLdMN+3xaPgWB9ATIp2tFyPYl7kMkER00XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:02:05.587335Z"},"content_sha256":"1fc55bb40add7855942a86ac7bce15ef182f7785a51815264d3a87f667bef9e5","schema_version":"1.0","event_id":"sha256:1fc55bb40add7855942a86ac7bce15ef182f7785a51815264d3a87f667bef9e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I47YQ522EKRKRJEY7L2PSBECWD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On induced Ramsey numbers for multiple copies of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Izolda Gorgol, Maria Axenovich","submitted_at":"2018-07-24T22:27:04Z","abstract_excerpt":"We say that a graph F strongly arrows a pair of graphs (G,H) if any colouring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F. The induced Ramsey number, IR(G,H) is defined as the smallest order of a graph that strongly arrows (G,H). We consider the connection between the induced Ramsey number for a pair of two connected graphs IR(G,H) and the induced Ramsey number for multiple copies of these graphs IR(sG,tH), where xG denotes the pairwise vertex-disjoint union of x copies of G. It is easy to see that if F strongly arrow (G,H), then (s+t-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09376","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-18T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rw1JtMxh/hcw4vMDPYdTWy0HJRhvbGnBWlf99hGAEOh6YP2uMU+ZUhZ4+CbLGylZ0qU/dm//JVhf5I0qSp3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:02:05.587696Z"},"content_sha256":"d6660bd2c279431626e31af9c2deb6ae975146b11558fc8c1b4a126fc33181fc","schema_version":"1.0","event_id":"sha256:d6660bd2c279431626e31af9c2deb6ae975146b11558fc8c1b4a126fc33181fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/bundle.json","state_url":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I47YQ522EKRKRJEY7L2PSBECWD/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-05-25T08:02:05Z","links":{"resolver":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD","bundle":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/bundle.json","state":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I47YQ522EKRKRJEY7L2PSBECWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I47YQ522EKRKRJEY7L2PSBECWD","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":"00e27eaeadd20f7e7b5f5071e3e6c2c050245bbc79a117183678cf4b69d3b29b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T22:27:04Z","title_canon_sha256":"d655bf68cbfbb1a661aa044a7e21650d218f1450c5fb191e6e77d9ece60501e7"},"schema_version":"1.0","source":{"id":"1807.09376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09376","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09376v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09376","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"I47YQ522EKRK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I47YQ522EKRKRJEY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I47YQ522","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:d6660bd2c279431626e31af9c2deb6ae975146b11558fc8c1b4a126fc33181fc","target":"graph","created_at":"2026-05-18T00:09:51Z","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":"We say that a graph F strongly arrows a pair of graphs (G,H) if any colouring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F. The induced Ramsey number, IR(G,H) is defined as the smallest order of a graph that strongly arrows (G,H). We consider the connection between the induced Ramsey number for a pair of two connected graphs IR(G,H) and the induced Ramsey number for multiple copies of these graphs IR(sG,tH), where xG denotes the pairwise vertex-disjoint union of x copies of G. It is easy to see that if F strongly arrow (G,H), then (s+t-","authors_text":"Izolda Gorgol, Maria Axenovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T22:27:04Z","title":"On induced Ramsey numbers for multiple copies of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09376","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:1fc55bb40add7855942a86ac7bce15ef182f7785a51815264d3a87f667bef9e5","target":"record","created_at":"2026-05-18T00:09:51Z","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":"00e27eaeadd20f7e7b5f5071e3e6c2c050245bbc79a117183678cf4b69d3b29b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T22:27:04Z","title_canon_sha256":"d655bf68cbfbb1a661aa044a7e21650d218f1450c5fb191e6e77d9ece60501e7"},"schema_version":"1.0","source":{"id":"1807.09376","kind":"arxiv","version":1}},"canonical_sha256":"473f88775a22a2a8a498faf4f90482b0f9e3b376de4b360f50330a251f4216b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473f88775a22a2a8a498faf4f90482b0f9e3b376de4b360f50330a251f4216b5","first_computed_at":"2026-05-18T00:09:51.501884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:51.501884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GiIEekmfeokphVxv9FWe1kpM4j8gJyDN82GlE5QyeF6AHOxxJOdYkBrKihohgsJsxTFXEW6PYGwPBsE4C4CRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:51.502512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fc55bb40add7855942a86ac7bce15ef182f7785a51815264d3a87f667bef9e5","sha256:d6660bd2c279431626e31af9c2deb6ae975146b11558fc8c1b4a126fc33181fc"],"state_sha256":"f3246c5c88c40c82291cfe2d135396d6b5200f31b5d0fa89d83d7934f0f9db9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLP4wHdS3FKLLRAxq3jfKk9rNHw7loTzRbAkTnGPl+dq8+C/79eJ9nJZbcZRJdI9erbTDPuQC1xG5s517AnYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:02:05.590302Z","bundle_sha256":"1a147c9579ffc95e6390b95d9c174e759eb5d3aa97a444e7937c047580c5e665"}}