{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JHMNSTGSUG6E7Q6XX2ZENNMXXX","short_pith_number":"pith:JHMNSTGS","schema_version":"1.0","canonical_sha256":"49d8d94cd2a1bc4fc3d7beb246b597bdff6341b60f9639d377c3ee66d59b9abb","source":{"kind":"arxiv","id":"1105.2894","version":2},"attestation_state":"computed","paper":{"title":"Ant Colony Optimization and Hypergraph Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ankit Pat, Ashish Ranjan Hota","submitted_at":"2011-05-14T12:22:42Z","abstract_excerpt":"Ant Colony Optimization (ACO) is a very popular metaheuristic for solving computationally hard combinatorial optimization problems. Runtime analysis of ACO with respect to various pseudo-boolean functions and different graph based combinatorial optimization problems has been taken up in recent years. In this paper, we investigate the runtime behavior of an MMAS*(Max-Min Ant System) ACO algorithm on some well known hypergraph covering problems that are NP-Hard. In particular, we have addressed the Minimum Edge Cover problem, the Minimum Vertex Cover problem and the Maximum Weak- Independent Set"},"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":"1105.2894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-05-14T12:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"9f940c5d71d2cea40869a6b5a50edbe8eae8fa53c075b717cf362ec3049d52b5","abstract_canon_sha256":"f057774cc89d38218329ffd6fc8a8314e24bee7ea74b95332e2b41d8ea89fc83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:44.926037Z","signature_b64":"BeSOXELMbncokKqwZO8P/mb+8tDUtmR+lGzenbTR77YwdVuaIKpE2cuFM3bHTHmkvnP25FcDQnnpuuT4SXc+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d8d94cd2a1bc4fc3d7beb246b597bdff6341b60f9639d377c3ee66d59b9abb","last_reissued_at":"2026-05-18T03:03:44.925461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:44.925461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ant Colony Optimization and Hypergraph Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ankit Pat, Ashish Ranjan Hota","submitted_at":"2011-05-14T12:22:42Z","abstract_excerpt":"Ant Colony Optimization (ACO) is a very popular metaheuristic for solving computationally hard combinatorial optimization problems. Runtime analysis of ACO with respect to various pseudo-boolean functions and different graph based combinatorial optimization problems has been taken up in recent years. In this paper, we investigate the runtime behavior of an MMAS*(Max-Min Ant System) ACO algorithm on some well known hypergraph covering problems that are NP-Hard. In particular, we have addressed the Minimum Edge Cover problem, the Minimum Vertex Cover problem and the Maximum Weak- Independent Set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2894","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":"1105.2894","created_at":"2026-05-18T03:03:44.925556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2894v2","created_at":"2026-05-18T03:03:44.925556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2894","created_at":"2026-05-18T03:03:44.925556+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHMNSTGSUG6E","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHMNSTGSUG6E7Q6X","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHMNSTGS","created_at":"2026-05-18T12:26:32.869790+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/JHMNSTGSUG6E7Q6XX2ZENNMXXX","json":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX.json","graph_json":"https://pith.science/api/pith-number/JHMNSTGSUG6E7Q6XX2ZENNMXXX/graph.json","events_json":"https://pith.science/api/pith-number/JHMNSTGSUG6E7Q6XX2ZENNMXXX/events.json","paper":"https://pith.science/paper/JHMNSTGS"},"agent_actions":{"view_html":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX","download_json":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX.json","view_paper":"https://pith.science/paper/JHMNSTGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2894&json=true","fetch_graph":"https://pith.science/api/pith-number/JHMNSTGSUG6E7Q6XX2ZENNMXXX/graph.json","fetch_events":"https://pith.science/api/pith-number/JHMNSTGSUG6E7Q6XX2ZENNMXXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/action/storage_attestation","attest_author":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/action/author_attestation","sign_citation":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/action/citation_signature","submit_replication":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/action/replication_record"}},"created_at":"2026-05-18T03:03:44.925556+00:00","updated_at":"2026-05-18T03:03:44.925556+00:00"}