{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZR6MMDUH2RDNZ7WMNK4HXLBATH","short_pith_number":"pith:ZR6MMDUH","schema_version":"1.0","canonical_sha256":"cc7cc60e87d446dcfecc6ab87bac2099d2a73caa5e1bf67c1354a167f165de9b","source":{"kind":"arxiv","id":"2507.01498","version":1},"attestation_state":"computed","paper":{"title":"Size-Ramsey numbers of tight paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Liana Yepremyan, Shoham Letzter","submitted_at":"2025-07-02T09:03:04Z","abstract_excerpt":"The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $r$-uniform tight path on $n$ vertices is linear in $n$, for every fixed $r$ and $s$, thereby answering a question of Dudek, La Fleur, Mubayi and R\\\"odl (2017)."},"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":"2507.01498","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-02T09:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"0d85040ca27cdbee5c8d72612bbc29849d4ad08ae376c790bde4107fe8635237","abstract_canon_sha256":"51450d194ccc5c5c12bd9baed467e827e79ab4cb4c273c49e2793b416770e1df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:49.953058Z","signature_b64":"M5Vk6PD5GIqIqBZILnqK7IfPcRlfdFDMNhYtS33WBD3ThRohVnVEcSjLu/0PjlvsiJFfGyAh1X1NYHOjlmLKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7cc60e87d446dcfecc6ab87bac2099d2a73caa5e1bf67c1354a167f165de9b","last_reissued_at":"2026-07-05T11:30:49.952574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:49.952574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Size-Ramsey numbers of tight paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Liana Yepremyan, Shoham Letzter","submitted_at":"2025-07-02T09:03:04Z","abstract_excerpt":"The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $r$-uniform tight path on $n$ vertices is linear in $n$, for every fixed $r$ and $s$, thereby answering a question of Dudek, La Fleur, Mubayi and R\\\"odl (2017)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01498","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.01498/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":"2507.01498","created_at":"2026-07-05T11:30:49.952632+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01498v1","created_at":"2026-07-05T11:30:49.952632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01498","created_at":"2026-07-05T11:30:49.952632+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZR6MMDUH2RDN","created_at":"2026-07-05T11:30:49.952632+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZR6MMDUH2RDNZ7WM","created_at":"2026-07-05T11:30:49.952632+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZR6MMDUH","created_at":"2026-07-05T11:30:49.952632+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/ZR6MMDUH2RDNZ7WMNK4HXLBATH","json":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH.json","graph_json":"https://pith.science/api/pith-number/ZR6MMDUH2RDNZ7WMNK4HXLBATH/graph.json","events_json":"https://pith.science/api/pith-number/ZR6MMDUH2RDNZ7WMNK4HXLBATH/events.json","paper":"https://pith.science/paper/ZR6MMDUH"},"agent_actions":{"view_html":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH","download_json":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH.json","view_paper":"https://pith.science/paper/ZR6MMDUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01498&json=true","fetch_graph":"https://pith.science/api/pith-number/ZR6MMDUH2RDNZ7WMNK4HXLBATH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZR6MMDUH2RDNZ7WMNK4HXLBATH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH/action/storage_attestation","attest_author":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH/action/author_attestation","sign_citation":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH/action/citation_signature","submit_replication":"https://pith.science/pith/ZR6MMDUH2RDNZ7WMNK4HXLBATH/action/replication_record"}},"created_at":"2026-07-05T11:30:49.952632+00:00","updated_at":"2026-07-05T11:30:49.952632+00:00"}