{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QXIPT3QNOZAQTIZNPK6AEUSEFR","short_pith_number":"pith:QXIPT3QN","schema_version":"1.0","canonical_sha256":"85d0f9ee0d764109a32d7abc0252442c5b3943d6a5bba5f1e5e62d75394aeb56","source":{"kind":"arxiv","id":"1907.01210","version":1},"attestation_state":"computed","paper":{"title":"Paired domination and 2- distance Paired domination of the flower graph $f_{n\\times m}$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Syed Ahtsham Ul Haq Bokhary, Tanveer Iqbal","submitted_at":"2019-07-02T07:39:36Z","abstract_excerpt":"Let $G = (V, E)$ be a graph without an isolated vertex. A set $D\\subseteq V(G)$ is a $k$-distance paired domination set of $G$ if $D$ is a $k$-distance dominating set of $G$ and the induced subgraph $\\langle D \\rangle$ has a perfect matching. The minimum cardinality of a $k$-distance paired dominating set for graph $G$ is the $k$-distance paired domination number, denoted by $\\gamma_{p} ^{k}(G)$. In this paper, the $k$-distance paired domination of the flower graph $f_{n\\times m}$ is discussed. For $m,n\\geq 3$, the exact values for paired domination number and $2$-distance paired domination nu"},"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.01210","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"7d51bd2a8ea72d311174ad8023f01d2a7cf3df047ec0d1ec4c7696399b6b66e9","abstract_canon_sha256":"285f4cbe212fe3e9fd85d0ca7524b6fae32a9c5003160c7053fe9ed5e44f16cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.976747Z","signature_b64":"t76QvaEsf4aK+unEJFNqfWHU79JN4AyYY+gYm43xPOVfRU2wowuPoPSOgGlbXksj6Oum1wKBSgGsySsQL5zeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d0f9ee0d764109a32d7abc0252442c5b3943d6a5bba5f1e5e62d75394aeb56","last_reissued_at":"2026-05-17T23:41:40.976281Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.976281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Paired domination and 2- distance Paired domination of the flower graph $f_{n\\times m}$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Syed Ahtsham Ul Haq Bokhary, Tanveer Iqbal","submitted_at":"2019-07-02T07:39:36Z","abstract_excerpt":"Let $G = (V, E)$ be a graph without an isolated vertex. A set $D\\subseteq V(G)$ is a $k$-distance paired domination set of $G$ if $D$ is a $k$-distance dominating set of $G$ and the induced subgraph $\\langle D \\rangle$ has a perfect matching. The minimum cardinality of a $k$-distance paired dominating set for graph $G$ is the $k$-distance paired domination number, denoted by $\\gamma_{p} ^{k}(G)$. In this paper, the $k$-distance paired domination of the flower graph $f_{n\\times m}$ is discussed. For $m,n\\geq 3$, the exact values for paired domination number and $2$-distance paired domination nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01210","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":"1907.01210","created_at":"2026-05-17T23:41:40.976357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01210v1","created_at":"2026-05-17T23:41:40.976357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01210","created_at":"2026-05-17T23:41:40.976357+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXIPT3QNOZAQ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXIPT3QNOZAQTIZN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXIPT3QN","created_at":"2026-05-18T12:33:27.125529+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/QXIPT3QNOZAQTIZNPK6AEUSEFR","json":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR.json","graph_json":"https://pith.science/api/pith-number/QXIPT3QNOZAQTIZNPK6AEUSEFR/graph.json","events_json":"https://pith.science/api/pith-number/QXIPT3QNOZAQTIZNPK6AEUSEFR/events.json","paper":"https://pith.science/paper/QXIPT3QN"},"agent_actions":{"view_html":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR","download_json":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR.json","view_paper":"https://pith.science/paper/QXIPT3QN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01210&json=true","fetch_graph":"https://pith.science/api/pith-number/QXIPT3QNOZAQTIZNPK6AEUSEFR/graph.json","fetch_events":"https://pith.science/api/pith-number/QXIPT3QNOZAQTIZNPK6AEUSEFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/action/storage_attestation","attest_author":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/action/author_attestation","sign_citation":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/action/citation_signature","submit_replication":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/action/replication_record"}},"created_at":"2026-05-17T23:41:40.976357+00:00","updated_at":"2026-05-17T23:41:40.976357+00:00"}