{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3IIZXESXYW6IW5CVDKW43EA26D","short_pith_number":"pith:3IIZXESX","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"},"canonical_sha256":"da119b9257c5bc8b74551aadcd901af0ca1bd25cece808463ab61b1485d8500b","source":{"kind":"arxiv","id":"1609.05662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05662","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05662v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05662","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"3IIZXESXYW6I","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3IIZXESXYW6IW5CV","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3IIZXESX","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3IIZXESXYW6IW5CVDKW43EA26D","target":"record","payload":{"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"},"canonical_sha256":"da119b9257c5bc8b74551aadcd901af0ca1bd25cece808463ab61b1485d8500b","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"},"source_kind":"arxiv","source_id":"1609.05662","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-18T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pf9pe2gNmaskKOFzvOC5PBOlUYkz2MdIzD+tziq1dcLTC6GQ8eTt96NuaEJLOXGwHE2kGEvxFNv2jkNBbloVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:58:06.959787Z"},"content_sha256":"d6d6d34446d3de070a91bf8ab3880a7b415447be20a3e13c6602a25166fc849d","schema_version":"1.0","event_id":"sha256:d6d6d34446d3de070a91bf8ab3880a7b415447be20a3e13c6602a25166fc849d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3IIZXESXYW6IW5CVDKW43EA26D","target":"graph","payload":{"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"},"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-18T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GiD9twrHxIYlXdf4BslBf/UE7X3/6mg+HfIP+oD/k5jlZzKS7hfy88W6+M6WgLi9IoHb65FLqi8OCXqe90bPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:58:06.960489Z"},"content_sha256":"6ff7fe19aacb881903f00be3d10e1c22594ddc3b8b95e1854173d5299761ddd2","schema_version":"1.0","event_id":"sha256:6ff7fe19aacb881903f00be3d10e1c22594ddc3b8b95e1854173d5299761ddd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/bundle.json","state_url":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IIZXESXYW6IW5CVDKW43EA26D/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-08T11:58:06Z","links":{"resolver":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D","bundle":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/bundle.json","state":"https://pith.science/pith/3IIZXESXYW6IW5CVDKW43EA26D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IIZXESXYW6IW5CVDKW43EA26D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3IIZXESXYW6IW5CVDKW43EA26D","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":"130009e3bc6e226a8e86a0ab3ee4a5d86dbe7bef257d570a52fac5cba2bfeb1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-19T10:53:37Z","title_canon_sha256":"0680e70fc3d9a9f4ddcd594992e6458fafcd4c647bb33d79352a3a99b010cb61"},"schema_version":"1.0","source":{"id":"1609.05662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05662","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05662v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05662","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"3IIZXESXYW6I","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3IIZXESXYW6IW5CV","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3IIZXESX","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:6ff7fe19aacb881903f00be3d10e1c22594ddc3b8b95e1854173d5299761ddd2","target":"graph","created_at":"2026-05-18T01:04:25Z","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":"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","authors_text":"Islam Safak Bayram, Raka Jovanovic, Stefan Voss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-19T10:53:37Z","title":"A GRASP approach for solving the 2-connected m-dominating set problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05662","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:d6d6d34446d3de070a91bf8ab3880a7b415447be20a3e13c6602a25166fc849d","target":"record","created_at":"2026-05-18T01:04:25Z","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":"130009e3bc6e226a8e86a0ab3ee4a5d86dbe7bef257d570a52fac5cba2bfeb1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-19T10:53:37Z","title_canon_sha256":"0680e70fc3d9a9f4ddcd594992e6458fafcd4c647bb33d79352a3a99b010cb61"},"schema_version":"1.0","source":{"id":"1609.05662","kind":"arxiv","version":1}},"canonical_sha256":"da119b9257c5bc8b74551aadcd901af0ca1bd25cece808463ab61b1485d8500b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da119b9257c5bc8b74551aadcd901af0ca1bd25cece808463ab61b1485d8500b","first_computed_at":"2026-05-18T01:04:25.703044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:25.703044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ojc8KjBAsiMUJebRRpdkcRfz/6dB9LWs9qJTZzo5bd5CracRIzDFZm1fkmKkgpcvygSRXnSuQFuiOpYCtUNkDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:25.703770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d6d34446d3de070a91bf8ab3880a7b415447be20a3e13c6602a25166fc849d","sha256:6ff7fe19aacb881903f00be3d10e1c22594ddc3b8b95e1854173d5299761ddd2"],"state_sha256":"b63539b53064d9eeae5c2315616ac85ca604b2332f96431779842c99886e2521"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"johpaFINM7jlAAJ4PJ1tOf9hM0P/9+97CVHv/Fkofv3N6B14rwEI2rYeSccJC7/c7SiCi1QVXG20ZXI2wGqUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:58:06.964071Z","bundle_sha256":"6b01d8cc8af7601443e4a224949ede7bdd6c12f5799a5f980c94c4e9515a6b9e"}}