{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QXIPT3QNOZAQTIZNPK6AEUSEFR","short_pith_number":"pith:QXIPT3QN","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"},"canonical_sha256":"85d0f9ee0d764109a32d7abc0252442c5b3943d6a5bba5f1e5e62d75394aeb56","source":{"kind":"arxiv","id":"1907.01210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01210","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01210v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01210","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"QXIPT3QNOZAQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QXIPT3QNOZAQTIZN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QXIPT3QN","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QXIPT3QNOZAQTIZNPK6AEUSEFR","target":"record","payload":{"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"},"canonical_sha256":"85d0f9ee0d764109a32d7abc0252442c5b3943d6a5bba5f1e5e62d75394aeb56","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"},"source_kind":"arxiv","source_id":"1907.01210","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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sy9g/9RPIBkxKiijI4x8E9Dkfy2q5yer8HNx30qQoYg4pmF6CIzemYc3nhjXgPZ01+HS90Kqz8Lk5V1vnlA6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:16:04.445197Z"},"content_sha256":"85a9b4cf061f0956d083fa729352df3858cbfb41970741ccc3b2777184a3eb3e","schema_version":"1.0","event_id":"sha256:85a9b4cf061f0956d083fa729352df3858cbfb41970741ccc3b2777184a3eb3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QXIPT3QNOZAQTIZNPK6AEUSEFR","target":"graph","payload":{"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"},"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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZVGpDNn1nhOOzRIMxHmyhfDzCPRUGyb+lq+roLU1og72zyna7CAZVrAI1RXB4Hf3UppbCGkzzKiD24+u6pLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:16:04.445558Z"},"content_sha256":"7a60a81652a462aea0bfafa363be2174d11b7b5700a9022b379476abfccf1178","schema_version":"1.0","event_id":"sha256:7a60a81652a462aea0bfafa363be2174d11b7b5700a9022b379476abfccf1178"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/bundle.json","state_url":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/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-28T11:16:04Z","links":{"resolver":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR","bundle":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/bundle.json","state":"https://pith.science/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXIPT3QNOZAQTIZNPK6AEUSEFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QXIPT3QNOZAQTIZNPK6AEUSEFR","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":"285f4cbe212fe3e9fd85d0ca7524b6fae32a9c5003160c7053fe9ed5e44f16cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:39:36Z","title_canon_sha256":"7d51bd2a8ea72d311174ad8023f01d2a7cf3df047ec0d1ec4c7696399b6b66e9"},"schema_version":"1.0","source":{"id":"1907.01210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01210","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01210v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01210","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"QXIPT3QNOZAQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QXIPT3QNOZAQTIZN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QXIPT3QN","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:7a60a81652a462aea0bfafa363be2174d11b7b5700a9022b379476abfccf1178","target":"graph","created_at":"2026-05-17T23:41:40Z","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":"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","authors_text":"Syed Ahtsham Ul Haq Bokhary, Tanveer Iqbal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:39:36Z","title":"Paired domination and 2- distance Paired domination of the flower graph $f_{n\\times m}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01210","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:85a9b4cf061f0956d083fa729352df3858cbfb41970741ccc3b2777184a3eb3e","target":"record","created_at":"2026-05-17T23:41:40Z","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":"285f4cbe212fe3e9fd85d0ca7524b6fae32a9c5003160c7053fe9ed5e44f16cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:39:36Z","title_canon_sha256":"7d51bd2a8ea72d311174ad8023f01d2a7cf3df047ec0d1ec4c7696399b6b66e9"},"schema_version":"1.0","source":{"id":"1907.01210","kind":"arxiv","version":1}},"canonical_sha256":"85d0f9ee0d764109a32d7abc0252442c5b3943d6a5bba5f1e5e62d75394aeb56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d0f9ee0d764109a32d7abc0252442c5b3943d6a5bba5f1e5e62d75394aeb56","first_computed_at":"2026-05-17T23:41:40.976281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.976281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t76QvaEsf4aK+unEJFNqfWHU79JN4AyYY+gYm43xPOVfRU2wowuPoPSOgGlbXksj6Oum1wKBSgGsySsQL5zeAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.976747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85a9b4cf061f0956d083fa729352df3858cbfb41970741ccc3b2777184a3eb3e","sha256:7a60a81652a462aea0bfafa363be2174d11b7b5700a9022b379476abfccf1178"],"state_sha256":"703949a9031c41eb2d9361b7f68a468b5210c0544bbfc917244f8cefdfae0a74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4uKoCjEslWQe1yboeh5sxS4UtJxymX8I71KqCwnatKA8EDJtEGd0O7HWDfml0pQricnC+baGCSoceqXwSPQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:16:04.447390Z","bundle_sha256":"510231cf96aad068c96b851b8049708937c9c1b32d47633b18ac96637f4411c9"}}