{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3QA4XPCMPKEY4KQOJG7LMOIX27","short_pith_number":"pith:3QA4XPCM","schema_version":"1.0","canonical_sha256":"dc01cbbc4c7a898e2a0e49beb63917d7d848f6020584fa90a0da530173447119","source":{"kind":"arxiv","id":"1605.07492","version":1},"attestation_state":"computed","paper":{"title":"Ramsey Numbers of Connected Clique Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts","submitted_at":"2016-05-24T15:05:38Z","abstract_excerpt":"We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2 - r - 1)n - r + 1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and that this number of vertices cannot be reduced."},"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":"1605.07492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T15:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"edd58075bbe03a9779bc6a09e9d48d79b784515cb69237dc50924cc05886037c","abstract_canon_sha256":"fac6e40c4ec9064c015251a262a96321ab3ba8acb2bc4eaf487f9a6a45e5f162"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.929040Z","signature_b64":"P/0KGWNLHZKHG7bmGMfsOqfjKCm1bHgWu+ssnYGBZHD39U9YYqwNrWCQtc+HlnriWBOMHIjYHQEeTawigk08AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc01cbbc4c7a898e2a0e49beb63917d7d848f6020584fa90a0da530173447119","last_reissued_at":"2026-05-18T01:13:45.928275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.928275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey Numbers of Connected Clique Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts","submitted_at":"2016-05-24T15:05:38Z","abstract_excerpt":"We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2 - r - 1)n - r + 1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and that this number of vertices cannot be reduced."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07492","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":"1605.07492","created_at":"2026-05-18T01:13:45.928420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07492v1","created_at":"2026-05-18T01:13:45.928420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07492","created_at":"2026-05-18T01:13:45.928420+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QA4XPCMPKEY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QA4XPCMPKEY4KQO","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QA4XPCM","created_at":"2026-05-18T12:29:55.572404+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/3QA4XPCMPKEY4KQOJG7LMOIX27","json":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27.json","graph_json":"https://pith.science/api/pith-number/3QA4XPCMPKEY4KQOJG7LMOIX27/graph.json","events_json":"https://pith.science/api/pith-number/3QA4XPCMPKEY4KQOJG7LMOIX27/events.json","paper":"https://pith.science/paper/3QA4XPCM"},"agent_actions":{"view_html":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27","download_json":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27.json","view_paper":"https://pith.science/paper/3QA4XPCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07492&json=true","fetch_graph":"https://pith.science/api/pith-number/3QA4XPCMPKEY4KQOJG7LMOIX27/graph.json","fetch_events":"https://pith.science/api/pith-number/3QA4XPCMPKEY4KQOJG7LMOIX27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27/action/storage_attestation","attest_author":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27/action/author_attestation","sign_citation":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27/action/citation_signature","submit_replication":"https://pith.science/pith/3QA4XPCMPKEY4KQOJG7LMOIX27/action/replication_record"}},"created_at":"2026-05-18T01:13:45.928420+00:00","updated_at":"2026-05-18T01:13:45.928420+00:00"}