{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I47YQ522EKRKRJEY7L2PSBECWD","short_pith_number":"pith:I47YQ522","schema_version":"1.0","canonical_sha256":"473f88775a22a2a8a498faf4f90482b0f9e3b376de4b360f50330a251f4216b5","source":{"kind":"arxiv","id":"1807.09376","version":1},"attestation_state":"computed","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-"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.09376","created_at":"2026-05-18T00:09:51.501974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09376v1","created_at":"2026-05-18T00:09:51.501974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09376","created_at":"2026-05-18T00:09:51.501974+00:00"},{"alias_kind":"pith_short_12","alias_value":"I47YQ522EKRK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I47YQ522EKRKRJEY","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I47YQ522","created_at":"2026-05-18T12:32:28.185984+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/I47YQ522EKRKRJEY7L2PSBECWD","json":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD.json","graph_json":"https://pith.science/api/pith-number/I47YQ522EKRKRJEY7L2PSBECWD/graph.json","events_json":"https://pith.science/api/pith-number/I47YQ522EKRKRJEY7L2PSBECWD/events.json","paper":"https://pith.science/paper/I47YQ522"},"agent_actions":{"view_html":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD","download_json":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD.json","view_paper":"https://pith.science/paper/I47YQ522","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09376&json=true","fetch_graph":"https://pith.science/api/pith-number/I47YQ522EKRKRJEY7L2PSBECWD/graph.json","fetch_events":"https://pith.science/api/pith-number/I47YQ522EKRKRJEY7L2PSBECWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/action/storage_attestation","attest_author":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/action/author_attestation","sign_citation":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/action/citation_signature","submit_replication":"https://pith.science/pith/I47YQ522EKRKRJEY7L2PSBECWD/action/replication_record"}},"created_at":"2026-05-18T00:09:51.501974+00:00","updated_at":"2026-05-18T00:09:51.501974+00:00"}