{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3IIZXESXYW6IW5CVDKW43EA26D","short_pith_number":"pith:3IIZXESX","schema_version":"1.0","canonical_sha256":"da119b9257c5bc8b74551aadcd901af0ca1bd25cece808463ab61b1485d8500b","source":{"kind":"arxiv","id":"1609.05662","version":1},"attestation_state":"computed","paper":{"title":"A GRASP approach for solving the 2-connected m-dominating set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Islam Safak Bayram, Raka Jovanovic, Stefan Voss","submitted_at":"2016-09-19T10:53:37Z","abstract_excerpt":"In this paper, we present a constructive heuristic algorithm for the $2$-connected $m$-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization i"},"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":"1609.05662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-19T10:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"0680e70fc3d9a9f4ddcd594992e6458fafcd4c647bb33d79352a3a99b010cb61","abstract_canon_sha256":"130009e3bc6e226a8e86a0ab3ee4a5d86dbe7bef257d570a52fac5cba2bfeb1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:25.703770Z","signature_b64":"ojc8KjBAsiMUJebRRpdkcRfz/6dB9LWs9qJTZzo5bd5CracRIzDFZm1fkmKkgpcvygSRXnSuQFuiOpYCtUNkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da119b9257c5bc8b74551aadcd901af0ca1bd25cece808463ab61b1485d8500b","last_reissued_at":"2026-05-18T01:04:25.703044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:25.703044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A GRASP approach for solving the 2-connected m-dominating set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Islam Safak Bayram, Raka Jovanovic, Stefan Voss","submitted_at":"2016-09-19T10:53:37Z","abstract_excerpt":"In this paper, we present a constructive heuristic algorithm for the $2$-connected $m$-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05662","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":"1609.05662","created_at":"2026-05-18T01:04:25.703147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05662v1","created_at":"2026-05-18T01:04:25.703147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05662","created_at":"2026-05-18T01:04:25.703147+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IIZXESXYW6I","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IIZXESXYW6IW5CV","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IIZXESX","created_at":"2026-05-18T12:29:55.572404+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/3IIZXESXYW6IW5CVDKW43EA26D","json":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D.json","graph_json":"https://pith.science/api/pith-number/3IIZXESXYW6IW5CVDKW43EA26D/graph.json","events_json":"https://pith.science/api/pith-number/3IIZXESXYW6IW5CVDKW43EA26D/events.json","paper":"https://pith.science/paper/3IIZXESX"},"agent_actions":{"view_html":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D","download_json":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D.json","view_paper":"https://pith.science/paper/3IIZXESX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05662&json=true","fetch_graph":"https://pith.science/api/pith-number/3IIZXESXYW6IW5CVDKW43EA26D/graph.json","fetch_events":"https://pith.science/api/pith-number/3IIZXESXYW6IW5CVDKW43EA26D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/action/storage_attestation","attest_author":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/action/author_attestation","sign_citation":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/action/citation_signature","submit_replication":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/action/replication_record"}},"created_at":"2026-05-18T01:04:25.703147+00:00","updated_at":"2026-05-18T01:04:25.703147+00:00"}