{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4CPLGSCB6DN67G56ARPO5MQFPG","short_pith_number":"pith:4CPLGSCB","schema_version":"1.0","canonical_sha256":"e09eb34841f0dbef9bbe045eeeb20579ab93c873ed65b6b37d5a0c4e56135abb","source":{"kind":"arxiv","id":"1903.06129","version":1},"attestation_state":"computed","paper":{"title":"Disjoint dominating and 2-dominating sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Mateusz Miotk, Pawe{\\l} \\.Zyli\\'nski","submitted_at":"2019-03-14T17:03:26Z","abstract_excerpt":"A graph $G$ is a $D\\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning $D\\!D_2$-graphs."},"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":"1903.06129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-14T17:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"d48f9c11d62ebc68123f8df0461264c200cd5fd58020d05054290c39278e570f","abstract_canon_sha256":"1312f2a7b2c4c659e8dad307b7923740d74bd8314cc57a33323fe239ba282427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.287705Z","signature_b64":"uk63w2e4q/E821BhcLWRNhQoCIGvs0l7A20JIMzZvBbLikHE0/2BYiDxrbgTOJpEWLuqMH50tiQa0j6Ll+wTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09eb34841f0dbef9bbe045eeeb20579ab93c873ed65b6b37d5a0c4e56135abb","last_reissued_at":"2026-05-17T23:51:15.287181Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.287181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint dominating and 2-dominating sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Mateusz Miotk, Pawe{\\l} \\.Zyli\\'nski","submitted_at":"2019-03-14T17:03:26Z","abstract_excerpt":"A graph $G$ is a $D\\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning $D\\!D_2$-graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06129","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":"1903.06129","created_at":"2026-05-17T23:51:15.287254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06129v1","created_at":"2026-05-17T23:51:15.287254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06129","created_at":"2026-05-17T23:51:15.287254+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CPLGSCB6DN6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CPLGSCB6DN67G56","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CPLGSCB","created_at":"2026-05-18T12:33:10.108867+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/4CPLGSCB6DN67G56ARPO5MQFPG","json":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG.json","graph_json":"https://pith.science/api/pith-number/4CPLGSCB6DN67G56ARPO5MQFPG/graph.json","events_json":"https://pith.science/api/pith-number/4CPLGSCB6DN67G56ARPO5MQFPG/events.json","paper":"https://pith.science/paper/4CPLGSCB"},"agent_actions":{"view_html":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG","download_json":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG.json","view_paper":"https://pith.science/paper/4CPLGSCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06129&json=true","fetch_graph":"https://pith.science/api/pith-number/4CPLGSCB6DN67G56ARPO5MQFPG/graph.json","fetch_events":"https://pith.science/api/pith-number/4CPLGSCB6DN67G56ARPO5MQFPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG/action/storage_attestation","attest_author":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG/action/author_attestation","sign_citation":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG/action/citation_signature","submit_replication":"https://pith.science/pith/4CPLGSCB6DN67G56ARPO5MQFPG/action/replication_record"}},"created_at":"2026-05-17T23:51:15.287254+00:00","updated_at":"2026-05-17T23:51:15.287254+00:00"}