{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JHMNSTGSUG6E7Q6XX2ZENNMXXX","short_pith_number":"pith:JHMNSTGS","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"},"canonical_sha256":"49d8d94cd2a1bc4fc3d7beb246b597bdff6341b60f9639d377c3ee66d59b9abb","source":{"kind":"arxiv","id":"1105.2894","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2894","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2894v2","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2894","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JHMNSTGSUG6E","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JHMNSTGSUG6E7Q6X","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JHMNSTGS","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JHMNSTGSUG6E7Q6XX2ZENNMXXX","target":"record","payload":{"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"},"canonical_sha256":"49d8d94cd2a1bc4fc3d7beb246b597bdff6341b60f9639d377c3ee66d59b9abb","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"},"source_kind":"arxiv","source_id":"1105.2894","source_version":2,"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6dK8NdxzGaTZw/8ccWKIn3eGezhEaiEO14lnNVtpAwDLPE5mJNjx1zMyTss397QPA9lWmR4XZiDasTofsnIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:34:14.091061Z"},"content_sha256":"5f7d62a635fb82528155287a7b108f5d9908eed5d7b15524893adc4923e81666","schema_version":"1.0","event_id":"sha256:5f7d62a635fb82528155287a7b108f5d9908eed5d7b15524893adc4923e81666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JHMNSTGSUG6E7Q6XX2ZENNMXXX","target":"graph","payload":{"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"},"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8Z7pI2zOtv8pthRBrCtG6vPZ1oJL5C53RAHL5Kd37QPjAS9Kiy7IK+ldj5NSTQ/VVqsU2/2W5pyGDWLQzyqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:34:14.091411Z"},"content_sha256":"2687c20cef07018e08c63087e8d24e105fb42e5a0756c9e8907905ecb5cdb28c","schema_version":"1.0","event_id":"sha256:2687c20cef07018e08c63087e8d24e105fb42e5a0756c9e8907905ecb5cdb28c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/bundle.json","state_url":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/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-06-21T20:34:14Z","links":{"resolver":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX","bundle":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/bundle.json","state":"https://pith.science/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHMNSTGSUG6E7Q6XX2ZENNMXXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JHMNSTGSUG6E7Q6XX2ZENNMXXX","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":"f057774cc89d38218329ffd6fc8a8314e24bee7ea74b95332e2b41d8ea89fc83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-05-14T12:22:42Z","title_canon_sha256":"9f940c5d71d2cea40869a6b5a50edbe8eae8fa53c075b717cf362ec3049d52b5"},"schema_version":"1.0","source":{"id":"1105.2894","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2894","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2894v2","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2894","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JHMNSTGSUG6E","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JHMNSTGSUG6E7Q6X","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JHMNSTGS","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:2687c20cef07018e08c63087e8d24e105fb42e5a0756c9e8907905ecb5cdb28c","target":"graph","created_at":"2026-05-18T03:03:44Z","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":"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","authors_text":"Ankit Pat, Ashish Ranjan Hota","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-05-14T12:22:42Z","title":"Ant Colony Optimization and Hypergraph Covering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2894","kind":"arxiv","version":2},"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:5f7d62a635fb82528155287a7b108f5d9908eed5d7b15524893adc4923e81666","target":"record","created_at":"2026-05-18T03:03:44Z","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":"f057774cc89d38218329ffd6fc8a8314e24bee7ea74b95332e2b41d8ea89fc83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-05-14T12:22:42Z","title_canon_sha256":"9f940c5d71d2cea40869a6b5a50edbe8eae8fa53c075b717cf362ec3049d52b5"},"schema_version":"1.0","source":{"id":"1105.2894","kind":"arxiv","version":2}},"canonical_sha256":"49d8d94cd2a1bc4fc3d7beb246b597bdff6341b60f9639d377c3ee66d59b9abb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49d8d94cd2a1bc4fc3d7beb246b597bdff6341b60f9639d377c3ee66d59b9abb","first_computed_at":"2026-05-18T03:03:44.925461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:44.925461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BeSOXELMbncokKqwZO8P/mb+8tDUtmR+lGzenbTR77YwdVuaIKpE2cuFM3bHTHmkvnP25FcDQnnpuuT4SXc+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:44.926037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2894","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f7d62a635fb82528155287a7b108f5d9908eed5d7b15524893adc4923e81666","sha256:2687c20cef07018e08c63087e8d24e105fb42e5a0756c9e8907905ecb5cdb28c"],"state_sha256":"d04b4e9a31a8c14bac44eb701a30495da8fde21ff5adc8c60db46bebac855ac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYfyBGxmVbVFmhdh4SiBL4zfKMx/26y/8jE7oqyYgHApTa+u/JfeN8Bg526l8NtRjIiXtMOhUk5KEXmyGInEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:34:14.093617Z","bundle_sha256":"82acfe099da88ec637abaaa042cc4df4b3dbef87fb1d760fe7d0e68218fe5f0f"}}