{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SJXO7J2USNGPBP2C3GUIKJPWNV","short_pith_number":"pith:SJXO7J2U","canonical_record":{"source":{"id":"1808.09809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-28T17:13:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"55e65a52043a66558e88667f79de9a641c0b201d10857bc0e45ef26ce1189efa","abstract_canon_sha256":"7c4550d268d2fd7a558b91a8c263aed2cf691ca89ce9edfb3c972929c46619de"},"schema_version":"1.0"},"canonical_sha256":"926eefa754934cf0bf42d9a88525f66d5ce1b999dc7907807fd9410facadb837","source":{"kind":"arxiv","id":"1808.09809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09809","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09809v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09809","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"SJXO7J2USNGP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SJXO7J2USNGPBP2C","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SJXO7J2U","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SJXO7J2USNGPBP2C3GUIKJPWNV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-28T17:13:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"55e65a52043a66558e88667f79de9a641c0b201d10857bc0e45ef26ce1189efa","abstract_canon_sha256":"7c4550d268d2fd7a558b91a8c263aed2cf691ca89ce9edfb3c972929c46619de"},"schema_version":"1.0"},"canonical_sha256":"926eefa754934cf0bf42d9a88525f66d5ce1b999dc7907807fd9410facadb837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.405656Z","signature_b64":"pGWi3/Wu8bOn45vTa5BootUs5EMT7S96szUKpyzwHWIYXgi1ILpKhlNQyNE6Fc7H2FHmpkJfCXokGaoDcajUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926eefa754934cf0bf42d9a88525f66d5ce1b999dc7907807fd9410facadb837","last_reissued_at":"2026-05-18T00:06:54.405006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.405006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09809","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-18T00:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt/hKsLUREcD2zihirfr/KEeuVlhiJAM7jCUc86Wq5snxK5WuJuDn4D6uqSmZI6YAK4mSAPjCbBQr/p4FzKWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:51.104379Z"},"content_sha256":"ed47be8cfde67ea3f56fc8cd125c1c8bdd7f7163cf86f74185ed5769ef4185b3","schema_version":"1.0","event_id":"sha256:ed47be8cfde67ea3f56fc8cd125c1c8bdd7f7163cf86f74185ed5769ef4185b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SJXO7J2USNGPBP2C3GUIKJPWNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Matheuristic for the Minimum-Weight Dominating Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.AI","authors_text":"Mayra Albuquerque, Thibaut Vidal","submitted_at":"2018-08-28T17:13:17Z","abstract_excerpt":"A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set. This mathematical object is of high relevance in a number of applications related to social networks analysis, design of wireless networks, coding theory, and data mining, among many others. When vertex weights are given, minimizing the total weight of the dominating set gives rise to a problem variant known as the minimum weight dominating set problem. To solve this problem, we introduce a hybrid matheuristic combining a tabu sear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09809","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-18T00:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIxF8l+lE6iSz6/bpBuUYU6UsQg677J33n9PhrsPlxSF5auR942dh0EBnfiX/ysSek8U3RF4LLiH2IGn7a3UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:51.104821Z"},"content_sha256":"77e99b107227db0778e3cf1a1d85330385f0324a11a69a26a3267df515516e96","schema_version":"1.0","event_id":"sha256:77e99b107227db0778e3cf1a1d85330385f0324a11a69a26a3267df515516e96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJXO7J2USNGPBP2C3GUIKJPWNV/bundle.json","state_url":"https://pith.science/pith/SJXO7J2USNGPBP2C3GUIKJPWNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJXO7J2USNGPBP2C3GUIKJPWNV/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-05-25T10:05:51Z","links":{"resolver":"https://pith.science/pith/SJXO7J2USNGPBP2C3GUIKJPWNV","bundle":"https://pith.science/pith/SJXO7J2USNGPBP2C3GUIKJPWNV/bundle.json","state":"https://pith.science/pith/SJXO7J2USNGPBP2C3GUIKJPWNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJXO7J2USNGPBP2C3GUIKJPWNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SJXO7J2USNGPBP2C3GUIKJPWNV","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":"7c4550d268d2fd7a558b91a8c263aed2cf691ca89ce9edfb3c972929c46619de","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-28T17:13:17Z","title_canon_sha256":"55e65a52043a66558e88667f79de9a641c0b201d10857bc0e45ef26ce1189efa"},"schema_version":"1.0","source":{"id":"1808.09809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09809","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09809v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09809","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"SJXO7J2USNGP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SJXO7J2USNGPBP2C","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SJXO7J2U","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:77e99b107227db0778e3cf1a1d85330385f0324a11a69a26a3267df515516e96","target":"graph","created_at":"2026-05-18T00:06:54Z","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":"A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set. This mathematical object is of high relevance in a number of applications related to social networks analysis, design of wireless networks, coding theory, and data mining, among many others. When vertex weights are given, minimizing the total weight of the dominating set gives rise to a problem variant known as the minimum weight dominating set problem. To solve this problem, we introduce a hybrid matheuristic combining a tabu sear","authors_text":"Mayra Albuquerque, Thibaut Vidal","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-28T17:13:17Z","title":"An Efficient Matheuristic for the Minimum-Weight Dominating Set Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09809","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:ed47be8cfde67ea3f56fc8cd125c1c8bdd7f7163cf86f74185ed5769ef4185b3","target":"record","created_at":"2026-05-18T00:06:54Z","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":"7c4550d268d2fd7a558b91a8c263aed2cf691ca89ce9edfb3c972929c46619de","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-28T17:13:17Z","title_canon_sha256":"55e65a52043a66558e88667f79de9a641c0b201d10857bc0e45ef26ce1189efa"},"schema_version":"1.0","source":{"id":"1808.09809","kind":"arxiv","version":1}},"canonical_sha256":"926eefa754934cf0bf42d9a88525f66d5ce1b999dc7907807fd9410facadb837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"926eefa754934cf0bf42d9a88525f66d5ce1b999dc7907807fd9410facadb837","first_computed_at":"2026-05-18T00:06:54.405006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:54.405006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pGWi3/Wu8bOn45vTa5BootUs5EMT7S96szUKpyzwHWIYXgi1ILpKhlNQyNE6Fc7H2FHmpkJfCXokGaoDcajUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:54.405656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed47be8cfde67ea3f56fc8cd125c1c8bdd7f7163cf86f74185ed5769ef4185b3","sha256:77e99b107227db0778e3cf1a1d85330385f0324a11a69a26a3267df515516e96"],"state_sha256":"6db4d262676c31e3f2e9a418c42d8d1f3f5d8799a51c248c54242afd1b5e8505"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCTWGPSkuxwn6EnhrTTIHR0rhw0aug8CccOwG/WrDpM+5gH8p82p3983XC54TfzBwEB7T2MmwQ6OHykByP0pCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:05:51.107346Z","bundle_sha256":"270301238bb9c810b0fa8163dbae238541e281fdae8f5fc66670c9e2b558651b"}}