{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LOOB65TUYF5LU2M2CTFTSUFQN2","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":"1a4f5b7bf85de90ef36f0aaf307cbc8fce4f29b96cff65c9ed5d400d83307757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-08T20:53:38Z","title_canon_sha256":"28cb3debbd8e7f0c9002292a8a5a93967ccd8596e309c8dcc5d16f934188720e"},"schema_version":"1.0","source":{"id":"1611.02688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02688","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02688v1","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02688","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"pith_short_12","alias_value":"LOOB65TUYF5L","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LOOB65TUYF5LU2M2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LOOB65TU","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:3290fe2b2671992462c8f28c4d2d93303f1f27df1e34394d8782edcd9e33bb9c","target":"graph","created_at":"2026-05-18T00:59: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":"Given a pair of graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest $N$ such that every red-blue coloring of the edges of the complete graph $K_N$ contains a red copy of $G$ or a blue copy of $H$. If a graph $G$ is connected, it is well known and easy to show that $R(G,H) \\geq (|G|-1)(\\chi(H)-1)+\\sigma(H)$, where $\\chi(H)$ is the chromatic number of $H$ and $\\sigma(H)$ is the size of the smallest color class in a $\\chi(H)$-coloring of $H$. A graph $G$ is called $H$-good if $R(G,H)= (|G|-1)(\\chi(H)-1)+\\sigma(H)$. The notion of Ramsey goodness was introduced by Burr and Erd\\H{o}s in 1","authors_text":"Alexey Pokrovskiy, Benny Sudakov, Igor Balla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-08T20:53:38Z","title":"Ramsey goodness of bounded degree trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02688","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:4a64a34fffe85ecede00183ba503b068ec0fbee1d3dbba2eeee3f6b13ead5bb0","target":"record","created_at":"2026-05-18T00:59: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":"1a4f5b7bf85de90ef36f0aaf307cbc8fce4f29b96cff65c9ed5d400d83307757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-08T20:53:38Z","title_canon_sha256":"28cb3debbd8e7f0c9002292a8a5a93967ccd8596e309c8dcc5d16f934188720e"},"schema_version":"1.0","source":{"id":"1611.02688","kind":"arxiv","version":1}},"canonical_sha256":"5b9c1f7674c17aba699a14cb3950b06eb62399f17a1d734614578db202bf748c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b9c1f7674c17aba699a14cb3950b06eb62399f17a1d734614578db202bf748c","first_computed_at":"2026-05-18T00:59:51.192451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:51.192451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5WS1nG0ICOw6LYipkhoU1Zy0yb99SlPIUlVn76FY6kjeTDE58VFp8hBG424MZZTehbgxrDZROoAUoqNijrEyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:51.193014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a64a34fffe85ecede00183ba503b068ec0fbee1d3dbba2eeee3f6b13ead5bb0","sha256:3290fe2b2671992462c8f28c4d2d93303f1f27df1e34394d8782edcd9e33bb9c"],"state_sha256":"dd6e9da36060aabbbc651580e5c98a4c0f1e703d815945e2cca41cffb1f7e86c"}