{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CF7VZNVJNXYOB3CBHPWHEOTUY3","short_pith_number":"pith:CF7VZNVJ","schema_version":"1.0","canonical_sha256":"117f5cb6a96df0e0ec413bec723a74c6c6e01c3a9735b7bbf9490c00c0b6ef0d","source":{"kind":"arxiv","id":"2212.02455","version":1},"attestation_state":"computed","paper":{"title":"Ramsey numbers for multiple copies of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aurelio Sulser, Milo\\v{s} Truji\\'c","submitted_at":"2022-12-05T17:55:38Z","abstract_excerpt":"For a graph $H$ and an integer $n$, we let $nH$ denote the disjoint union of\n  $n$ copies of $H$. In 1975, Burr, Erd\\H{o}s, and Spencer initiated the study\n  of Ramsey numbers for $nH$, one of few instances for which Ramsey numbers are\n  now known precisely. They showed that there is a constant $c = c(H)$ such that\n  $r(nH) = (2|H| - \\alpha(H))n + c$, provided $n$ is sufficiently large.\n  Subsequently, Burr gave an implicit way of computing $c$ and noted that this\n  long term behaviour occurs when $n$ is triply exponential in $|H|$. Very\n  recently, Buci\\'{c} and Sudakov revived the problem an"},"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":"2212.02455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-05T17:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"bee6561dc8e41636ca8758bca14ccd1b830bbc3650da1777c82dbd0d014a6033","abstract_canon_sha256":"1edf262776f894c150b72b82cb525de3daa241e5f623eea9c346dda55e42c046"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:24.608516Z","signature_b64":"NgfQHWIAsT+IdCTS89U/cJnbqYOIWMb2kiGDMnXnn5FQCTuRxPPXugquB8jINS54vz+xaSmoeecEp1xTkrT0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"117f5cb6a96df0e0ec413bec723a74c6c6e01c3a9735b7bbf9490c00c0b6ef0d","last_reissued_at":"2026-07-05T05:22:24.608058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:24.608058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey numbers for multiple copies of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aurelio Sulser, Milo\\v{s} Truji\\'c","submitted_at":"2022-12-05T17:55:38Z","abstract_excerpt":"For a graph $H$ and an integer $n$, we let $nH$ denote the disjoint union of\n  $n$ copies of $H$. In 1975, Burr, Erd\\H{o}s, and Spencer initiated the study\n  of Ramsey numbers for $nH$, one of few instances for which Ramsey numbers are\n  now known precisely. They showed that there is a constant $c = c(H)$ such that\n  $r(nH) = (2|H| - \\alpha(H))n + c$, provided $n$ is sufficiently large.\n  Subsequently, Burr gave an implicit way of computing $c$ and noted that this\n  long term behaviour occurs when $n$ is triply exponential in $|H|$. Very\n  recently, Buci\\'{c} and Sudakov revived the problem an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02455","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/2212.02455/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":"2212.02455","created_at":"2026-07-05T05:22:24.608114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.02455v1","created_at":"2026-07-05T05:22:24.608114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02455","created_at":"2026-07-05T05:22:24.608114+00:00"},{"alias_kind":"pith_short_12","alias_value":"CF7VZNVJNXYO","created_at":"2026-07-05T05:22:24.608114+00:00"},{"alias_kind":"pith_short_16","alias_value":"CF7VZNVJNXYOB3CB","created_at":"2026-07-05T05:22:24.608114+00:00"},{"alias_kind":"pith_short_8","alias_value":"CF7VZNVJ","created_at":"2026-07-05T05:22:24.608114+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/CF7VZNVJNXYOB3CBHPWHEOTUY3","json":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3.json","graph_json":"https://pith.science/api/pith-number/CF7VZNVJNXYOB3CBHPWHEOTUY3/graph.json","events_json":"https://pith.science/api/pith-number/CF7VZNVJNXYOB3CBHPWHEOTUY3/events.json","paper":"https://pith.science/paper/CF7VZNVJ"},"agent_actions":{"view_html":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3","download_json":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3.json","view_paper":"https://pith.science/paper/CF7VZNVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.02455&json=true","fetch_graph":"https://pith.science/api/pith-number/CF7VZNVJNXYOB3CBHPWHEOTUY3/graph.json","fetch_events":"https://pith.science/api/pith-number/CF7VZNVJNXYOB3CBHPWHEOTUY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3/action/storage_attestation","attest_author":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3/action/author_attestation","sign_citation":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3/action/citation_signature","submit_replication":"https://pith.science/pith/CF7VZNVJNXYOB3CBHPWHEOTUY3/action/replication_record"}},"created_at":"2026-07-05T05:22:24.608114+00:00","updated_at":"2026-07-05T05:22:24.608114+00:00"}