{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KG3Z3QZRLHBJD2FKGXDCCNVQR4","short_pith_number":"pith:KG3Z3QZR","schema_version":"1.0","canonical_sha256":"51b79dc33159c291e8aa35c62136b08f1694fe9e358e8b058227409d66874767","source":{"kind":"arxiv","id":"1206.1012","version":1},"attestation_state":"computed","paper":{"title":"A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Iztok Fister, Iztok Fister Jr., Janez Brest","submitted_at":"2012-05-06T18:44:15Z","abstract_excerpt":"The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem. The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of the traditional evolutionary algorithm with SAW method (EA-"},"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":"1206.1012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-05-06T18:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"3d7277270133acbffc3d9dbe34696b32b56b0e706d6ddfb1d48207b4a268d00e","abstract_canon_sha256":"2187643415d5419d1706fa5e8ed2cf46f6a36063cd03e5f7f5df5dc48cd23035"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:15.533398Z","signature_b64":"/j5EYH+dCmX5CFQrKtyGduyQTB1hOVP5wa0cGgFFGycDYdyulirBidYVfNBm1FY7hTTfmAFkDrz3NZ11sBTiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b79dc33159c291e8aa35c62136b08f1694fe9e358e8b058227409d66874767","last_reissued_at":"2026-05-18T03:54:15.533010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:15.533010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Iztok Fister, Iztok Fister Jr., Janez Brest","submitted_at":"2012-05-06T18:44:15Z","abstract_excerpt":"The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem. The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of the traditional evolutionary algorithm with SAW method (EA-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1012","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":"1206.1012","created_at":"2026-05-18T03:54:15.533067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1012v1","created_at":"2026-05-18T03:54:15.533067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1012","created_at":"2026-05-18T03:54:15.533067+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG3Z3QZRLHBJ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG3Z3QZRLHBJD2FK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG3Z3QZR","created_at":"2026-05-18T12:27:11.947152+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/KG3Z3QZRLHBJD2FKGXDCCNVQR4","json":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4.json","graph_json":"https://pith.science/api/pith-number/KG3Z3QZRLHBJD2FKGXDCCNVQR4/graph.json","events_json":"https://pith.science/api/pith-number/KG3Z3QZRLHBJD2FKGXDCCNVQR4/events.json","paper":"https://pith.science/paper/KG3Z3QZR"},"agent_actions":{"view_html":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4","download_json":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4.json","view_paper":"https://pith.science/paper/KG3Z3QZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1012&json=true","fetch_graph":"https://pith.science/api/pith-number/KG3Z3QZRLHBJD2FKGXDCCNVQR4/graph.json","fetch_events":"https://pith.science/api/pith-number/KG3Z3QZRLHBJD2FKGXDCCNVQR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4/action/storage_attestation","attest_author":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4/action/author_attestation","sign_citation":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4/action/citation_signature","submit_replication":"https://pith.science/pith/KG3Z3QZRLHBJD2FKGXDCCNVQR4/action/replication_record"}},"created_at":"2026-05-18T03:54:15.533067+00:00","updated_at":"2026-05-18T03:54:15.533067+00:00"}