{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YSUDCEB3MQRSQ2GI6XROMNWVSX","short_pith_number":"pith:YSUDCEB3","schema_version":"1.0","canonical_sha256":"c4a831103b64232868c8f5e2e636d595faa6c8e6459c5a543e6334c453adb011","source":{"kind":"arxiv","id":"2109.09205","version":2},"attestation_state":"computed","paper":{"title":"Ramsey goodness of books revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Xiaoyu He, Yuval Wigderson","submitted_at":"2021-09-19T19:58:11Z","abstract_excerpt":"The Ramsey number $r(G,H)$ is the minimum $N$ such that every graph on $N$ vertices contains $G$ as a subgraph or its complement contains $H$ as a subgraph. For integers $n \\geq k \\geq 1$, the $k$-book $B_{k,n}$ is the graph on $n$ vertices consisting of a copy of $K_k$, called the spine, as well as $n-k$ additional vertices each adjacent to every vertex of the spine and non-adjacent to each other. A connected graph $H$ on $n$ vertices is called $p$-good if $r(K_p,H)=(p-1)(n-1)+1$. Nikiforov and Rousseau proved that if $n$ is sufficiently large in terms of $p$ and $k$, then $B_{k,n}$ is $p$-go"},"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":"2109.09205","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-19T19:58:11Z","cross_cats_sorted":[],"title_canon_sha256":"06578912ba39a07bbd7dc71991966bed16fff4e761c4dd4a68efa27830e40079","abstract_canon_sha256":"710c1286fa6c77e05c82eae156a9001d0b904d10b859c69820c682acf5360119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:41.333902Z","signature_b64":"xp8bpt77BVEqxhoi30cGt5I+s1CpQNikiJTPmRG9PDywG06qhL5n6dpcN+KOp72oEO7rQROYoGEofpAeLrKmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4a831103b64232868c8f5e2e636d595faa6c8e6459c5a543e6334c453adb011","last_reissued_at":"2026-07-05T06:30:41.333350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:41.333350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey goodness of books revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Xiaoyu He, Yuval Wigderson","submitted_at":"2021-09-19T19:58:11Z","abstract_excerpt":"The Ramsey number $r(G,H)$ is the minimum $N$ such that every graph on $N$ vertices contains $G$ as a subgraph or its complement contains $H$ as a subgraph. For integers $n \\geq k \\geq 1$, the $k$-book $B_{k,n}$ is the graph on $n$ vertices consisting of a copy of $K_k$, called the spine, as well as $n-k$ additional vertices each adjacent to every vertex of the spine and non-adjacent to each other. A connected graph $H$ on $n$ vertices is called $p$-good if $r(K_p,H)=(p-1)(n-1)+1$. Nikiforov and Rousseau proved that if $n$ is sufficiently large in terms of $p$ and $k$, then $B_{k,n}$ is $p$-go"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.09205/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.09205","created_at":"2026-07-05T06:30:41.333420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09205v2","created_at":"2026-07-05T06:30:41.333420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09205","created_at":"2026-07-05T06:30:41.333420+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSUDCEB3MQRS","created_at":"2026-07-05T06:30:41.333420+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSUDCEB3MQRSQ2GI","created_at":"2026-07-05T06:30:41.333420+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSUDCEB3","created_at":"2026-07-05T06:30:41.333420+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/YSUDCEB3MQRSQ2GI6XROMNWVSX","json":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX.json","graph_json":"https://pith.science/api/pith-number/YSUDCEB3MQRSQ2GI6XROMNWVSX/graph.json","events_json":"https://pith.science/api/pith-number/YSUDCEB3MQRSQ2GI6XROMNWVSX/events.json","paper":"https://pith.science/paper/YSUDCEB3"},"agent_actions":{"view_html":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX","download_json":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX.json","view_paper":"https://pith.science/paper/YSUDCEB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09205&json=true","fetch_graph":"https://pith.science/api/pith-number/YSUDCEB3MQRSQ2GI6XROMNWVSX/graph.json","fetch_events":"https://pith.science/api/pith-number/YSUDCEB3MQRSQ2GI6XROMNWVSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/action/storage_attestation","attest_author":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/action/author_attestation","sign_citation":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/action/citation_signature","submit_replication":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/action/replication_record"}},"created_at":"2026-07-05T06:30:41.333420+00:00","updated_at":"2026-07-05T06:30:41.333420+00:00"}