{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N6Q2IUBRARZWQMMLA2O2MJOOLP","short_pith_number":"pith:N6Q2IUBR","schema_version":"1.0","canonical_sha256":"6fa1a45031047368318b069da625ce5be224729169ce8596ac48e08b338ccb75","source":{"kind":"arxiv","id":"2307.12028","version":2},"attestation_state":"computed","paper":{"title":"Size-Ramsey numbers of structurally sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Munh\\'a Correia, Kalina Petrova, Marc Kaufmann, Nemanja Dragani\\'c, Raphael Steiner","submitted_at":"2023-07-22T09:19:30Z","abstract_excerpt":"Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs with constant maximum degree $\\Delta$. For example, graphs which also have constant treewidth are known to have linear size-Ramsey numbers. On the other extreme, the canonical examples of graphs of unbounded treewidth are the grid graphs, for which the best known bound has only very recently been improved from $O(n^{3/2})$ to $O(n^{5/4})$ by Conlon, Nenadov "},"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":"2307.12028","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-22T09:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"029475f929f224fc87be88ad818b8905aae40519585e8534d55234ba9379ef37","abstract_canon_sha256":"76746fba471c9246d64875daf97d4cad7c1430b98d3c6632ca4a979210963e0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:25.185809Z","signature_b64":"YjzApFqic1Y3lKA8u0TezG90BYBPr6sSOYRqWJW8uJvdULh5tfNnIMNZtZXA8qn5RJibFq+Lvr2yVlw8sI69CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa1a45031047368318b069da625ce5be224729169ce8596ac48e08b338ccb75","last_reissued_at":"2026-07-05T06:47:25.185343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:25.185343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Size-Ramsey numbers of structurally sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Munh\\'a Correia, Kalina Petrova, Marc Kaufmann, Nemanja Dragani\\'c, Raphael Steiner","submitted_at":"2023-07-22T09:19:30Z","abstract_excerpt":"Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs with constant maximum degree $\\Delta$. For example, graphs which also have constant treewidth are known to have linear size-Ramsey numbers. On the other extreme, the canonical examples of graphs of unbounded treewidth are the grid graphs, for which the best known bound has only very recently been improved from $O(n^{3/2})$ to $O(n^{5/4})$ by Conlon, Nenadov "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12028","kind":"arxiv","version":2},"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/2307.12028/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":"2307.12028","created_at":"2026-07-05T06:47:25.185400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.12028v2","created_at":"2026-07-05T06:47:25.185400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12028","created_at":"2026-07-05T06:47:25.185400+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6Q2IUBRARZW","created_at":"2026-07-05T06:47:25.185400+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6Q2IUBRARZWQMML","created_at":"2026-07-05T06:47:25.185400+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6Q2IUBR","created_at":"2026-07-05T06:47:25.185400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27780","citing_title":"Tree-partitions of graphs with given pathwidth","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2509.01140","citing_title":"Tree decompositions with small width, spread, order and degree","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05690","citing_title":"Tree-partitions and small-spread tree-decompositions","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP","json":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP.json","graph_json":"https://pith.science/api/pith-number/N6Q2IUBRARZWQMMLA2O2MJOOLP/graph.json","events_json":"https://pith.science/api/pith-number/N6Q2IUBRARZWQMMLA2O2MJOOLP/events.json","paper":"https://pith.science/paper/N6Q2IUBR"},"agent_actions":{"view_html":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP","download_json":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP.json","view_paper":"https://pith.science/paper/N6Q2IUBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.12028&json=true","fetch_graph":"https://pith.science/api/pith-number/N6Q2IUBRARZWQMMLA2O2MJOOLP/graph.json","fetch_events":"https://pith.science/api/pith-number/N6Q2IUBRARZWQMMLA2O2MJOOLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP/action/storage_attestation","attest_author":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP/action/author_attestation","sign_citation":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP/action/citation_signature","submit_replication":"https://pith.science/pith/N6Q2IUBRARZWQMMLA2O2MJOOLP/action/replication_record"}},"created_at":"2026-07-05T06:47:25.185400+00:00","updated_at":"2026-07-05T06:47:25.185400+00:00"}