{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NRHMKCIYH4YANMME2BLGDQJON3","short_pith_number":"pith:NRHMKCIY","canonical_record":{"source":{"id":"1707.04297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-13T20:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"31c55111ef5fd7c61775d9206fea23d3cbfe76593737ee30873ce423851a6d73","abstract_canon_sha256":"afe4212eb46670544eac987518d4b3bcec05dbf7ac16f3d42f64b3161b334646"},"schema_version":"1.0"},"canonical_sha256":"6c4ec509183f3006b184d05661c12e6ee7a17829432807dfab0dfb439a912577","source":{"kind":"arxiv","id":"1707.04297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04297","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04297v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04297","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"NRHMKCIYH4YA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRHMKCIYH4YANMME","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRHMKCIY","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NRHMKCIYH4YANMME2BLGDQJON3","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-13T20:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"31c55111ef5fd7c61775d9206fea23d3cbfe76593737ee30873ce423851a6d73","abstract_canon_sha256":"afe4212eb46670544eac987518d4b3bcec05dbf7ac16f3d42f64b3161b334646"},"schema_version":"1.0"},"canonical_sha256":"6c4ec509183f3006b184d05661c12e6ee7a17829432807dfab0dfb439a912577","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.746056Z","signature_b64":"5usF1qI9CJ0nQBgtqBSQpvdGba8c6I4zIQmy4b4Q+T2GH6B41wXrIYVybrVH9vgymCvTEMTcKCuz6wMN5VriDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4ec509183f3006b184d05661c12e6ee7a17829432807dfab0dfb439a912577","last_reissued_at":"2026-05-18T00:40:18.745341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.745341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04297","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nst0Tn/u+Qg7iTkBeIGihSXO4qMs/IaH2K3X6iaaamcHJZkldMcezznPk1BeKOf4G5eYnCWf83utw86H9xp2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:12:21.127455Z"},"content_sha256":"de6e5b026cd9f641f0fc51646d3a2ddad8955b0c9cae10950fe75bbc483cb07f","schema_version":"1.0","event_id":"sha256:de6e5b026cd9f641f0fc51646d3a2ddad8955b0c9cae10950fe75bbc483cb07f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NRHMKCIYH4YANMME2BLGDQJON3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The size-Ramsey number of powers of paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts, Damian Reding, Dennis Clemens, Guilherme Oliveira Mota, Matthew Jenssen, Natasha Morrison, Yoshiharu Kohayakawa","submitted_at":"2017-07-13T20:14:06Z","abstract_excerpt":"Given graphs $G$ and $H$ and a positive integer $q$ say that $G$ is $q$-Ramsey for $H$, denoted $G\\rightarrow (H)_q$, if every $q$-colouring of the edges of $G$ contains a monochromatic copy of $H$. The size-Ramsey number $\\hat{r}(H)$ of a graph $H$ is defined to be $\\hat{r}(H)=\\min\\{|E(G)|\\colon G\\rightarrow (H)_2\\}$. Answering a question of Conlon, we prove that, for every fixed $k$, we have $\\hat{r}(P_n^k)=O(n)$, where $P_n^k$ is the $k$-th power of the $n$-vertex path $P_n$ (i.e. , the graph with vertex set $V(P_n)$ and all edges $\\{u,v\\}$ such that the distance between $u$ and $v$ in $P_n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04297","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2gBmjblpP1vQ5PQCIs6a7A8l+V7uXoiC90AIrwNqzTOenmLKUjgGRMI3tsh8irIaVZM/+YtgKZ7y1zwMaLxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:12:21.128163Z"},"content_sha256":"bd0e53ebc98a796a203703f5ed947c69b4434cb29fc7112701358fcaaa27c38f","schema_version":"1.0","event_id":"sha256:bd0e53ebc98a796a203703f5ed947c69b4434cb29fc7112701358fcaaa27c38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRHMKCIYH4YANMME2BLGDQJON3/bundle.json","state_url":"https://pith.science/pith/NRHMKCIYH4YANMME2BLGDQJON3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRHMKCIYH4YANMME2BLGDQJON3/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-06T13:12:21Z","links":{"resolver":"https://pith.science/pith/NRHMKCIYH4YANMME2BLGDQJON3","bundle":"https://pith.science/pith/NRHMKCIYH4YANMME2BLGDQJON3/bundle.json","state":"https://pith.science/pith/NRHMKCIYH4YANMME2BLGDQJON3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRHMKCIYH4YANMME2BLGDQJON3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NRHMKCIYH4YANMME2BLGDQJON3","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":"afe4212eb46670544eac987518d4b3bcec05dbf7ac16f3d42f64b3161b334646","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-13T20:14:06Z","title_canon_sha256":"31c55111ef5fd7c61775d9206fea23d3cbfe76593737ee30873ce423851a6d73"},"schema_version":"1.0","source":{"id":"1707.04297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04297","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04297v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04297","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"NRHMKCIYH4YA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRHMKCIYH4YANMME","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRHMKCIY","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:bd0e53ebc98a796a203703f5ed947c69b4434cb29fc7112701358fcaaa27c38f","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"Given graphs $G$ and $H$ and a positive integer $q$ say that $G$ is $q$-Ramsey for $H$, denoted $G\\rightarrow (H)_q$, if every $q$-colouring of the edges of $G$ contains a monochromatic copy of $H$. The size-Ramsey number $\\hat{r}(H)$ of a graph $H$ is defined to be $\\hat{r}(H)=\\min\\{|E(G)|\\colon G\\rightarrow (H)_2\\}$. Answering a question of Conlon, we prove that, for every fixed $k$, we have $\\hat{r}(P_n^k)=O(n)$, where $P_n^k$ is the $k$-th power of the $n$-vertex path $P_n$ (i.e. , the graph with vertex set $V(P_n)$ and all edges $\\{u,v\\}$ such that the distance between $u$ and $v$ in $P_n","authors_text":"Barnaby Roberts, Damian Reding, Dennis Clemens, Guilherme Oliveira Mota, Matthew Jenssen, Natasha Morrison, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-13T20:14:06Z","title":"The size-Ramsey number of powers of paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04297","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:de6e5b026cd9f641f0fc51646d3a2ddad8955b0c9cae10950fe75bbc483cb07f","target":"record","created_at":"2026-05-18T00:40:18Z","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":"afe4212eb46670544eac987518d4b3bcec05dbf7ac16f3d42f64b3161b334646","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-13T20:14:06Z","title_canon_sha256":"31c55111ef5fd7c61775d9206fea23d3cbfe76593737ee30873ce423851a6d73"},"schema_version":"1.0","source":{"id":"1707.04297","kind":"arxiv","version":1}},"canonical_sha256":"6c4ec509183f3006b184d05661c12e6ee7a17829432807dfab0dfb439a912577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c4ec509183f3006b184d05661c12e6ee7a17829432807dfab0dfb439a912577","first_computed_at":"2026-05-18T00:40:18.745341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.745341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5usF1qI9CJ0nQBgtqBSQpvdGba8c6I4zIQmy4b4Q+T2GH6B41wXrIYVybrVH9vgymCvTEMTcKCuz6wMN5VriDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.746056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de6e5b026cd9f641f0fc51646d3a2ddad8955b0c9cae10950fe75bbc483cb07f","sha256:bd0e53ebc98a796a203703f5ed947c69b4434cb29fc7112701358fcaaa27c38f"],"state_sha256":"28a0d6a1e22de1ebd6115af1690db829a42dc8cce18f00287960597b79375c78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17SRzo5/HLVnbwT9nkaYhQCS49kcmv94ulONfQVYcND1VBT+FonCCrREvki3bflrMVm1LLReZnbsm9ug06RiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:12:21.132900Z","bundle_sha256":"bcea723a5632e2b9adedc513c91a04e8410f9af6828ca3a6eb10515140cb4244"}}