{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HMITZHIQQ4HBWFHWOFP4FQDZX3","short_pith_number":"pith:HMITZHIQ","canonical_record":{"source":{"id":"1906.09185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-21T15:17:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"40f8415d9549b139d2ca7761370ebe6b832dd475b46aaafd7e5c0f96be22c524","abstract_canon_sha256":"d4cab77d7a220653d7ecd2743078ab958159ad3cc15f42bb9db26a69d1b5749f"},"schema_version":"1.0"},"canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","source":{"kind":"arxiv","id":"1906.09185","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09185","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09185v2","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09185","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"HMITZHIQQ4HB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMITZHIQQ4HBWFHW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMITZHIQ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HMITZHIQQ4HBWFHWOFP4FQDZX3","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-21T15:17:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"40f8415d9549b139d2ca7761370ebe6b832dd475b46aaafd7e5c0f96be22c524","abstract_canon_sha256":"d4cab77d7a220653d7ecd2743078ab958159ad3cc15f42bb9db26a69d1b5749f"},"schema_version":"1.0"},"canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:23.830525Z","signature_b64":"A/0hGTs/6FmZSYA077JgELlKoMcust9l0DsneP2M6OStTT/9ghtAjOQ8hQssDjIA4wd0OCzatPjvKMS0pwJ6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","last_reissued_at":"2026-05-17T23:39:23.829636Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:23.829636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09185","source_version":2,"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-17T23:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7F7T40va0mr0qc2Xq3f8Nl4yFOFiTBIZyKAN8Le5p+x0TejtcH/gCvlV6b/QXSZjZptXnRBftX1/mQtWVndAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:37:10.574941Z"},"content_sha256":"05720dc76b1b51394e7c59a2782a72372d6f8379cb8e6b804353e529f3ff1da8","schema_version":"1.0","event_id":"sha256:05720dc76b1b51394e7c59a2782a72372d6f8379cb8e6b804353e529f3ff1da8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HMITZHIQQ4HBWFHWOFP4FQDZX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The size Ramsey number of graphs with bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Liebenau, David R. Wood, Liana Yepremyan, Nina Kamcev","submitted_at":"2019-06-21T15:17:30Z","abstract_excerpt":"A graph $G$ is Ramsey for a graph $H$ if every 2-colouring of the edges of $G$ contains a monochromatic copy of $H$. We consider the following question: if $H$ has bounded treewidth, is there a `sparse' graph $G$ that is Ramsey for $H$? Two notions of sparsity are considered. Firstly, we show that if the maximum degree and treewidth of $H$ are bounded, then there is a graph $G$ with $O(|V(H)|)$ edges that is Ramsey for $H$. This was previously only known for the smaller class of graphs $H$ with bounded bandwidth. On the other hand, we prove that the treewidth of a graph $G$ that is Ramsey for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09185","kind":"arxiv","version":2},"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-17T23:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYnqkFVZNqb+uCirl1a0Hsknj9N/HwfuOp2VYNXHm5tgECEgTdbYyeqdZuO1aZNe0lVvgB1tVVr0IrRfAdsuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:37:10.575595Z"},"content_sha256":"f475d04aeedf81ec398de6de05a34612d9fe0802cebebd771bb6ba76241d1e9c","schema_version":"1.0","event_id":"sha256:f475d04aeedf81ec398de6de05a34612d9fe0802cebebd771bb6ba76241d1e9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/bundle.json","state_url":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/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-30T01:37:10Z","links":{"resolver":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3","bundle":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/bundle.json","state":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HMITZHIQQ4HBWFHWOFP4FQDZX3","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":"d4cab77d7a220653d7ecd2743078ab958159ad3cc15f42bb9db26a69d1b5749f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-21T15:17:30Z","title_canon_sha256":"40f8415d9549b139d2ca7761370ebe6b832dd475b46aaafd7e5c0f96be22c524"},"schema_version":"1.0","source":{"id":"1906.09185","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09185","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09185v2","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09185","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"HMITZHIQQ4HB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMITZHIQQ4HBWFHW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMITZHIQ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:f475d04aeedf81ec398de6de05a34612d9fe0802cebebd771bb6ba76241d1e9c","target":"graph","created_at":"2026-05-17T23:39:23Z","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 graph $G$ is Ramsey for a graph $H$ if every 2-colouring of the edges of $G$ contains a monochromatic copy of $H$. We consider the following question: if $H$ has bounded treewidth, is there a `sparse' graph $G$ that is Ramsey for $H$? Two notions of sparsity are considered. Firstly, we show that if the maximum degree and treewidth of $H$ are bounded, then there is a graph $G$ with $O(|V(H)|)$ edges that is Ramsey for $H$. This was previously only known for the smaller class of graphs $H$ with bounded bandwidth. On the other hand, we prove that the treewidth of a graph $G$ that is Ramsey for ","authors_text":"Anita Liebenau, David R. Wood, Liana Yepremyan, Nina Kamcev","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-21T15:17:30Z","title":"The size Ramsey number of graphs with bounded treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09185","kind":"arxiv","version":2},"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:05720dc76b1b51394e7c59a2782a72372d6f8379cb8e6b804353e529f3ff1da8","target":"record","created_at":"2026-05-17T23:39:23Z","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":"d4cab77d7a220653d7ecd2743078ab958159ad3cc15f42bb9db26a69d1b5749f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-21T15:17:30Z","title_canon_sha256":"40f8415d9549b139d2ca7761370ebe6b832dd475b46aaafd7e5c0f96be22c524"},"schema_version":"1.0","source":{"id":"1906.09185","kind":"arxiv","version":2}},"canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","first_computed_at":"2026-05-17T23:39:23.829636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:23.829636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A/0hGTs/6FmZSYA077JgELlKoMcust9l0DsneP2M6OStTT/9ghtAjOQ8hQssDjIA4wd0OCzatPjvKMS0pwJ6DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:23.830525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09185","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05720dc76b1b51394e7c59a2782a72372d6f8379cb8e6b804353e529f3ff1da8","sha256:f475d04aeedf81ec398de6de05a34612d9fe0802cebebd771bb6ba76241d1e9c"],"state_sha256":"410de67b7fba318c2574adb9638b47ca6434c0008a93560c722bc1cadbea9f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SL7OL0fm5pTHPIN+Fd2VYtfQYJmYQOQWWfurQtP5sAcsDkcpNtUxyPZbnFCrfmeB20DNYAumwEKyShV0NJsPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:37:10.579132Z","bundle_sha256":"938cdbce6973e1ce1cdb22d144a75b0ee24a6f331635a91280c47f5b5822677d"}}