{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AQUY5ZKQAZL6YLLGZ2X3BKEMPX","short_pith_number":"pith:AQUY5ZKQ","canonical_record":{"source":{"id":"1808.09963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T22:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"8f722131f83858270127d30c1352ee4d3764a9f15af5c4f72e04c7707a6427fc","abstract_canon_sha256":"182540f83927e2cb4cd36cbc6e2d2a8fa8cf4c133cf437591bd247d080eaac73"},"schema_version":"1.0"},"canonical_sha256":"04298ee5500657ec2d66ceafb0a88c7dd20d0672924652d844744178b59b2dc7","source":{"kind":"arxiv","id":"1808.09963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09963","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09963v1","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09963","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"pith_short_12","alias_value":"AQUY5ZKQAZL6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQUY5ZKQAZL6YLLG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQUY5ZKQ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AQUY5ZKQAZL6YLLGZ2X3BKEMPX","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T22:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"8f722131f83858270127d30c1352ee4d3764a9f15af5c4f72e04c7707a6427fc","abstract_canon_sha256":"182540f83927e2cb4cd36cbc6e2d2a8fa8cf4c133cf437591bd247d080eaac73"},"schema_version":"1.0"},"canonical_sha256":"04298ee5500657ec2d66ceafb0a88c7dd20d0672924652d844744178b59b2dc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:50.288130Z","signature_b64":"kA5kUlCqNaZYAMRJMsl2fdoTkUfnSk5fiLaXPdwSPX0WpVNEu0q2jyenTzu+AFbiEdGFrbS2PYvd3yrMgPt4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04298ee5500657ec2d66ceafb0a88c7dd20d0672924652d844744178b59b2dc7","last_reissued_at":"2026-05-18T00:06:50.287207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:50.287207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09963","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:06:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70j3OBJoZh1zvHEXSeV1aStFxtLBrX5/+zWH0YqAL6ikf3LItSUywQhuAxejOGSdEl0ilrNbPcvZ+bqlgUXHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:00:12.943034Z"},"content_sha256":"bfdc0b6cdec6d314c811cdbc7632055af1b2e504d59aefcd65d4c7282802063c","schema_version":"1.0","event_id":"sha256:bfdc0b6cdec6d314c811cdbc7632055af1b2e504d59aefcd65d4c7282802063c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AQUY5ZKQAZL6YLLGZ2X3BKEMPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Upper Bounds for Gallai-Ramsey Numbers of Odd Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Bosse, Jingmei Zhang, Zi-Xia Song","submitted_at":"2018-08-29T22:41:16Z","abstract_excerpt":"A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. Given an integer $k\\ge1$ and a graph $H$, the Gallai-Ramsey number $GR_k(H)$ is the least positive integer $n$ such that every Gallai $k$-coloring of the complete graph $K_n$ contains a monochromatic copy of $H$. Gy\\'{a}rf\\'{a}s, S\\'{a}rk\\\"{o}zy, Seb\\H{o} and Selkow proved in 2010 that $GR_k (H) $ is exponential in $k$ if $H$ is not bipartite, linear in $k$ if $H$ is bipartite but not a star, and constant (does n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09963","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:06:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PwpQhuy+yM1w8EnYBHM4WAu67oWSugZ0JhlN3K7a4EsHB5mVBbl/VwADsmdAlPK5Kg36o8hSst/oL5IMPmNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:00:12.943388Z"},"content_sha256":"be0c880c5a199171d9a60c863944cdf8f99b19201b41a32ffd9a476529e20100","schema_version":"1.0","event_id":"sha256:be0c880c5a199171d9a60c863944cdf8f99b19201b41a32ffd9a476529e20100"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX/bundle.json","state_url":"https://pith.science/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX/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-03T04:00:12Z","links":{"resolver":"https://pith.science/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX","bundle":"https://pith.science/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX/bundle.json","state":"https://pith.science/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQUY5ZKQAZL6YLLGZ2X3BKEMPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AQUY5ZKQAZL6YLLGZ2X3BKEMPX","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":"182540f83927e2cb4cd36cbc6e2d2a8fa8cf4c133cf437591bd247d080eaac73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T22:41:16Z","title_canon_sha256":"8f722131f83858270127d30c1352ee4d3764a9f15af5c4f72e04c7707a6427fc"},"schema_version":"1.0","source":{"id":"1808.09963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09963","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09963v1","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09963","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"pith_short_12","alias_value":"AQUY5ZKQAZL6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQUY5ZKQAZL6YLLG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQUY5ZKQ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:be0c880c5a199171d9a60c863944cdf8f99b19201b41a32ffd9a476529e20100","target":"graph","created_at":"2026-05-18T00:06:50Z","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 Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. Given an integer $k\\ge1$ and a graph $H$, the Gallai-Ramsey number $GR_k(H)$ is the least positive integer $n$ such that every Gallai $k$-coloring of the complete graph $K_n$ contains a monochromatic copy of $H$. Gy\\'{a}rf\\'{a}s, S\\'{a}rk\\\"{o}zy, Seb\\H{o} and Selkow proved in 2010 that $GR_k (H) $ is exponential in $k$ if $H$ is not bipartite, linear in $k$ if $H$ is bipartite but not a star, and constant (does n","authors_text":"Christian Bosse, Jingmei Zhang, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T22:41:16Z","title":"Improved Upper Bounds for Gallai-Ramsey Numbers of Odd Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09963","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:bfdc0b6cdec6d314c811cdbc7632055af1b2e504d59aefcd65d4c7282802063c","target":"record","created_at":"2026-05-18T00:06:50Z","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":"182540f83927e2cb4cd36cbc6e2d2a8fa8cf4c133cf437591bd247d080eaac73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T22:41:16Z","title_canon_sha256":"8f722131f83858270127d30c1352ee4d3764a9f15af5c4f72e04c7707a6427fc"},"schema_version":"1.0","source":{"id":"1808.09963","kind":"arxiv","version":1}},"canonical_sha256":"04298ee5500657ec2d66ceafb0a88c7dd20d0672924652d844744178b59b2dc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04298ee5500657ec2d66ceafb0a88c7dd20d0672924652d844744178b59b2dc7","first_computed_at":"2026-05-18T00:06:50.287207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:50.287207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kA5kUlCqNaZYAMRJMsl2fdoTkUfnSk5fiLaXPdwSPX0WpVNEu0q2jyenTzu+AFbiEdGFrbS2PYvd3yrMgPt4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:50.288130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfdc0b6cdec6d314c811cdbc7632055af1b2e504d59aefcd65d4c7282802063c","sha256:be0c880c5a199171d9a60c863944cdf8f99b19201b41a32ffd9a476529e20100"],"state_sha256":"b27c7eac375072485334ccb8631199759ad64c5602a2cb96549cfb327356ccae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwuVP+6WsgsDjvP6jsDK/TpiYq2qeXe6W0lYgCFN/CAS93QCkvtjR7A/dT7JmLY/bzkzouPiRRv6mPCQpvYuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:00:12.945328Z","bundle_sha256":"7ed375e0db7b84788c8ec201e6748ee03e79300795ee093b84e7c2a2deadf558"}}