{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KGCUW7QLXDTP4QHSSJ7FBGYNBD","short_pith_number":"pith:KGCUW7QL","schema_version":"1.0","canonical_sha256":"51854b7e0bb8e6fe40f2927e509b0d08f453b3ff8372b8d03508ea17a09bd43c","source":{"kind":"arxiv","id":"1512.01613","version":2},"attestation_state":"computed","paper":{"title":"A Novel Paradigm for Calculating Ramsey Number via Artificial Bee Colony Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.CO","math.OC"],"primary_cat":"cs.AI","authors_text":"Fei Gao, Wei-Hao Mao, Wen-Ming Li, Yi-Jin Dong","submitted_at":"2015-12-05T02:42:28Z","abstract_excerpt":"The Ramsey number is of vital importance in Ramsey's theorem. This paper proposed a novel methodology for constructing Ramsey graphs about R(3,10), which uses Artificial Bee Colony optimization(ABC) to raise the lower bound of Ramsey number R(3,10). The r(3,10)-graph contains two limitations, that is, neither complete graphs of order 3 nor independent sets of order 10. To resolve these limitations, a special mathematical model is put in the paradigm to convert the problems into discrete optimization whose smaller minimizers are correspondent to bigger lower bound as approximation of inf R(3,10"},"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":"1512.01613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-05T02:42:28Z","cross_cats_sorted":["cs.NE","math.CO","math.OC"],"title_canon_sha256":"a6f6aed7809ea7a50b9be9a292647ccfa51ee09707793f78ca7a5480f223da5e","abstract_canon_sha256":"4ea3c831327eac782e90796a800d3500bed85423280ca61f9911939b4b862895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:45.245493Z","signature_b64":"vYCgtTxU64FAva5FgvpblzuyOIwbpXzOOcUpgnujO7PVnpv3f5n11nUcoyYoFy8Se3y71hC+VPzOPYVLbI0SDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51854b7e0bb8e6fe40f2927e509b0d08f453b3ff8372b8d03508ea17a09bd43c","last_reissued_at":"2026-05-18T01:24:45.244971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:45.244971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Paradigm for Calculating Ramsey Number via Artificial Bee Colony Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.CO","math.OC"],"primary_cat":"cs.AI","authors_text":"Fei Gao, Wei-Hao Mao, Wen-Ming Li, Yi-Jin Dong","submitted_at":"2015-12-05T02:42:28Z","abstract_excerpt":"The Ramsey number is of vital importance in Ramsey's theorem. This paper proposed a novel methodology for constructing Ramsey graphs about R(3,10), which uses Artificial Bee Colony optimization(ABC) to raise the lower bound of Ramsey number R(3,10). The r(3,10)-graph contains two limitations, that is, neither complete graphs of order 3 nor independent sets of order 10. To resolve these limitations, a special mathematical model is put in the paradigm to convert the problems into discrete optimization whose smaller minimizers are correspondent to bigger lower bound as approximation of inf R(3,10"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01613","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":"1512.01613","created_at":"2026-05-18T01:24:45.245055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01613v2","created_at":"2026-05-18T01:24:45.245055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01613","created_at":"2026-05-18T01:24:45.245055+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGCUW7QLXDTP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGCUW7QLXDTP4QHS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGCUW7QL","created_at":"2026-05-18T12:29:27.538025+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/KGCUW7QLXDTP4QHSSJ7FBGYNBD","json":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD.json","graph_json":"https://pith.science/api/pith-number/KGCUW7QLXDTP4QHSSJ7FBGYNBD/graph.json","events_json":"https://pith.science/api/pith-number/KGCUW7QLXDTP4QHSSJ7FBGYNBD/events.json","paper":"https://pith.science/paper/KGCUW7QL"},"agent_actions":{"view_html":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD","download_json":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD.json","view_paper":"https://pith.science/paper/KGCUW7QL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01613&json=true","fetch_graph":"https://pith.science/api/pith-number/KGCUW7QLXDTP4QHSSJ7FBGYNBD/graph.json","fetch_events":"https://pith.science/api/pith-number/KGCUW7QLXDTP4QHSSJ7FBGYNBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD/action/storage_attestation","attest_author":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD/action/author_attestation","sign_citation":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD/action/citation_signature","submit_replication":"https://pith.science/pith/KGCUW7QLXDTP4QHSSJ7FBGYNBD/action/replication_record"}},"created_at":"2026-05-18T01:24:45.245055+00:00","updated_at":"2026-05-18T01:24:45.245055+00:00"}