{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R6OAWBROHYUDPFE4PKEXFNHRH2","short_pith_number":"pith:R6OAWBRO","canonical_record":{"source":{"id":"1311.7215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-11-28T05:49:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"08938fb49ef1752d447bd9eeea6b9c87c45ded720b937f5059e34e59c73e9ee0","abstract_canon_sha256":"96fc4c96287fcb0642537160b7c53bfc3f4e45c48d003312d1100e7534b22e98"},"schema_version":"1.0"},"canonical_sha256":"8f9c0b062e3e2837949c7a8972b4f13e92e078178d8d11abf10af902b65dc7a7","source":{"kind":"arxiv","id":"1311.7215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7215","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7215v1","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7215","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"R6OAWBROHYUD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R6OAWBROHYUDPFE4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R6OAWBRO","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R6OAWBROHYUDPFE4PKEXFNHRH2","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-11-28T05:49:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"08938fb49ef1752d447bd9eeea6b9c87c45ded720b937f5059e34e59c73e9ee0","abstract_canon_sha256":"96fc4c96287fcb0642537160b7c53bfc3f4e45c48d003312d1100e7534b22e98"},"schema_version":"1.0"},"canonical_sha256":"8f9c0b062e3e2837949c7a8972b4f13e92e078178d8d11abf10af902b65dc7a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:56.889700Z","signature_b64":"uJcBuxjxzcxyIcMCDWzfm8Y93VvjfI3oQxREA+BnW0jwN3YypDLyrqx1X6YqPrpWQKwh2YaCflf6hxe2xBaVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f9c0b062e3e2837949c7a8972b4f13e92e078178d8d11abf10af902b65dc7a7","last_reissued_at":"2026-05-18T03:05:56.889091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:56.889091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7215","source_version":1,"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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfu5sVL6Y/VL4HOvcII0516OFHmMJRt6kjm0byIAMQqOmCCbPQzb7V10jpMkUryr4eGGU2S7+mh/3i91oBglCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:18:25.651065Z"},"content_sha256":"f3ea4bb87eb8461afcf25465cfaac34121a2157c53ebe45964dd874481040813","schema_version":"1.0","event_id":"sha256:f3ea4bb87eb8461afcf25465cfaac34121a2157c53ebe45964dd874481040813"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R6OAWBROHYUDPFE4PKEXFNHRH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Minimum Vertex Cover Problem Using Learning Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.AI","authors_text":"Alireza Rezvanian, Aylin Mousavian, Mohammad Reza Meybodi","submitted_at":"2013-11-28T05:49:34Z","abstract_excerpt":"Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph. In this paper, a learning automaton based algorithm is proposed to find minimum vertex cover in graph. In the proposed algorithm, each vertex of graph is equipped with a learning automaton that has two actions in the candidate or non-candidate of the corresponding vertex cover set. Due to characteristics of learning automata, this algorithm significantly reduces the number of covering vertices of graph. The proposed algorithm based on learning automata iteratively minimize the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7215","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"},"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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRdR7Lyqm48JiEIUDV5Tv18dTYt+f9aylkRud5y4AiuoGg2x9rmM3p9i3jiiiDQd+L6LMf+xf7P2YOEMvhDWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:18:25.651771Z"},"content_sha256":"6f52002a4bf495ef6099c954a53f47c1e573db76f13a54a1fca3fe410e3bacdd","schema_version":"1.0","event_id":"sha256:6f52002a4bf495ef6099c954a53f47c1e573db76f13a54a1fca3fe410e3bacdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6OAWBROHYUDPFE4PKEXFNHRH2/bundle.json","state_url":"https://pith.science/pith/R6OAWBROHYUDPFE4PKEXFNHRH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6OAWBROHYUDPFE4PKEXFNHRH2/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-11T06:18:25Z","links":{"resolver":"https://pith.science/pith/R6OAWBROHYUDPFE4PKEXFNHRH2","bundle":"https://pith.science/pith/R6OAWBROHYUDPFE4PKEXFNHRH2/bundle.json","state":"https://pith.science/pith/R6OAWBROHYUDPFE4PKEXFNHRH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6OAWBROHYUDPFE4PKEXFNHRH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R6OAWBROHYUDPFE4PKEXFNHRH2","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":"96fc4c96287fcb0642537160b7c53bfc3f4e45c48d003312d1100e7534b22e98","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-11-28T05:49:34Z","title_canon_sha256":"08938fb49ef1752d447bd9eeea6b9c87c45ded720b937f5059e34e59c73e9ee0"},"schema_version":"1.0","source":{"id":"1311.7215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7215","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7215v1","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7215","created_at":"2026-05-18T03:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"R6OAWBROHYUD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R6OAWBROHYUDPFE4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R6OAWBRO","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:6f52002a4bf495ef6099c954a53f47c1e573db76f13a54a1fca3fe410e3bacdd","target":"graph","created_at":"2026-05-18T03:05:56Z","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":"Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph. In this paper, a learning automaton based algorithm is proposed to find minimum vertex cover in graph. In the proposed algorithm, each vertex of graph is equipped with a learning automaton that has two actions in the candidate or non-candidate of the corresponding vertex cover set. Due to characteristics of learning automata, this algorithm significantly reduces the number of covering vertices of graph. The proposed algorithm based on learning automata iteratively minimize the ","authors_text":"Alireza Rezvanian, Aylin Mousavian, Mohammad Reza Meybodi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-11-28T05:49:34Z","title":"Solving Minimum Vertex Cover Problem Using Learning Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7215","kind":"arxiv","version":1},"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:f3ea4bb87eb8461afcf25465cfaac34121a2157c53ebe45964dd874481040813","target":"record","created_at":"2026-05-18T03:05:56Z","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":"96fc4c96287fcb0642537160b7c53bfc3f4e45c48d003312d1100e7534b22e98","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-11-28T05:49:34Z","title_canon_sha256":"08938fb49ef1752d447bd9eeea6b9c87c45ded720b937f5059e34e59c73e9ee0"},"schema_version":"1.0","source":{"id":"1311.7215","kind":"arxiv","version":1}},"canonical_sha256":"8f9c0b062e3e2837949c7a8972b4f13e92e078178d8d11abf10af902b65dc7a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f9c0b062e3e2837949c7a8972b4f13e92e078178d8d11abf10af902b65dc7a7","first_computed_at":"2026-05-18T03:05:56.889091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:56.889091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJcBuxjxzcxyIcMCDWzfm8Y93VvjfI3oQxREA+BnW0jwN3YypDLyrqx1X6YqPrpWQKwh2YaCflf6hxe2xBaVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:56.889700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3ea4bb87eb8461afcf25465cfaac34121a2157c53ebe45964dd874481040813","sha256:6f52002a4bf495ef6099c954a53f47c1e573db76f13a54a1fca3fe410e3bacdd"],"state_sha256":"5ecf3bfa3c7ce129a30076e31f4dca99bfd77e3d4b6c86656a4a9916d9c57aa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQaQTT/HnsrhZ0RnvzmRRncuVGcpBonML8wWFDFrkOxqTHy1JvLE69P/CTws8ac3hp2SGPu8RTLS3BToAfYHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:18:25.656027Z","bundle_sha256":"7f068be58abeef83d70992836f648c853e9879b708ecda8ab508378c08d007a6"}}