{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BHLVDD5FRPG2X4CW2HJXQAUWYJ","short_pith_number":"pith:BHLVDD5F","canonical_record":{"source":{"id":"1805.02345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T05:13:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bf67c857b5084264479c4f02939d31227ea84bea22e862c55d0eba3fbf768a31","abstract_canon_sha256":"468955f441e39f9172c35f657a7e881f4dd5754a76e55113dc6f6e4d75bcb1c0"},"schema_version":"1.0"},"canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","source":{"kind":"arxiv","id":"1805.02345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02345","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02345v1","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02345","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"BHLVDD5FRPG2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BHLVDD5FRPG2X4CW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BHLVDD5F","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BHLVDD5FRPG2X4CW2HJXQAUWYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T05:13:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bf67c857b5084264479c4f02939d31227ea84bea22e862c55d0eba3fbf768a31","abstract_canon_sha256":"468955f441e39f9172c35f657a7e881f4dd5754a76e55113dc6f6e4d75bcb1c0"},"schema_version":"1.0"},"canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:59.745880Z","signature_b64":"5Qu7TMtUJV811GPCPMWv//HOCmyJzNysY8CdPXVthzzb0eezIEsx6tahLGitW1w+T8iOfGXm0st9YF0AcuNtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","last_reissued_at":"2026-05-18T00:13:59.745148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:59.745148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02345","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:13:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pG5LH3akJQCo1YMiaJHCQuPyTds+1X2h0las+qb+PV2yYOS/NmJfzRmJdEH2ILu8AR6FEB26IDb0TBhQ3QGMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:30:01.494947Z"},"content_sha256":"4c4097d0405405c1936e2f661e65f9567f421764f422892537d97db66f8b2cf3","schema_version":"1.0","event_id":"sha256:4c4097d0405405c1936e2f661e65f9567f421764f422892537d97db66f8b2cf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BHLVDD5FRPG2X4CW2HJXQAUWYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Domination Cover Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"A. Shakiba, M. Alambardar Meybodi, M.R. Hooshmandasl, P. Sharifani","submitted_at":"2018-05-07T05:13:21Z","abstract_excerpt":"A set $D \\subseteq V$ for the graph $G=(V, E)$ is called a dominating set if any vertex $v\\in V\\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for enumerating all minimal dominating sets with $n$ vertices in $O(1.7159^n)$ time. It is known that the number of minimal dominating sets for interval graphs and trees on $n$ vertices is at most $3^{n/3} \\approx 1.4422^n$. In this paper, we introduce the domination cover number as a new criterion for evaluating the dominating sets in graphs. The domination cover number of a dominating set $D$, denoted by $\\mathcal{C}_D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02345","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:13:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taDEdChG27U5wMnJfLOX/HyKNS+57dJQtS8p35QZ+qgb9hyv3p3v5vcVSzcWHVx2LOzALEBpEccEZDw3fK6sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:30:01.495277Z"},"content_sha256":"21ef19ffdf096e7132b924e3ee77070631cd5cd82373fb0de8a6a843f56db783","schema_version":"1.0","event_id":"sha256:21ef19ffdf096e7132b924e3ee77070631cd5cd82373fb0de8a6a843f56db783"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/bundle.json","state_url":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/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-27T20:30:01Z","links":{"resolver":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ","bundle":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/bundle.json","state":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BHLVDD5FRPG2X4CW2HJXQAUWYJ","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":"468955f441e39f9172c35f657a7e881f4dd5754a76e55113dc6f6e4d75bcb1c0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T05:13:21Z","title_canon_sha256":"bf67c857b5084264479c4f02939d31227ea84bea22e862c55d0eba3fbf768a31"},"schema_version":"1.0","source":{"id":"1805.02345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02345","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02345v1","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02345","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"BHLVDD5FRPG2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BHLVDD5FRPG2X4CW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BHLVDD5F","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:21ef19ffdf096e7132b924e3ee77070631cd5cd82373fb0de8a6a843f56db783","target":"graph","created_at":"2026-05-18T00:13:59Z","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 set $D \\subseteq V$ for the graph $G=(V, E)$ is called a dominating set if any vertex $v\\in V\\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for enumerating all minimal dominating sets with $n$ vertices in $O(1.7159^n)$ time. It is known that the number of minimal dominating sets for interval graphs and trees on $n$ vertices is at most $3^{n/3} \\approx 1.4422^n$. In this paper, we introduce the domination cover number as a new criterion for evaluating the dominating sets in graphs. The domination cover number of a dominating set $D$, denoted by $\\mathcal{C}_D","authors_text":"A. Shakiba, M. Alambardar Meybodi, M.R. Hooshmandasl, P. Sharifani","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T05:13:21Z","title":"Domination Cover Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02345","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:4c4097d0405405c1936e2f661e65f9567f421764f422892537d97db66f8b2cf3","target":"record","created_at":"2026-05-18T00:13:59Z","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":"468955f441e39f9172c35f657a7e881f4dd5754a76e55113dc6f6e4d75bcb1c0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T05:13:21Z","title_canon_sha256":"bf67c857b5084264479c4f02939d31227ea84bea22e862c55d0eba3fbf768a31"},"schema_version":"1.0","source":{"id":"1805.02345","kind":"arxiv","version":1}},"canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","first_computed_at":"2026-05-18T00:13:59.745148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:59.745148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Qu7TMtUJV811GPCPMWv//HOCmyJzNysY8CdPXVthzzb0eezIEsx6tahLGitW1w+T8iOfGXm0st9YF0AcuNtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:59.745880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c4097d0405405c1936e2f661e65f9567f421764f422892537d97db66f8b2cf3","sha256:21ef19ffdf096e7132b924e3ee77070631cd5cd82373fb0de8a6a843f56db783"],"state_sha256":"24181ee7934ee6d332c9052fc7c165279938ac78ab0b2e7f0ed993099886b079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z92/xKn90vVJA2cTnnWEGSBDIG2SLS2FkfpKAjm6/c/RV48Fz4a1N7R5KO7vo3sMdjDykUHexLgVYARVAyy/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:30:01.498018Z","bundle_sha256":"881b3eb9b980c1ba8bfba6796c0dea0fcb2affbdffa1d90cb5de47964cb110ea"}}