{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CAQMYG2E42XY6L5L4W4CCYECBL","short_pith_number":"pith:CAQMYG2E","canonical_record":{"source":{"id":"2502.09830","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-14T00:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"84ff4663b004b4baec728dae570b4cc896c8aec949ce341be18140eeee2accc7","abstract_canon_sha256":"5b3b954dc9dc95f910fdc6feb501b3b668fd6413e0027f0bcf8520d7decd179b"},"schema_version":"1.0"},"canonical_sha256":"1020cc1b44e6af8f2fabe5b82160820ac00c2cb7eff357b39419a8ae324c0780","source":{"kind":"arxiv","id":"2502.09830","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09830","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09830v1","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09830","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"pith_short_12","alias_value":"CAQMYG2E42XY","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"pith_short_16","alias_value":"CAQMYG2E42XY6L5L","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"pith_short_8","alias_value":"CAQMYG2E","created_at":"2026-07-05T10:14:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CAQMYG2E42XY6L5L4W4CCYECBL","target":"record","payload":{"canonical_record":{"source":{"id":"2502.09830","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-14T00:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"84ff4663b004b4baec728dae570b4cc896c8aec949ce341be18140eeee2accc7","abstract_canon_sha256":"5b3b954dc9dc95f910fdc6feb501b3b668fd6413e0027f0bcf8520d7decd179b"},"schema_version":"1.0"},"canonical_sha256":"1020cc1b44e6af8f2fabe5b82160820ac00c2cb7eff357b39419a8ae324c0780","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:13.022504Z","signature_b64":"Kdwx8H5s9Db64qsst3EUsddc7sziBHek8zWxSGgytW44Z07AzY08D/B8LXB9+MNreskN3yU43l6D1KsQ6brACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1020cc1b44e6af8f2fabe5b82160820ac00c2cb7eff357b39419a8ae324c0780","last_reissued_at":"2026-07-05T10:14:13.022001Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:13.022001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.09830","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-05T10:14:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8snY0CJO4EDEzY6u01hPtQoaRYMK3eZfsDe5vDPvpf4zxt61NyT7sMrtzdnPhUR6Z9DsqKcwPtjS+VOimA0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:51:33.441693Z"},"content_sha256":"b298d886045fb73b4893aeb13ed51f693ea5c165b8c956daca572dd65374ef62","schema_version":"1.0","event_id":"sha256:b298d886045fb73b4893aeb13ed51f693ea5c165b8c956daca572dd65374ef62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CAQMYG2E42XY6L5L4W4CCYECBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unavoidable subgraphs in Ramsey graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2025-02-14T00:07:22Z","abstract_excerpt":"We study subgraphs that appear in large Ramsey graphs for a given graph $F$. The recent girth Ramsey theorem of the first two authors asserts that there are Ramsey graphs such that all small subgraphs are `forests of copies of $F$' amalgamated on vertices and edges. We derive a few further consequences from this structural result and investigate to which extent such forests of copies must be present in Ramsey graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09830","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/2502.09830/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-05T10:14:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iECU2LXOvduyve0gnjCKbngp/JAPiewYyw3b2gq2UowIm+sJdzanHsTi3jAIqN64PSBpjQmK2fJuMYEVgxr5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:51:33.442198Z"},"content_sha256":"6857c49be672f7c2d869169c971bbef9b93e572948fb745ce1639b5a78df9b54","schema_version":"1.0","event_id":"sha256:6857c49be672f7c2d869169c971bbef9b93e572948fb745ce1639b5a78df9b54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/bundle.json","state_url":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAQMYG2E42XY6L5L4W4CCYECBL/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-12T15:51:33Z","links":{"resolver":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL","bundle":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/bundle.json","state":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAQMYG2E42XY6L5L4W4CCYECBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CAQMYG2E42XY6L5L4W4CCYECBL","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":"5b3b954dc9dc95f910fdc6feb501b3b668fd6413e0027f0bcf8520d7decd179b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-14T00:07:22Z","title_canon_sha256":"84ff4663b004b4baec728dae570b4cc896c8aec949ce341be18140eeee2accc7"},"schema_version":"1.0","source":{"id":"2502.09830","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09830","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09830v1","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09830","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"pith_short_12","alias_value":"CAQMYG2E42XY","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"pith_short_16","alias_value":"CAQMYG2E42XY6L5L","created_at":"2026-07-05T10:14:13Z"},{"alias_kind":"pith_short_8","alias_value":"CAQMYG2E","created_at":"2026-07-05T10:14:13Z"}],"graph_snapshots":[{"event_id":"sha256:6857c49be672f7c2d869169c971bbef9b93e572948fb745ce1639b5a78df9b54","target":"graph","created_at":"2026-07-05T10:14:13Z","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/2502.09830/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study subgraphs that appear in large Ramsey graphs for a given graph $F$. The recent girth Ramsey theorem of the first two authors asserts that there are Ramsey graphs such that all small subgraphs are `forests of copies of $F$' amalgamated on vertices and edges. We derive a few further consequences from this structural result and investigate to which extent such forests of copies must be present in Ramsey graphs.","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-14T00:07:22Z","title":"Unavoidable subgraphs in Ramsey graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09830","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:b298d886045fb73b4893aeb13ed51f693ea5c165b8c956daca572dd65374ef62","target":"record","created_at":"2026-07-05T10:14:13Z","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":"5b3b954dc9dc95f910fdc6feb501b3b668fd6413e0027f0bcf8520d7decd179b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-14T00:07:22Z","title_canon_sha256":"84ff4663b004b4baec728dae570b4cc896c8aec949ce341be18140eeee2accc7"},"schema_version":"1.0","source":{"id":"2502.09830","kind":"arxiv","version":1}},"canonical_sha256":"1020cc1b44e6af8f2fabe5b82160820ac00c2cb7eff357b39419a8ae324c0780","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1020cc1b44e6af8f2fabe5b82160820ac00c2cb7eff357b39419a8ae324c0780","first_computed_at":"2026-07-05T10:14:13.022001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:13.022001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kdwx8H5s9Db64qsst3EUsddc7sziBHek8zWxSGgytW44Z07AzY08D/B8LXB9+MNreskN3yU43l6D1KsQ6brACQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:13.022504Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.09830","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b298d886045fb73b4893aeb13ed51f693ea5c165b8c956daca572dd65374ef62","sha256:6857c49be672f7c2d869169c971bbef9b93e572948fb745ce1639b5a78df9b54"],"state_sha256":"dd813480794381e74344abe57bc90a64dc5bd27fa83189d0c28a3cd7ede95f52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sazzawcTlFDQUh/kCnYrQGX5I4K7Rc98+k/8s3ZDcmRYvz4AMIy26GdcKIStfaf/4+uV0AWD6lcyE6qsXC0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:51:33.447227Z","bundle_sha256":"d0f52a9b37c4215075943eb4d867b934e38ed4cdc33f13380232db90de507e35"}}