{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:J2MI4NZ3YBSGGR7SQED4GIOJ6C","short_pith_number":"pith:J2MI4NZ3","canonical_record":{"source":{"id":"2507.09827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"e723d437edfe31d1eee6f6137332e8e80115c4bbff29820aae28a97b748a8673","abstract_canon_sha256":"c37c1b3ca2fa1de6ec281496cf049f503fef9b3efd08c7b518a9d0f4ec4b6ceb"},"schema_version":"1.0"},"canonical_sha256":"4e988e373bc0646347f28107c321c9f0ab5006a72da39d1293468b43c428ce8e","source":{"kind":"arxiv","id":"2507.09827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09827","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09827v1","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09827","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_12","alias_value":"J2MI4NZ3YBSG","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_16","alias_value":"J2MI4NZ3YBSGGR7S","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_8","alias_value":"J2MI4NZ3","created_at":"2026-07-05T11:36:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:J2MI4NZ3YBSGGR7SQED4GIOJ6C","target":"record","payload":{"canonical_record":{"source":{"id":"2507.09827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"e723d437edfe31d1eee6f6137332e8e80115c4bbff29820aae28a97b748a8673","abstract_canon_sha256":"c37c1b3ca2fa1de6ec281496cf049f503fef9b3efd08c7b518a9d0f4ec4b6ceb"},"schema_version":"1.0"},"canonical_sha256":"4e988e373bc0646347f28107c321c9f0ab5006a72da39d1293468b43c428ce8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:40.376893Z","signature_b64":"MN4Uhl46QQ9My56pAnRFsWj98m0JFF3WTq8ww3+p75UZ++1yyPnyxa2ZHhY1m3BIockdzI03rKhvbkeGwJHOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e988e373bc0646347f28107c321c9f0ab5006a72da39d1293468b43c428ce8e","last_reissued_at":"2026-07-05T11:36:40.376342Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:40.376342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.09827","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-07-05T11:36:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sRY+Yb3iU0Xvi/p6kJSQAz9Ywk0jyjjD3dA3EKm5JKbRV9XLIR74gFGmXaspTPwnCQ8RHUWIwFiaV+1Cq7oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:37:41.687877Z"},"content_sha256":"7c927bc56313a6c0955e92d5d7afdf448d93bb89ea876366eb88683fa1269b4d","schema_version":"1.0","event_id":"sha256:7c927bc56313a6c0955e92d5d7afdf448d93bb89ea876366eb88683fa1269b4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:J2MI4NZ3YBSGGR7SQED4GIOJ6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey numbers of sparse graphs versus disjoint books","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ting Huang, Yanbo Zhang, Yaojun Chen","submitted_at":"2025-07-13T23:36:48Z","abstract_excerpt":"Let $B_k$ denote a book on $k+2$ vertices and $tB_k$ be $t$ vertex-disjoint $B_k$'s. Let $G$ be a connected graph with $n$ vertices and at most $n(1+\\epsilon)$ edges, where $\\epsilon$ is a constant depending on $k$ and $t$. In this paper, we show that the Ramsey number $$r(G,tB_k)=2n+t-2$$ provided $n\\ge 111t^3k^3$. Our result extends the work of Erd\\H{o}s, Faudree, Rousseau, and Schelp (1988), who established the corresponding result for $G$ being a tree and $t=1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09827","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.09827/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-05T11:36:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tdepz/aMor6qNRSOhB+SJpPmzpNkQfHCylnycU+d90vmdfOOLNKqL1wwG7oV80a3MuLyC4knsmFO3X8PiMkaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:37:41.689086Z"},"content_sha256":"06c17bd51d61b9ccf8ff43d637f7d06e1402197cfbf7572db05298a457486a84","schema_version":"1.0","event_id":"sha256:06c17bd51d61b9ccf8ff43d637f7d06e1402197cfbf7572db05298a457486a84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C/bundle.json","state_url":"https://pith.science/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C/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-08-11T19:37:41Z","links":{"resolver":"https://pith.science/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C","bundle":"https://pith.science/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C/bundle.json","state":"https://pith.science/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2MI4NZ3YBSGGR7SQED4GIOJ6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:J2MI4NZ3YBSGGR7SQED4GIOJ6C","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":"c37c1b3ca2fa1de6ec281496cf049f503fef9b3efd08c7b518a9d0f4ec4b6ceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:36:48Z","title_canon_sha256":"e723d437edfe31d1eee6f6137332e8e80115c4bbff29820aae28a97b748a8673"},"schema_version":"1.0","source":{"id":"2507.09827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09827","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09827v1","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09827","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_12","alias_value":"J2MI4NZ3YBSG","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_16","alias_value":"J2MI4NZ3YBSGGR7S","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_8","alias_value":"J2MI4NZ3","created_at":"2026-07-05T11:36:40Z"}],"graph_snapshots":[{"event_id":"sha256:06c17bd51d61b9ccf8ff43d637f7d06e1402197cfbf7572db05298a457486a84","target":"graph","created_at":"2026-07-05T11:36:40Z","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/2507.09827/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $B_k$ denote a book on $k+2$ vertices and $tB_k$ be $t$ vertex-disjoint $B_k$'s. Let $G$ be a connected graph with $n$ vertices and at most $n(1+\\epsilon)$ edges, where $\\epsilon$ is a constant depending on $k$ and $t$. In this paper, we show that the Ramsey number $$r(G,tB_k)=2n+t-2$$ provided $n\\ge 111t^3k^3$. Our result extends the work of Erd\\H{o}s, Faudree, Rousseau, and Schelp (1988), who established the corresponding result for $G$ being a tree and $t=1$.","authors_text":"Ting Huang, Yanbo Zhang, Yaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:36:48Z","title":"Ramsey numbers of sparse graphs versus disjoint books"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09827","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:7c927bc56313a6c0955e92d5d7afdf448d93bb89ea876366eb88683fa1269b4d","target":"record","created_at":"2026-07-05T11:36:40Z","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":"c37c1b3ca2fa1de6ec281496cf049f503fef9b3efd08c7b518a9d0f4ec4b6ceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:36:48Z","title_canon_sha256":"e723d437edfe31d1eee6f6137332e8e80115c4bbff29820aae28a97b748a8673"},"schema_version":"1.0","source":{"id":"2507.09827","kind":"arxiv","version":1}},"canonical_sha256":"4e988e373bc0646347f28107c321c9f0ab5006a72da39d1293468b43c428ce8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e988e373bc0646347f28107c321c9f0ab5006a72da39d1293468b43c428ce8e","first_computed_at":"2026-07-05T11:36:40.376342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:40.376342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MN4Uhl46QQ9My56pAnRFsWj98m0JFF3WTq8ww3+p75UZ++1yyPnyxa2ZHhY1m3BIockdzI03rKhvbkeGwJHOAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:40.376893Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c927bc56313a6c0955e92d5d7afdf448d93bb89ea876366eb88683fa1269b4d","sha256:06c17bd51d61b9ccf8ff43d637f7d06e1402197cfbf7572db05298a457486a84"],"state_sha256":"669968f9e05c04f85829921927875a71f5120f1243e340ddaec8ac31b88f0a0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwqXH6cjd67BcxrRdGLzXVe3LkIi8ZQ1/CkxopULDPeKEAHBrJpzGNUgHc7y8fMswIxjsVvJydpTKVgzyI+3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:37:41.698576Z","bundle_sha256":"b8f0c40adf2e14745d53c0b9d46bb652d39d45071bcb6d45ee08082d3e576f9d"}}