{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YSUDCEB3MQRSQ2GI6XROMNWVSX","short_pith_number":"pith:YSUDCEB3","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"},"canonical_sha256":"c4a831103b64232868c8f5e2e636d595faa6c8e6459c5a543e6334c453adb011","source":{"kind":"arxiv","id":"2109.09205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09205","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09205v2","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09205","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"YSUDCEB3MQRS","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"YSUDCEB3MQRSQ2GI","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"YSUDCEB3","created_at":"2026-07-05T06:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YSUDCEB3MQRSQ2GI6XROMNWVSX","target":"record","payload":{"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"},"canonical_sha256":"c4a831103b64232868c8f5e2e636d595faa6c8e6459c5a543e6334c453adb011","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"},"source_kind":"arxiv","source_id":"2109.09205","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-07-05T06:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTQGWt4L/BieU/1DTsgO+UbWEg2WBS5Nc7CgO22fEZ+a1DjAz9moQQoBZ5yxnSa53vzcCLXWwpu3ABTt/2wRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:54:44.743142Z"},"content_sha256":"c8662bedb19d03c1b766c9ff22c974290b03e9eb39b6df5b4eeee343c8eee2d7","schema_version":"1.0","event_id":"sha256:c8662bedb19d03c1b766c9ff22c974290b03e9eb39b6df5b4eeee343c8eee2d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YSUDCEB3MQRSQ2GI6XROMNWVSX","target":"graph","payload":{"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"},"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-07-05T06:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGtHEP0aEf3wvKCBNUFkxBB8E9CgUZ2JkwVGdemj812UnYzh7jNptNEEHXqxode9WAf9HSx9hYCPa0eNOZA3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:54:44.743531Z"},"content_sha256":"991a9ca6ce76fcdbf71f7d8d5258544b6811804eedc68755f713dbd87545f468","schema_version":"1.0","event_id":"sha256:991a9ca6ce76fcdbf71f7d8d5258544b6811804eedc68755f713dbd87545f468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/bundle.json","state_url":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/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-07-07T09:54:44Z","links":{"resolver":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX","bundle":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/bundle.json","state":"https://pith.science/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSUDCEB3MQRSQ2GI6XROMNWVSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YSUDCEB3MQRSQ2GI6XROMNWVSX","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":"710c1286fa6c77e05c82eae156a9001d0b904d10b859c69820c682acf5360119","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-19T19:58:11Z","title_canon_sha256":"06578912ba39a07bbd7dc71991966bed16fff4e761c4dd4a68efa27830e40079"},"schema_version":"1.0","source":{"id":"2109.09205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09205","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09205v2","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09205","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"YSUDCEB3MQRS","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"YSUDCEB3MQRSQ2GI","created_at":"2026-07-05T06:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"YSUDCEB3","created_at":"2026-07-05T06:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:991a9ca6ce76fcdbf71f7d8d5258544b6811804eedc68755f713dbd87545f468","target":"graph","created_at":"2026-07-05T06:30:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.09205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jacob Fox, Xiaoyu He, Yuval Wigderson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-19T19:58:11Z","title":"Ramsey goodness of books revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09205","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:c8662bedb19d03c1b766c9ff22c974290b03e9eb39b6df5b4eeee343c8eee2d7","target":"record","created_at":"2026-07-05T06:30:41Z","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":"710c1286fa6c77e05c82eae156a9001d0b904d10b859c69820c682acf5360119","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-19T19:58:11Z","title_canon_sha256":"06578912ba39a07bbd7dc71991966bed16fff4e761c4dd4a68efa27830e40079"},"schema_version":"1.0","source":{"id":"2109.09205","kind":"arxiv","version":2}},"canonical_sha256":"c4a831103b64232868c8f5e2e636d595faa6c8e6459c5a543e6334c453adb011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4a831103b64232868c8f5e2e636d595faa6c8e6459c5a543e6334c453adb011","first_computed_at":"2026-07-05T06:30:41.333350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:30:41.333350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xp8bpt77BVEqxhoi30cGt5I+s1CpQNikiJTPmRG9PDywG06qhL5n6dpcN+KOp72oEO7rQROYoGEofpAeLrKmAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:30:41.333902Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.09205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8662bedb19d03c1b766c9ff22c974290b03e9eb39b6df5b4eeee343c8eee2d7","sha256:991a9ca6ce76fcdbf71f7d8d5258544b6811804eedc68755f713dbd87545f468"],"state_sha256":"58cc098eeafcdc42cbde3d2b589a5d431d077b1cc1e4ca93e70339c2f0094d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qr9njymHjrD2fu37m8Q66gasSKtZY2QR0jQt88rWcpwTgw7+4HV4h8Dqi8eJkGD4W9I0YE7dGJFC/IrpdR5XDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:54:44.745440Z","bundle_sha256":"20c8dc9d34ac2d3e05d74b851cfc21075740e56423417e150b01fd448ef4dfcd"}}