{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D7YDT5VAFFPDLDF5LBNQ2I6JHU","short_pith_number":"pith:D7YDT5VA","schema_version":"1.0","canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","source":{"kind":"arxiv","id":"1712.03247","version":1},"attestation_state":"computed","paper":{"title":"On the size-Ramsey number of tight paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Zhiyu Wang","submitted_at":"2017-12-08T19:04:15Z","abstract_excerpt":"For any $r\\geq 2$ and $k\\geq 3$, the $r$-color size-Ramsey number $\\hat R(\\mathcal{G},r)$ of a $k$-uniform hypergraph $\\mathcal{G}$ is the smallest integer $m$ such that there exists a $k$-uniform hypergraph $\\mathcal{H}$ on $m$ edges such that any coloring of the edges of $\\mathcal{H}$ with $r$ colors yields a monochromatic copy of $\\mathcal{G}$. Let $\\mathcal{P}_{n,k-1}^{(k)}$ denote the $k$-uniform tight path on $n$ vertices. Dudek, Fleur, Mubayi and R\\H{o}dl showed that the size-Ramsey number of tight paths $\\hat R(\\mathcal{P}_{n,k-1}^{(k)}, 2) = O(n^{k-1-\\alpha} (\\log n)^{1+\\alpha})$ wher"},"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":"1712.03247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T19:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"6f2db9138fa74fa494ac48696d785e9112fac5479600279ab06ebf9e7ca7a17f","abstract_canon_sha256":"d1b55cab0b5fd5d38b8c844ec8ab653d0d48605080a8054531507fa99d8468ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:21.893908Z","signature_b64":"dzLk7Hew7pyn7QKyXJ9ZlgEHuoy35ag6u5cxeDZzD8cEiZ747Ay5N2isSGUk/kqcL53F3dq5IgwuybYAxlBqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","last_reissued_at":"2026-05-18T00:28:21.893243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:21.893243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the size-Ramsey number of tight paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Zhiyu Wang","submitted_at":"2017-12-08T19:04:15Z","abstract_excerpt":"For any $r\\geq 2$ and $k\\geq 3$, the $r$-color size-Ramsey number $\\hat R(\\mathcal{G},r)$ of a $k$-uniform hypergraph $\\mathcal{G}$ is the smallest integer $m$ such that there exists a $k$-uniform hypergraph $\\mathcal{H}$ on $m$ edges such that any coloring of the edges of $\\mathcal{H}$ with $r$ colors yields a monochromatic copy of $\\mathcal{G}$. Let $\\mathcal{P}_{n,k-1}^{(k)}$ denote the $k$-uniform tight path on $n$ vertices. Dudek, Fleur, Mubayi and R\\H{o}dl showed that the size-Ramsey number of tight paths $\\hat R(\\mathcal{P}_{n,k-1}^{(k)}, 2) = O(n^{k-1-\\alpha} (\\log n)^{1+\\alpha})$ wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03247","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":""},"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":"1712.03247","created_at":"2026-05-18T00:28:21.893352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03247v1","created_at":"2026-05-18T00:28:21.893352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03247","created_at":"2026-05-18T00:28:21.893352+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7YDT5VAFFPD","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7YDT5VAFFPDLDF5","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7YDT5VA","created_at":"2026-05-18T12:31:10.602751+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/D7YDT5VAFFPDLDF5LBNQ2I6JHU","json":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU.json","graph_json":"https://pith.science/api/pith-number/D7YDT5VAFFPDLDF5LBNQ2I6JHU/graph.json","events_json":"https://pith.science/api/pith-number/D7YDT5VAFFPDLDF5LBNQ2I6JHU/events.json","paper":"https://pith.science/paper/D7YDT5VA"},"agent_actions":{"view_html":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU","download_json":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU.json","view_paper":"https://pith.science/paper/D7YDT5VA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03247&json=true","fetch_graph":"https://pith.science/api/pith-number/D7YDT5VAFFPDLDF5LBNQ2I6JHU/graph.json","fetch_events":"https://pith.science/api/pith-number/D7YDT5VAFFPDLDF5LBNQ2I6JHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/action/storage_attestation","attest_author":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/action/author_attestation","sign_citation":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/action/citation_signature","submit_replication":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/action/replication_record"}},"created_at":"2026-05-18T00:28:21.893352+00:00","updated_at":"2026-05-18T00:28:21.893352+00:00"}