{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GJQHBJM3L2CO2S7TDFUU6PCINF","short_pith_number":"pith:GJQHBJM3","schema_version":"1.0","canonical_sha256":"326070a59b5e84ed4bf319694f3c486979660feb87bae06f651d301deb3b4a36","source":{"kind":"arxiv","id":"1307.0843","version":2},"attestation_state":"computed","paper":{"title":"New bounds for the distance Ramsey number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Raigorodskii, Andrey Kupavskii, Maria Titova","submitted_at":"2013-07-02T20:48:06Z","abstract_excerpt":"In this paper we study the distance Ramsey number $R_{{\\it D}}(s,t,d)$. The \\textit{distance Ramsey number} $R_{{\\it D}}(s,t,d) $ is the minimum number $n$ such that for any graph $ G $ on $ n $ vertices, either $G$ contains an induced $ s $-vertex subgraph isomorphic to a distance graph in $ \\Real^d $ or $ \\bar {G} $ contains an induced $ t $-vertex subgraph isomorphic to the distance graph in $ \\Real^d $. We obtain the upper and lower bounds on $R_{{\\it D}}(s,s,d),$ which are similar to the bounds for the classical Ramsey number $R(\\lceil \\frac{s}{[d/2]} \\rceil, \\lceil \\frac{s}{[d/2]} \\rceil"},"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":"1307.0843","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-02T20:48:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4a9226e294dc8f287ec873df7e91859433a8782ca218a616cca64b6691b730d","abstract_canon_sha256":"6eeeb11cd751f69a95820c9c88711412365d3848a00e24eaab07319d2fde3814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:16.004530Z","signature_b64":"2nqtAYlmbgMfe3zt7Uksu344KXYK8avrYdo84X8DMM09vlG4HzPFmfJ7sidGJ6AMQOlwcIpMPliN3oqsFxzRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"326070a59b5e84ed4bf319694f3c486979660feb87bae06f651d301deb3b4a36","last_reissued_at":"2026-05-18T00:29:16.003883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:16.003883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for the distance Ramsey number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Raigorodskii, Andrey Kupavskii, Maria Titova","submitted_at":"2013-07-02T20:48:06Z","abstract_excerpt":"In this paper we study the distance Ramsey number $R_{{\\it D}}(s,t,d)$. The \\textit{distance Ramsey number} $R_{{\\it D}}(s,t,d) $ is the minimum number $n$ such that for any graph $ G $ on $ n $ vertices, either $G$ contains an induced $ s $-vertex subgraph isomorphic to a distance graph in $ \\Real^d $ or $ \\bar {G} $ contains an induced $ t $-vertex subgraph isomorphic to the distance graph in $ \\Real^d $. We obtain the upper and lower bounds on $R_{{\\it D}}(s,s,d),$ which are similar to the bounds for the classical Ramsey number $R(\\lceil \\frac{s}{[d/2]} \\rceil, \\lceil \\frac{s}{[d/2]} \\rceil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0843","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":""},"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":"1307.0843","created_at":"2026-05-18T00:29:16.003977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0843v2","created_at":"2026-05-18T00:29:16.003977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0843","created_at":"2026-05-18T00:29:16.003977+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJQHBJM3L2CO","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJQHBJM3L2CO2S7T","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJQHBJM3","created_at":"2026-05-18T12:27:45.050594+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/GJQHBJM3L2CO2S7TDFUU6PCINF","json":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF.json","graph_json":"https://pith.science/api/pith-number/GJQHBJM3L2CO2S7TDFUU6PCINF/graph.json","events_json":"https://pith.science/api/pith-number/GJQHBJM3L2CO2S7TDFUU6PCINF/events.json","paper":"https://pith.science/paper/GJQHBJM3"},"agent_actions":{"view_html":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF","download_json":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF.json","view_paper":"https://pith.science/paper/GJQHBJM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0843&json=true","fetch_graph":"https://pith.science/api/pith-number/GJQHBJM3L2CO2S7TDFUU6PCINF/graph.json","fetch_events":"https://pith.science/api/pith-number/GJQHBJM3L2CO2S7TDFUU6PCINF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF/action/storage_attestation","attest_author":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF/action/author_attestation","sign_citation":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF/action/citation_signature","submit_replication":"https://pith.science/pith/GJQHBJM3L2CO2S7TDFUU6PCINF/action/replication_record"}},"created_at":"2026-05-18T00:29:16.003977+00:00","updated_at":"2026-05-18T00:29:16.003977+00:00"}