{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CAQMYG2E42XY6L5L4W4CCYECBL","short_pith_number":"pith:CAQMYG2E","schema_version":"1.0","canonical_sha256":"1020cc1b44e6af8f2fabe5b82160820ac00c2cb7eff357b39419a8ae324c0780","source":{"kind":"arxiv","id":"2502.09830","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.09830","created_at":"2026-07-05T10:14:13.022060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09830v1","created_at":"2026-07-05T10:14:13.022060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09830","created_at":"2026-07-05T10:14:13.022060+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAQMYG2E42XY","created_at":"2026-07-05T10:14:13.022060+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAQMYG2E42XY6L5L","created_at":"2026-07-05T10:14:13.022060+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAQMYG2E","created_at":"2026-07-05T10:14:13.022060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05641","citing_title":"Off-Diagonal Ramsey Numbers for Linear Hypergraphs","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL","json":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL.json","graph_json":"https://pith.science/api/pith-number/CAQMYG2E42XY6L5L4W4CCYECBL/graph.json","events_json":"https://pith.science/api/pith-number/CAQMYG2E42XY6L5L4W4CCYECBL/events.json","paper":"https://pith.science/paper/CAQMYG2E"},"agent_actions":{"view_html":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL","download_json":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL.json","view_paper":"https://pith.science/paper/CAQMYG2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09830&json=true","fetch_graph":"https://pith.science/api/pith-number/CAQMYG2E42XY6L5L4W4CCYECBL/graph.json","fetch_events":"https://pith.science/api/pith-number/CAQMYG2E42XY6L5L4W4CCYECBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/action/storage_attestation","attest_author":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/action/author_attestation","sign_citation":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/action/citation_signature","submit_replication":"https://pith.science/pith/CAQMYG2E42XY6L5L4W4CCYECBL/action/replication_record"}},"created_at":"2026-07-05T10:14:13.022060+00:00","updated_at":"2026-07-05T10:14:13.022060+00:00"}