{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7FYKUG62R32KP2ZMAXC4D54P6J","short_pith_number":"pith:7FYKUG62","schema_version":"1.0","canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","source":{"kind":"arxiv","id":"1907.07866","version":2},"attestation_state":"computed","paper":{"title":"On the equality of domination number and $ 2 $-domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, G\\\"ulnaz Boruzanl{\\i} Ekinci","submitted_at":"2019-07-18T03:59:36Z","abstract_excerpt":"The 2-domination number $\\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \\subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \\gamma_2(G) $ cannot be smaller than the domination number $ \\gamma(G) $. We consider a large class of graphs and characterize those members which satisfy $\\gamma_2=\\gamma$. For the general case, we prove that it is NP-hard to decide whether $\\gamma_2=\\gamma$ holds. We also give a necessary and sufficient condition for a graph to satisfy the equality hereditarily."},"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":"1907.07866","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T03:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"e9dfc39357f94d2cefac72aa1975349209e906d910bebec5cc141ab7a5ebddbf","abstract_canon_sha256":"5eef079bee3cff165bb1f1a895739b5b01672ef374eda88cb961469acb45c31b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:03.580177Z","signature_b64":"tvYEcliHFLFPsMzx8FV2pqoXB2RllgaDMDpFnljSy/+zBRxZo8pl+tXsbMh7olnIM4YrkoqKqaIsl7fYxnKQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f970aa1bda8ef4a7eb2c05c5c1f78ff26131c69172eb13edf2e66cffa50bd789","last_reissued_at":"2026-07-05T02:04:03.579797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:03.579797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the equality of domination number and $ 2 $-domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, G\\\"ulnaz Boruzanl{\\i} Ekinci","submitted_at":"2019-07-18T03:59:36Z","abstract_excerpt":"The 2-domination number $\\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \\subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \\gamma_2(G) $ cannot be smaller than the domination number $ \\gamma(G) $. We consider a large class of graphs and characterize those members which satisfy $\\gamma_2=\\gamma$. For the general case, we prove that it is NP-hard to decide whether $\\gamma_2=\\gamma$ holds. We also give a necessary and sufficient condition for a graph to satisfy the equality hereditarily."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07866","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.07866/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.07866","created_at":"2026-07-05T02:04:03.579852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07866v2","created_at":"2026-07-05T02:04:03.579852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07866","created_at":"2026-07-05T02:04:03.579852+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FYKUG62R32K","created_at":"2026-07-05T02:04:03.579852+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FYKUG62R32KP2ZM","created_at":"2026-07-05T02:04:03.579852+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FYKUG62","created_at":"2026-07-05T02:04:03.579852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09513","citing_title":"Perfect graphs for domination games","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J","json":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J.json","graph_json":"https://pith.science/api/pith-number/7FYKUG62R32KP2ZMAXC4D54P6J/graph.json","events_json":"https://pith.science/api/pith-number/7FYKUG62R32KP2ZMAXC4D54P6J/events.json","paper":"https://pith.science/paper/7FYKUG62"},"agent_actions":{"view_html":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J","download_json":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J.json","view_paper":"https://pith.science/paper/7FYKUG62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07866&json=true","fetch_graph":"https://pith.science/api/pith-number/7FYKUG62R32KP2ZMAXC4D54P6J/graph.json","fetch_events":"https://pith.science/api/pith-number/7FYKUG62R32KP2ZMAXC4D54P6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/action/storage_attestation","attest_author":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/action/author_attestation","sign_citation":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/action/citation_signature","submit_replication":"https://pith.science/pith/7FYKUG62R32KP2ZMAXC4D54P6J/action/replication_record"}},"created_at":"2026-07-05T02:04:03.579852+00:00","updated_at":"2026-07-05T02:04:03.579852+00:00"}