{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BNSYBV7Z6VWV65C5WZMCF5PJST","short_pith_number":"pith:BNSYBV7Z","canonical_record":{"source":{"id":"1210.5826","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T08:06:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f392b3f89bed9b5773168a354b79af0e7acf294b82c9ce202412589267d76c92","abstract_canon_sha256":"41b1ec6fde1eb5a4abcb8f72626d04943caf1659fdfdf9bdbac1619031a7b9ed"},"schema_version":"1.0"},"canonical_sha256":"0b6580d7f9f56d5f745db65822f5e994f3f65902067d3511c69bbe1053ee3117","source":{"kind":"arxiv","id":"1210.5826","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5826","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5826v4","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5826","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"BNSYBV7Z6VWV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BNSYBV7Z6VWV65C5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BNSYBV7Z","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BNSYBV7Z6VWV65C5WZMCF5PJST","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5826","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T08:06:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f392b3f89bed9b5773168a354b79af0e7acf294b82c9ce202412589267d76c92","abstract_canon_sha256":"41b1ec6fde1eb5a4abcb8f72626d04943caf1659fdfdf9bdbac1619031a7b9ed"},"schema_version":"1.0"},"canonical_sha256":"0b6580d7f9f56d5f745db65822f5e994f3f65902067d3511c69bbe1053ee3117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:25.505365Z","signature_b64":"fhQjA6mYitZeqWavlEN2aM9RNcReCDEaed9eAwidN0CdiCauHc1SHpv8qdITqni4aG1z8l6kN7o1+sNuMhjpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b6580d7f9f56d5f745db65822f5e994f3f65902067d3511c69bbe1053ee3117","last_reissued_at":"2026-05-18T03:30:25.504739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:25.504739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5826","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+m9QzpJiP2Lkdej/hg7Pd/poCIWLmlOPVrIWd0glZb1QK0cs0yZiTWub9pdRQuOcK6UDUhGze9KTTwFbamOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:26:20.732520Z"},"content_sha256":"2163c64d2d8db67aba45ca9048dbaeab4c7565eb5439ef2d34e58a63e73aaf56","schema_version":"1.0","event_id":"sha256:2163c64d2d8db67aba45ca9048dbaeab4c7565eb5439ef2d34e58a63e73aaf56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BNSYBV7Z6VWV65C5WZMCF5PJST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Computational Upper Bounds for Ramsey Numbers R(3,k)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur, Stanis{\\l}aw P. Radziszowski","submitted_at":"2012-10-22T08:06:37Z","abstract_excerpt":"Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87, and R(3,16) <= 98. All of them are improvements by one over the previously best known bounds.\n  Let e(3,k,n) denote the minimum number of edges in any triangle-free graph on n vertices without independent sets of order k. The new upper bounds on R(3,k) are obtained by completing the computation of the exact values of e(3,k,n) for all n with k <= 9 and for all n <= 33 for k = 10, and by establishing new lower bounds o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5826","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jK0pJ95LJvrbHhwTHqWJy7dLLVutXpbvtoSXWrEl4jOupGNUw4WM/J9vZZ4Zqo/t85ykMqrgjLoL9W80jZ5zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:26:20.733155Z"},"content_sha256":"3ce97b822356d39f951296c005c0a58f466a8f780d77ab9f184a82827d9af24d","schema_version":"1.0","event_id":"sha256:3ce97b822356d39f951296c005c0a58f466a8f780d77ab9f184a82827d9af24d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNSYBV7Z6VWV65C5WZMCF5PJST/bundle.json","state_url":"https://pith.science/pith/BNSYBV7Z6VWV65C5WZMCF5PJST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNSYBV7Z6VWV65C5WZMCF5PJST/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T19:26:20Z","links":{"resolver":"https://pith.science/pith/BNSYBV7Z6VWV65C5WZMCF5PJST","bundle":"https://pith.science/pith/BNSYBV7Z6VWV65C5WZMCF5PJST/bundle.json","state":"https://pith.science/pith/BNSYBV7Z6VWV65C5WZMCF5PJST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNSYBV7Z6VWV65C5WZMCF5PJST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BNSYBV7Z6VWV65C5WZMCF5PJST","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41b1ec6fde1eb5a4abcb8f72626d04943caf1659fdfdf9bdbac1619031a7b9ed","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T08:06:37Z","title_canon_sha256":"f392b3f89bed9b5773168a354b79af0e7acf294b82c9ce202412589267d76c92"},"schema_version":"1.0","source":{"id":"1210.5826","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5826","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5826v4","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5826","created_at":"2026-05-18T03:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"BNSYBV7Z6VWV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BNSYBV7Z6VWV65C5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BNSYBV7Z","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:3ce97b822356d39f951296c005c0a58f466a8f780d77ab9f184a82827d9af24d","target":"graph","created_at":"2026-05-18T03:30:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87, and R(3,16) <= 98. All of them are improvements by one over the previously best known bounds.\n  Let e(3,k,n) denote the minimum number of edges in any triangle-free graph on n vertices without independent sets of order k. The new upper bounds on R(3,k) are obtained by completing the computation of the exact values of e(3,k,n) for all n with k <= 9 and for all n <= 33 for k = 10, and by establishing new lower bounds o","authors_text":"Jan Goedgebeur, Stanis{\\l}aw P. Radziszowski","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T08:06:37Z","title":"New Computational Upper Bounds for Ramsey Numbers R(3,k)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5826","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2163c64d2d8db67aba45ca9048dbaeab4c7565eb5439ef2d34e58a63e73aaf56","target":"record","created_at":"2026-05-18T03:30:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41b1ec6fde1eb5a4abcb8f72626d04943caf1659fdfdf9bdbac1619031a7b9ed","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T08:06:37Z","title_canon_sha256":"f392b3f89bed9b5773168a354b79af0e7acf294b82c9ce202412589267d76c92"},"schema_version":"1.0","source":{"id":"1210.5826","kind":"arxiv","version":4}},"canonical_sha256":"0b6580d7f9f56d5f745db65822f5e994f3f65902067d3511c69bbe1053ee3117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b6580d7f9f56d5f745db65822f5e994f3f65902067d3511c69bbe1053ee3117","first_computed_at":"2026-05-18T03:30:25.504739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:25.504739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fhQjA6mYitZeqWavlEN2aM9RNcReCDEaed9eAwidN0CdiCauHc1SHpv8qdITqni4aG1z8l6kN7o1+sNuMhjpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:25.505365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5826","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2163c64d2d8db67aba45ca9048dbaeab4c7565eb5439ef2d34e58a63e73aaf56","sha256:3ce97b822356d39f951296c005c0a58f466a8f780d77ab9f184a82827d9af24d"],"state_sha256":"17f8090816395903ec70b21f413f60479da9c6884ae298f0f070fa5a44980dc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heVzo/Gc0Fha6dQ80p42qtZKeCaR7+s1nhmrAZkggHY8s5K7nqPR7TumRxN8r1e8c+4B1Cf6Lh/3HSHtsAefAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:26:20.736683Z","bundle_sha256":"4d52735973948ccdac7cf0d23d3899eefad9577ead22e99a554c973c552464c8"}}